Semantic Subword Tokenization (SST) is proposed, which represents historical items as variable-length semantic subwords while preserving fixed-length target decoding and introduces Behavior-induced Co-occurrence Augmentation to inject coarse-grained semantic prefix transition signals.
Abstract
In generative recommender systems, items are typically tokenized into fixed-length semantic ID sequences for autoregressive next-item prediction. However, for user-context modeling, this fine-grained representation triggers Intra-item Attention Overload: excessive attention is spent on low-level intra-item dependencies rather than high-level inter-item behavioral transitions. To address this, we propose Semantic Subword Tokenization (SST), which represents historical items as variable-length semantic subwords while preserving fixed-length target decoding. SST first applies Item-level Subword Tokenization (IST) to merge stable adjacent atom tokens into compact semantic subword tokens, thereby reducing intra-item reassembly in the encoder. It then introduces Behavior-induced Co-occurrence Augmentation (BCA) to inject coarse-grained semantic prefix transition signals, guiding the freed modeling capacity toward inter-item behavioral regularities. Extensive experiments on three public datasets and three generative recommender backbones show empirical improvements of SST over fixed-length and transferable variable-length SID baselines. Code is available at https://github.com/mxrcandy/Semantic-Subword-Tokenization.
This work proposes a simple, parameter-free intervention that initializes SID token embeddings directly from their corresponding centroids in the semantic embedding space, and shows that preserving SID geometry, beyond shared-prefix structure, provides a simple and effective semantic prior for LLM-based GR.
Donald Loveland, Liam Collins, B. Kumar et al.· 0 citations
CoSID is introduced, a concept-conditioned SID decoder that encodes the history once into a compact next-item concept and delegates the entire beam search to a lightweight KV-cached decoder.
Danil Gusak, A. Volodkevich, Evgeny Frolov· Proceedings of the 20th ACM...· 1 citation
This work proposes Hint-Conditioned Generative Recommendation (HCGRec), a semantic-ID generative recommendation framework that recovers learning signal for such hard training instances and introduces hint-aware credit decomposition, using supervised learning to preserve item-semantic and prefix-structure alignment for...
Kang-Ning Zhang, Hao Fang, Xukun Luo et al.· 0 citations
This work proposes a funderline-based item-based item tokenizer (Tlow) to transform raw semantic embeddings into a latent space where embeddings conform to a unified standard normal distribution, achieving dual advantages of dimensional independence and distributional simplicity.
Nian Li, Chonggang Song, Jing-Tao Ding et al.· 0 citations
This work proposes OMG, a GR method that unifies behavior modeling and semantic generation to produce recommendations that seamlessly integrate both information, and introduces Behavior-Reinforced Semantic Generation, which introduces reinforcement learning with behavior-aware rewards to enhance the model's reasoning c...
Bin-Quan Wu, Xinbo Chen, Yicheng Luo et al.· Proceedings of the 32nd ACM...· 0 citations
Semantic ID (SID) generative recommendation predicts the next item by generating a short tuple of discrete tokens. Recent masked-diffusion methods improve this process through bidirectional context and flexible decoding, yet recommendation ultimately requires selecting among complete catalog items. At each denoising st...
Tuan-Binh Tran, T. Nguyen, Quoc Viet Hung Nguyen et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.