WeGR is a unified generative retrieval framework that tackles two key challenges in industrial search: preserving collaborative signals in tokenization and mitigating reward sparsity in reinforcement learning. It introduces the Collaborative and Collapse-free Tokenizer (CoCo‑VAE) to embed query‑to‑item and item‑to‑item signals into continuous representations before quantization, while also refreshing underutilized codewords to maintain balanced codebook usage. For preference alignment, Dynamic Horizon Policy Optimization (DHPO) expands reward evaluation horizons to enable coarse‑to‑fine learning from SID prefixes to full items without auxiliary reward models. Extensive offline tests and a six‑week online A/B test on a large‑scale e‑commerce platform demonstrate that WeGR improves retrieval and ranking performance, yielding relative gains of 2.539% in orders, 1.508% in CTR, and 1.381% in CVR, and reduces CPU and GPU usage by 25.5% and 26.1% respectively.
arXiv:2610.16979v1 Announce Type: cross Abstract: Generative retrieval (GR) offers a promising paradigm for industrial search by unifying candidate generation within an autoregressive framework. Howe...
arXiv:2608. 11980v2 Announce Type: replace-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. 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.
The paper introduces CHAP, a personalized generative retrieval framework that aligns query semantics with item representations through a hierarchical semantic alignment module and models user behavior using both discrete Semantic IDs and continuous representations. It also proposes a Residual Cascading Generation mechanism to reduce inference latency by limiting the Transformer decoder to a single pass. Experiments on multiple datasets and online A/B tests show that CHAP outperforms existing methods, demonstrating its practical value.
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:2610.15864v1 Announce Type: cross Abstract: Large-scale personalization is shifting from embedding-table retrieval to LLM-based recommenders that generate the Semantic ID (SID) of the item to r...
arXiv:2609.00638v1 Announce Type: cross Abstract: Retrieval is the first stage of modern search and advertising systems, selecting a candidate set from a large item universe for downstream ranking an...
arXiv:2608. 14011v1 Announce Type: cross Abstract: Generative recommendation autoregressively generates the semantic IDs of the target item, unifying preference modeling and index retrieval within the shared token space.
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.
arXiv:2605. 17648v2 Announce Type: replace Abstract: Generative recommendation treats next-item prediction as autoregressive item-identifier generation.
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.
The paper introduces a retrieval‑grounded credit‑assignment method for generative recommenders that use Semantic IDs (SIDs). By structuring each autoregressive trace into a history summary, a set of interest hypotheses, and a final SID, a frozen retriever verifies each hypothesis as a catalog query. Rewards are assigned at the hypothesis level when any query retrieves the target within the top‑K, allowing distinct updates for rollouts that share the same SID reward and improving SID recommendation performance on Amazon Reviews datasets.