Onepiece: The Great Route To Generative Recommendation -- A Case Study From Tencent Algorithm Competition

Abstract

In past years, the OpenAI's Scaling-Laws shows the amazing intelligence with the next-token prediction paradigm in neural language modeling, which pointing out a free-lunch way to enhance the model performance by scaling the model parameters. In RecSys, the retrieval stage is also follows a 'next-token prediction' paradigm, to recall the hunderds of items from the global item set, thus the generative recommendation usually refers specifically to the retrieval stage (without Tree-based methods). This raises a philosophical question: without a ground-truth next item, does the generative recommendation also holds a potential scaling law? In retrospect, the generative recommendation has two different technique paradigms: (1) ANN-based framework, utilizing the compressed user embedding to retrieve nearest other items in embedding space, e.g, Kuaiformer. (2) Auto-regressive-based framework, employing the beam search to decode the item from whole space, e.g, OneRec. In this paper, we devise a

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keycao2025onepiece

Related papers

• Cost: Contrastive Quantization Based Semantic Tokenization For Generative Recommendation (2024)7.81
• Sparse Meets Dense: Unified Generative Recommendations With Cascaded Sparse-dense Representations (2025)0.00
• Hierarchical Structured Neural Network: Efficient Retrieval Scaling For Large Scale Recommendation (2024)0.00
• Grank: Towards Target-aware And Streamlined Industrial Retrieval With A Generate-rank Framework (2025)0.00
• Candidate Generation With Binary Codes For Large-scale Top-n Recommendation (2019)12.33
• Generative Retrieval As Dense Retrieval (2023)0.00
• PLUM: Adapting Pre-trained Language Models For Industrial-scale Generative Recommendations (2025)2.26
• Deep Retrieval: Learning A Retrievable Structure For Large-scale Recommendations (2020)0.00