用列表偏好优化提升推荐生成检索的排序能力,更懂用户真实偏好。
RankGR: Rank-Enhanced Generative Retrieval with Listwise Direct Preference Optimization in Recommendation
- 分两阶段:先用列表偏好优化理解用户层级偏好,再轻量评分细化候选
- 在淘宝推荐场景实现每秒近万请求,线上点击率显著提升
- 适合追求高精度排序与实时响应的工业级推荐系统研发者
生成式检索(GR)通过自回归解码目标物品标识符,在推荐系统中展现出潜力。然而现有方法多依赖下一个词预测机制,仅将下一个交互物品的每个标识符视为单一目标,难以捕捉用户偏好的细微结构,也忽略了解码标识符与用户行为序列间的深层互动。针对此问题,我们提出RankGR,一种融合列表级直接偏好优化的增强型生成式检索方法。RankGR将检索过程分为两个互补阶段:初始评估阶段(IAP)和精炼评分阶段(RSP)。IAP中引入新型列表级直接偏好优化策略,更全面地建模用户偏好层次与部分序关系;RSP则利用轻量级评分模块,基于输入序列的交互信息对IAP生成的前λ个候选进行精细化打分,提升候选评估精度。两个阶段在统一的GR模型下联合优化,保证一致性与效率。此外,我们在训练与部署层面实施多项实用改进,最终实现每秒近万请求的实时系统。在科研与工业数据集上的离线测试,以及淘宝“猜你喜欢”场景的在线实验,均验证了RankGR的有效性与可扩展性。
原文摘要 · Abstract (English)
Generative retrieval (GR) has emerged as a promising paradigm in recommendation systems by autoregressively decoding identifiers of target items. Despite its potential, current approaches typically rely on the next-token prediction schema, which treats each token of the next interacted items as the sole target. This narrow focus 1) limits their ability to capture the nuanced structure of user preferences, and 2) overlooks the deep interaction between decoded identifiers and user behavior sequences. In response to these challenges, we propose RankGR, a Rank-enhanced Generative Retrieval method that incorporates listwise direct preference optimization for recommendation. RankGR decomposes the retrieval process into two complementary stages: the Initial Assessment Phase (IAP) and the Refined Scoring Phase (RSP). In IAP, we incorporate a novel listwise direct preference optimization strategy into GR, thus facilitating a more comprehensive understanding of the hierarchical user preferences and more effective partial-order modeling. The RSP then refines the top-λ candidates generated by IAP with interactions towards input sequences using a lightweight scoring module, leading to more precise candidate evaluation. Both phases are jointly optimized under a unified GR model, ensuring consistency and efficiency. Additionally, we implement several practical improvements in training and deployment, ultimately achieving a real-time system capable of handling nearly ten thousand requests per second. Extensive offline performance on both research and industrial datasets, as well as the online gains on the "Guess You Like" section of Taobao, validate the effectiveness and scalability of RankGR.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。