Skip to content

Personalized LLM Recommendation with Semantic IDs: Autoregressive Beam Search vs. Multi-Token Prediction

Oct 2026 · 0 citations · 28 references
Computer Science

TL;DR

The experiments show single-head beam search consistently beats MTP on most product-critical metrics: ranking and content QA, and trains at roughly 2.6x lower dollar cost on Qwen3-8B scale; MTP wins only on raw inference throughput.

Abstract

Large-scale personalization is shifting from embedding-table retrieval to LLM-based recommenders that generate the Semantic ID (SID) of the item to recommend, where each SID is a short sequence of discrete hierarchical content codes. A single instruction-tuned model can then unify retrieval, content understanding, and language, and recommend brand-new titles from their content alone using SID; then, how should the model generate the SID? Traditionally, models rely on a single language modeling head that generates tokens autoregressively, typically using constrained beam search. In contrast, an emerging body of work explores multi-token prediction (MTP), where dedicated heads predict all tokens in parallel, substantially reducing the decoding latency associated with beam search. We report an industry-scale, apples-to-apples comparison of these two generation paradigms: single-head autoregressive decoding vs. MTP. We introduce a new auxiliary ranking loss, defined over the joint SID score, to train the MTP objective. We evaluate the SID training objectives on both quality and training/inference cost, inside a multi-task LLM that jointly does personalized retrieval, content question-answering (QA), and instruction following over a large streaming-media catalog. Our experiments show single-head beam search consistently beats MTP on most product-critical metrics: ranking and content QA, and trains at roughly 2.6x lower dollar cost on Qwen3-8B scale; MTP wins only on raw inference throughput. Around this finding, we detail an efficient training and inference stack and report end-to-end gains over the previous non-SID baseline equipped with an auxiliary ranking head: +77% item cold-start ranking, +22% content-QA accuracy, +2.8x faster training, with language metric regression traced to SID vocabulary expansion. We address the language regression by reinforcement learning post training.

View source

Similar papers

Book Open access Sep 2026

CoSID: Concept-Conditioned Semantic-ID Decoding for Efficient Generative Recommendation

Generative recommenders retrieve items by autoregressively decoding semantic IDs (SIDs). The standard autoregressive SID interface (SID-AR) represents each history item with K code tokens, expanding a T-item history to TK tokens, while trie-constrained beam search repeatedly re-enters the full backbone during generatio...

Danil Gusak, A. Volodkevich, Evgeny Frolov · 1 citation
#large language models Review Open access Sep 2026

PALRec: Large Language Model-Based Sequential Recommendation with Parameter-Preserving Augmentation

PALRec is proposed, a parameter-preserving augmentation framework that equips an LLM with recommendation capabilities while keeping its original parameters fixed and consistently outperforms fully fine-tuned counterparts in recommendation accuracy while preserving the LLM’s pre-trained knowledge.

Hyunsoo Na, Minseok Gang, Sang-goo Lee et al. · 0 citations
Preprint Oct 2026

Progressive Learning from Content to Relevance to Personalization for CTR Prediction

Multimodal click-through rate (CTR) prediction is central to search systems, where ranking depends on item content, query relevance, and user preference. Existing approaches incorporate content through dense embeddings or coarse discrete IDs, yet effectively integrating fine-grained heterogeneous content with ID-based...

Zhi-Guang Yang, Yu-Lin Yang, Fu-Yu Lv et al. · 0 citations
Preprint Oct 2026

SPAR: Stepwise Personalized Autoregressive Recommendation with Prefix-Balanced Semantic IDs

Semantic ID (SID)-based generative recommendation retrieves items through successive token-level decisions, making personalization at each decoding step essential. However, existing methods insufficiently account for prefix-dependent user evidence and imbalanced historical interaction loads among candidate branches. Th...

Chun-Rui Zhang, Gao-Yun Lin, Chang Zhou et al. · 0 citations
#artificial intelligence Review Sep 2026

From Interests to Semantic IDs: Retrieval-Grounded Credit Assignment for Generative Recommendation

This work addresses the credit-assignment gap in SID recommendation with retrieval-grounded query attribution, and reveals the potential of interest-conditioned SID decoding: selecting the target-relevant query among generated interests improves both recall and ranking.

Meng-Dan Zhu, Yu-Fan Zhao, Yao Zhao et al. · 0 citations
Preprint Sep 2026

SPRINT: Single-Step Generative Recommendation via Average Probability Velocity

Semantic ID (SID) based generative recommendation represents each item as a sequence of discrete tokens, and recommends by generating the SID of the item a user would like to interact with. Both dominant paradigms in this domain generally pay for generation token by token: autoregressive models decode the tokens left-t...

Zhuo Cai, Shou-Jin Wang, Pei-Lin Zhou et al. · 2 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.