arXiv AI
Personalized LLM Recommendation with Semantic IDs: Autoregressive Beam Search vs. Multi-Token Prediction
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Machine Learning
Jun 30
Diagnosing and Mitigating Retrieval Bottlenecks in LLM-Based Cold-Start Recommendation
arXiv:2606. 29947v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly used as rerankers in recommender systems, with the expectation that semantic understanding will help in cold-start and long-tail regimes.
Hugging Face Trending Papers
Sep 24
From Interests to Semantic IDs: Retrieval-Grounded Credit Assignment for Generative Recommendation
The paper introduces a retrieval‑grounded credit‑assignment method for generative recommenders that use Semantic IDs (SIDs). By structuring each autoregressive trace into a history summary, a set of interest hypotheses, and a final SID, a frozen retriever verifies each hypothesis as a catalog query. Rewards are assigned at the hypothesis level when any query retrieves the target within the top‑K, allowing distinct updates for rollouts that share the same SID reward and improving SID recommendation performance on Amazon Reviews datasets.
arXiv AI
Oct 12
Beyond Semantic IDs: Finite-Beam Reachability and Continuous-Query Generation in Generative Recommendation
The paper introduces two continuous-query paradigms—CQG‑Single and CQG‑AR—to replace the traditional finite-beam, discrete Semantic ID (SID) decoding used in generative recommendation systems. By removing the SID vocabulary and beam expansion, these methods allow every encoded item to be directly scored via dense or approximate-nearest-neighbor retrieval, thereby eliminating the reachability constraints of finite-beam decoding. Experiments show that CQG‑Single outperforms a TIGER-style baseline across all runs while using fewer parameters, and CQG‑AR performs comparably or better on several datasets, suggesting that decoupling output representation, autoregressive modeling, and retrieval budget can improve generative recommendation evaluation.
arXiv Machine Learning
Jun 25
TokenMinds: Pretrained User Tokens and Embeddings for User Understanding in Large Recommender Systems
arXiv:2606. 25147v1 Announce Type: cross Abstract: User modeling in industrial recommender systems typically produces dense embeddings, which suffer from representational constraints inherent to fixed-dimensional vectors.
arXiv AI
Sep 25
From Interests to Semantic IDs: Retrieval-Grounded Credit Assignment for Generative Recommendation
The paper proposes a retrieval‑grounded credit‑assignment method for generative recommenders that use Semantic IDs (SIDs). By structuring each generated trace into a history summary, a set of interest hypotheses, and a final SID, and then verifying each hypothesis with a frozen retriever, the method assigns reward at the hypothesis level rather than only at the final SID. Experiments on Amazon Reviews datasets show consistent improvements in SID recommendation, and an oracle analysis on Video Games data demonstrates that selecting target‑relevant queries among generated interests boosts recall and ranking.
arXiv AI
Sep 1
Preference Shapes Relevance: Cross-component Hierarchical Semantic Alignment for Personalized Generative Retrieval
The paper introduces CHAP, a personalized generative retrieval framework that aligns query semantics with item representations through a hierarchical semantic alignment module and models user behavior using both discrete Semantic IDs and continuous representations. It also proposes a Residual Cascading Generation mechanism to reduce inference latency by limiting the Transformer decoder to a single pass. Experiments on multiple datasets and online A/B tests show that CHAP outperforms existing methods, demonstrating its practical value.