Pctx: Tokenizing Personalized Context for Generative Recommendation

• URL: http://arxiv.org/abs/2510.21276v1
• Date: Fri, 24 Oct 2025 09:22:04 GMT
• Title: Pctx: Tokenizing Personalized Context for Generative Recommendation
• Abstract summary: Generative recommendation (GR) models tokenize each action into a few discrete tokens (called semantic IDs) and autoregressively generate the next tokens as predictions.<n>Existing tokenization methods are static and non-personalized.<n>We propose a personalized context-aware tokenizer that incorporates a user's historical interactions when generating semantic IDs.
• Score: 27.81918228020653
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generative recommendation (GR) models tokenize each action into a few discrete tokens (called semantic IDs) and autoregressively generate the next tokens as predictions, showing advantages such as memory efficiency, scalability, and the potential to unify retrieval and ranking. Despite these benefits, existing tokenization methods are static and non-personalized. They typically derive semantic IDs solely from item features, assuming a universal item similarity that overlooks user-specific perspectives. However, under the autoregressive paradigm, semantic IDs with the same prefixes always receive similar probabilities, so a single fixed mapping implicitly enforces a universal item similarity standard across all users. In practice, the same item may be interpreted differently depending on user intentions and preferences. To address this issue, we propose a personalized context-aware tokenizer that incorporates a user's historical interactions when generating semantic IDs. This design allows the same item to be tokenized into different semantic IDs under different user contexts, enabling GR models to capture multiple interpretive standards and produce more personalized predictions. Experiments on three public datasets demonstrate up to 11.44% improvement in NDCG@10 over non-personalized action tokenization baselines. Our code is available at https://github.com/YoungZ365/Pctx.

Related papers

• Expressiveness Limits of Autoregressive Semantic ID Generation in Generative Recommendation [37.7230289841301]
  Generative recommendation (GR) models generate items by autoregressively producing a sequence of discrete tokens that jointly index the target item.<n>We propose Latte, a simple modification that injects a latent token before each semantic ID, reshaping the decoding space from a single tree into multiple latent-token-conditioned trees.
  arXiv  Detail & Related papers  (2026-05-07T14:25:10Z)
• AnyID: Ultra-Fidelity Universal Identity-Preserving Video Generation from Any Visual References [52.81991915377852]
  We present AnyID, an ultra-fidelity identity-preservation video generation framework.<n>First, we introduce a scalable omni-referenced architecture that effectively unifies heterogeneous identity inputs into a cohesive representation.<n>Second, we propose a primary-referenced generation paradigm, which designates one reference as a canonical anchor and uses a novel differential prompt to enable precise, attribute-level controllability.
  arXiv  Detail & Related papers  (2026-03-26T08:54:48Z)
• CoFiRec: Coarse-to-Fine Tokenization for Generative Recommendation [55.783414010717074]
  CoFiRec is a novel generative recommendation framework that decomposes item information into semantic levels.<n>We show that CoFiRec outperforms existing methods, offering a new perspective for generative recommendation.
  arXiv  Detail & Related papers  (2025-11-27T18:59:35Z)
• Generating Long Semantic IDs in Parallel for Recommendation [29.97624755406803]
  We propose RPG, a lightweight framework for semantic ID-based recommendation.<n>We train the model to predict each token independently using a multi-token prediction loss.<n> Experiments show that scaling up semantic ID length to 64 enables RPG to outperform generative baselines.
  arXiv  Detail & Related papers  (2025-06-06T06:20:37Z)
• Pre-training Generative Recommender with Multi-Identifier Item Tokenization [78.87007819266957]
  We propose MTGRec to augment token sequence data for Generative Recommender pre-training.<n>Our approach involves two key innovations: multi-identifier item tokenization and curriculum recommender pre-training.<n>Extensive experiments on three public benchmark datasets demonstrate that MTGRec significantly outperforms both traditional and generative recommendation baselines.
  arXiv  Detail & Related papers  (2025-04-06T08:03:03Z)
• Unified Semantic and ID Representation Learning for Deep Recommenders [28.709935854073535]
  We propose a Unified Semantic and ID Representation Learning framework.<n>In our framework, ID tokens capture unique item attributes, while semantic tokens represent shared, transferable characteristics.<n>Our framework integrates cosine similarity in earlier layers and Euclidean distance in the final layer to optimize representation learning.
  arXiv  Detail & Related papers  (2025-02-23T07:17:28Z)
• ActionPiece: Contextually Tokenizing Action Sequences for Generative Recommendation [43.597904136597876]
  We propose ActionPiece to explicitly incorporate context when tokenizing action sequences.<n>We construct the vocabulary by merging feature patterns as new tokens, based on their co-occurrence frequency.<n>Considering the unordered nature of feature sets, we further introduce set permutation regularization.
  arXiv  Detail & Related papers  (2025-02-19T09:45:29Z)
• Order-agnostic Identifier for Large Language Model-based Generative Recommendation [94.37662915542603]
  Items are assigned identifiers for Large Language Models (LLMs) to encode user history and generate the next item.<n>Existing approaches leverage either token-sequence identifiers, representing items as discrete token sequences, or single-token identifiers, using ID or semantic embeddings.<n>We propose SETRec, which leverages semantic tokenizers to obtain order-agnostic multi-dimensional tokens.
  arXiv  Detail & Related papers  (2025-02-15T15:25:38Z)
• Learning Multi-Aspect Item Palette: A Semantic Tokenization Framework for Generative Recommendation [55.99632509895994]
  We introduce LAMIA, a novel approach for multi-aspect semantic tokenization.<n>Unlike RQ-VAE, which uses a single embedding, LAMIA learns an item palette''--a collection of independent and semantically parallel embeddings.<n>Our results demonstrate significant improvements in recommendation accuracy over existing methods.
  arXiv  Detail & Related papers  (2024-09-11T13:49:48Z)
• Object Recognition as Next Token Prediction [99.40793702627396]
  We present an approach to pose object recognition as next token prediction. The idea is to apply a language decoder that auto-regressively predicts the text tokens from image embeddings to form labels.
  arXiv  Detail & Related papers  (2023-12-04T18:58:40Z)
• Self-Supervised Disentanglement by Leveraging Structure in Data Augmentations [63.73044203154743]
  Self-supervised representation learning often uses data augmentations to induce "style" attributes of the data. It is difficult to deduce a priori which attributes of the data are indeed "style" and can be safely discarded. We introduce a more principled approach that seeks to disentangle style features rather than discard them.
  arXiv  Detail & Related papers  (2023-11-15T09:34:08Z)
• Topology-aware Debiased Self-supervised Graph Learning for Recommendation [6.893289671937124]
  We propose Topology-aware De Self-supervised Graph Learning ( TDSGL) for recommendation. TDSGL constructs contrastive pairs according to the semantic similarity between users (items) Our results show that the proposed model outperforms the state-of-the-art models significantly on three public datasets.
  arXiv  Detail & Related papers  (2023-10-24T14:16:19Z)
• Better Generalization with Semantic IDs: A Case Study in Ranking for Recommendations [24.952222114424146]
  We propose using content-derived features as a replacement for random ids. We show that simply replacing ID features with content-based embeddings can cause a drop in quality due to reduced memorization capability. Similar to content embeddings, the compactness of Semantic IDs poses a problem of easy adaption in recommendation models.
  arXiv  Detail & Related papers  (2023-06-13T20:34:15Z)
• Sparse-Interest Network for Sequential Recommendation [78.83064567614656]
  We propose a novel textbfSparse textbfInterest textbfNEtwork (SINE) for sequential recommendation. Our sparse-interest module can adaptively infer a sparse set of concepts for each user from the large concept pool. SINE can achieve substantial improvement over state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-02-18T11:03:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.