LQ-Rec: Late Quantization Makes Longer Semantic IDs Improve Recommendation Ranking
_reachsumit · x · 2026-11-20
LQ-Rec (Koide, Wang, McAuley) tackles a structural scaling limit in generative retrieval for sequential recommendation: in autoregressive GR, longer semantic IDs reduce quantization error but degrade ranking and cost quadratic memory.
The fix is Late Quantization—confine discretization to the output side. The encoder and scoring operate in continuous space; items are stored as semantic IDs from an end-to-end residual quantizer, enabling an additive error decomposition and a pairwise ordering theorem that bound quantization-induced ranking drop.
On four public benchmarks: ranking improves monotonically with semantic-ID length and beats baselines; one model supports anytime compression (tune quality vs. inference cost without retraining); and it generalizes better on memorization/generalization partitions.
More from Research
- DeepSeek ramps up game designer hiring, fueling game-training rumor — teortaxesTex · 2026-11-20
- ICLR 2027 desk-rejects papers after reviewers fail to file AI-use disclosure forms — algo_diver · 2026-11-20
- Chorus paper: shared n-gram tables cut memory 87% while beating DeepSeek's Engram — brown2green · 2026-11-20
- Synthetic benchmarks for concept bottleneck models isolate failure modes, NeurIPS 2026 — berkustun · 2026-11-20
- Inhabitant: training-free LLM agent completes 74/75 long-horizon household tasks — Yao Zhang · 2026-11-20
- EPFL team unveils unified 3D generative model for structure-based drug design and docking — HannesStaerk · 2026-11-20