Learning Variable-Length Tokenization for Generative Recommendation
Minhao Wang, Bowen Wu, Wei Zhang

TL;DR
This paper introduces VarLenRec, a novel framework for learning variable-length tokenization in generative recommendation systems, addressing the mismatch in ID length requirements between popular and tail items.
Contribution
It proposes a new variable-length tokenization method with Hyperbolic Residual Quantization and a Soft Length Controller, guided by an information-theoretic framework PIBA, to improve recommendation performance.
Findings
Variable-length IDs outperform fixed-length IDs in recommendation tasks.
Popular items need shorter IDs, tail items benefit from longer IDs.
VarLenRec improves accuracy and efficiency over state-of-the-art methods.
Abstract
Generative recommendation reformulates recommendation as next-token prediction over discrete semantic identifiers (IDs). A fundamental yet unexplored design choice is that existing methods employ fixed-length tokenization for all items, implicitly assuming uniform encoding capacity regardless of item characteristics. Through systematic experiments across four datasets, we discover the Popularity-Length Paradox: popular items achieve optimal performance with short IDs, while tail items require substantially longer codes to capture discriminative semantics. This reveals a critical mismatch where popular items benefit from abundant collaborative signals and require minimal semantic detail, whereas tail items must rely on fine-grained content features due to sparse interaction data. To address this, we propose VarLenRec, a framework for learning variable-length tokenization. We develop…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
