Skip to content

VaLiDRec: Variable-Length LLM-Aligned Semantic IDs for Generative Recommendation

Jul 2026 · arXiv.org · Vol abs/2607.25209 · 0 citations · 36 references
Computer Science

TL;DR

VaLiDRec, a generative recommendation framework based on variable-length, LLM-aligned semantic identifiers, demonstrates that LLM-native variable-length semantic identifiers provide a more expressive and efficient paradigm for generative recommendation.

Abstract

Generative recommendation commonly represents items using fixed-length semantic identifiers (SIDs) constructed through clustering and quantization. However, these artificial codes may overcompress item semantics, remain misaligned with pretrained LLM vocabularies, and require costly autoregressive decoding. In light of this, we propose VaLiDRec, a generative recommendation framework based on variable-length, LLM-aligned semantic identifiers. VaLiDRec constructs SIDs directly from informative native LLM vocabulary tokens via token importance estimation, semantic-quality-aware pruning, and collision-aware refinement, allowing identifier lengths to adapt to item semantic complexity. To model user preferences, VaLiDRec incorporates graph-aware soft prompts and reformulates recommendation as token-set prediction with token-level item scoring, eliminating autoregressive SID generation and beam search. Experiments on four real-world datasets show that VaLiDRec consistently outperforms strong sequential and generative recommendation baselines across all evaluation metrics. It further achieves superior zero-shot item cold-start performance and 87.49$\times$ faster inference than LC-Rec. These results demonstrate that LLM-native variable-length semantic identifiers provide a more expressive and efficient paradigm for generative recommendation.

View source

Similar papers

Book Open access Sep 2026

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

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 · 1 citation
Book Open access Sep 2026

Codebook-Based Semantic IDs in Generative Recommendation: Enabling Interface, Emerging Bottleneck

Codebook-based semantic IDs (SIDs), short discrete code sequences produced by quantization over item representations, made generative recommendation practical by turning catalog-scale retrieval into low-cardinality generation. Yet the same interface now concentrates the field’s hardest questions. We revisit the canonic...

Danil Gusak, Evgeny Frolov · 3 citations
Book Open access Sep 2026

Not All Branches Are Equal: Adaptive Semantic ID Construction for Generative Recommendation

Generative recommendation models represent items as sequences of discrete tokens known as semantic IDs. Existing approaches derive these identifiers using residual or hierarchical vector quantization, assuming that tokens carry independent semantic meaning across quantization levels. Revisiting this assumption, we argu...

Guy Hadad, Haggai Roitman, Bracha Shapira · 0 citations
Preprint Aug 2026

Difficulty-Aware Semantic-ID Optimization for Generative Recommendation

Difficulty-Aware Semantic-ID Optimization (DASO), a tree-aware post-training method that addresses failure mode as an online rollout-allocation problem and improves over MiniOneRec-style GRPO on 11 of 12 metrics and achieves the best result on 9 of 12 metrics.

Xin Yu, Stephen Li, S. Aghaei et al. · 1 citation
Preprint Aug 2026

Rethinking Item Tokenization in Generative Recommenders: From Fixed Atoms to Semantic Subwords

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.

Xin-Rui Miao, Mingjia Yin, Jiaqing Zhang et al. · 0 citations
Open access Aug 2026

SETRec++: Scaling Order-agnostic Identifier for Large Language Model-based Generative Recommendation

A novel set identifier paradigm is introduced, representing each item as a set of order-agnostic tokens, which proves SETRec’s superior efficiency and scalability on cold-start items as model sizes increase, and SETRec++’s potential in the scalability of order-agnostic identifier.

Xin-Yu Lin, Chuan-Bo Zhang, Yu-Fan Liu 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.