← Back to all news
arXiv Machine Learning By Yatong Xiao, Yibo Sheng, Lixiang Wang, Mingjie Sun, Yunhao Sha, Pengfei Zhang, Shengyu Wang, Peng Wang, Wenjin Wu, Peng Jiang

Towards Reliable, Scalable, and Value-Aligned Generative Recommendation for Large-Scale Advertising

Read the original on arXiv Machine Learning →

The paper introduces GR4AD‑X, an enhanced generative recommendation framework for large‑scale advertising that tackles three key limitations of its predecessor: unreliable deterministic SID assignment, limited scalability of backbone models, and weak credit assignment in sequence‑level value optimization. GR4AD‑X improves SID reliability via Multi‑Path assignment, expands model capacity across complementary dimensions for better efficiency, and aligns generation with commercial value through Unified Value‑Guided Generation and Discrimination (UniVGD), which optimizes prefix‑level rewards, prunes beams, and reranks discriminatively. Online A/B tests on Kuaishou’s advertising platform show a 3.07% revenue increase over the baseline while meeting strict latency and throughput constraints.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv AI
Oct 12

Beyond Semantic IDs: Finite-Beam Reachability and Continuous-Query Generation in Generative Recommendation

The paper introduces two continuous-query paradigms—CQG‑Single and CQG‑AR—to replace the traditional finite-beam, discrete Semantic ID (SID) decoding used in generative recommendation systems. By removing the SID vocabulary and beam expansion, these methods allow every encoded item to be directly scored via dense or approximate-nearest-neighbor retrieval, thereby eliminating the reachability constraints of finite-beam decoding. Experiments show that CQG‑Single outperforms a TIGER-style baseline across all runs while using fewer parameters, and CQG‑AR performs comparably or better on several datasets, suggesting that decoupling output representation, autoregressive modeling, and retrieval budget can improve generative recommendation evaluation.

By Yu Sun, Renkai Xiang, Zuodong Xiang, Junwei Zhou, Yike Zhang, Jianxin Zhang, Zhihao Zhu, Xiaoyu Cao, Hailu Xu
benchmarks
More like this →
arXiv AI
Oct 15

Personalized LLM Recommendation with Semantic IDs: Autoregressive Beam Search vs. Multi-Token Prediction

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...

By Sejoon Oh, Fernando Amat Gil, Evan Smothers, Dan Iter, Mark Thornburg, Dawit Mureja Argaw, Sourabh Medapati, Thea Wang, Ria Verma, Qiuling Xu, Harshit Syal, Ehsan Gholami, Moumita Bhattacharya, Ashish Rastogi
llmsragreinforcement-learningefficiency
More like this →
arXiv AI
Sep 1

Preference Shapes Relevance: Cross-component Hierarchical Semantic Alignment for Personalized Generative Retrieval

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.

By Gaoming Zhang, Angqing Jiang, Jianchun Song, Kena Qi, Dayao Chen, Wei Lin, Defu Lian
llmsdiffusionefficiencysafety
More like this →