arXiv:2608. 09685v1 Announce Type: new Abstract: Autoregressive semantic ID recommenders are constrained by expensive beam-search decoding, which limits the practical length of item identifiers.
arXiv:2607. 28659v1 Announce Type: new Abstract: Cross-domain sequential recommendation (CDSR) aims to model users' dynamic interest transitions and sequential patterns across multiple domains.
arXiv:2607. 25209v1 Announce Type: cross Abstract: Generative recommendation commonly represents items using fixed-length semantic identifiers (SIDs) constructed through clustering and quantization.
FineSID introduces a new quantization framework for semantic identifier learning in generative recommendation systems. By replacing the traditional Top‑1 hard assignment with a soft, differentiable approach, it distributes gradient updates across all codewords, leading to balanced codebook optimization and reduced identifier collisions. Experiments on public benchmarks show that FineSID improves codebook utilization and recommendation accuracy without relying on complex initialization strategies.
arXiv:2607. 25216v1 Announce Type: cross Abstract: Semantic ID-based generative recommendation tokenizes each item into a sequence of discrete semantic IDs and predicts the next item by generating semantic IDs.
arXiv:2605. 17779v2 Announce Type: replace Abstract: Generative recommendation reformulates recommendation as next-token prediction over discrete semantic identifiers (IDs).
arXiv:2608. 11980v1 Announce Type: cross Abstract: Semantic-ID generative recommenders represent each item as a short sequence of discrete semantic tokens and predict the next item by autoregressively generating this token sequence.
arXiv:2608. 07816v1 Announce Type: cross Abstract: Recent advances in generative recommendation (GR) leverage large language models (LLMs) as recommender backbones, enabling LLMs to directly generate recommendations conditioned on item-interaction histories.
arXiv:2506. 16114v3 Announce Type: replace-cross Abstract: Generative recommendations (GR), which usually include item tokenizers and generative Large Language Models (LLMs), have demonstrated remarkable success across a wide range of scenarios.
arXiv:2511.22707v2 Announce Type: replace-cross Abstract: In web environments, user preferences are often refined progressively as users move from browsing broad categories to exploring specific item...
arXiv:2512. 11529v3 Announce Type: replace Abstract: Recommendation system delivers substantial economic benefits by providing personalized predictions.
The paper proposes replacing a static multi‑level small semantic codebook with a dynamic single‑level large semantic codebook for generative recommendation. It introduces an exposure‑aware update mechanism and an offline evaluation framework, achieving significant improvements in recall, NDCG, decoding efficiency, and online consumption metrics on public datasets and production traffic.
DeGRe is a dense‑supervised generative reranking framework designed to improve multi‑stage recommender systems by addressing label bias and credit assignment issues. It uses an offline Lookahead Evaluator with beam search to generate dense supervision signals, which are distilled into a lightweight Online Generator that can perform efficient greedy decoding at inference time. Experiments show that DeGRe outperforms baselines on public benchmarks and industrial datasets, and it has been successfully deployed on Taobao Flash Shopping to enhance online recommendations.