用多个生成器竞争,提升推荐列表质量。
Comprehensive List Generation for Multi-Generator Reranking
- 设计多生成器框架,通过互补性优化推荐列表
- 在两个公开数据集和线上A/B测试中验证有效
- 适合追求高精度推荐的系统研发人员
重排序模型旨在生成最能满足用户需求的推荐列表。现有方法通常聚焦于学习参数化模型以逼近最优策略,而近期研究发现,生成多个候选列表并让它们在评估者面前竞争“通过”资格,效果更佳——评估者作为监督者,能准确估计各候选列表的表现。本文提出一种多生成器框架,实证证明其在两个公开数据集及线上A/B测试中均更高效、更有效。更重要的是,我们验证了生成器的有效性与其与其他生成器的重排序差异程度密切相关,由此提出“列表全面性”度量。基于此,设计自动寻找互补生成器的框架,学习同时对齐用户偏好并最大化全面性指标的策略。实验结果表明,该框架可进一步提升多生成器重排序性能。
原文摘要 · Abstract (English)
Reranking models solve the final recommendation lists that best fulfill users' demands. While existing solutions focus on finding parametric models that approximate optimal policies, recent approaches find that it is better to generate multiple lists to compete for a ``pass'' ticket from an evaluator, where the evaluator serves as the supervisor who accurately estimates the performance of the candidate lists. In this work, we show that we can achieve a more efficient and effective list proposal with a multi-generator framework and provide empirical evidence on two public datasets and online A/B tests. More importantly, we verify that the effectiveness of a generator is closely related to how much it complements the views of other generators with sufficiently different rerankings, which derives the metric of list comprehensiveness. With this intuition, we design an automatic complementary generator-finding framework that learns a policy that simultaneously aligns the users' preferences and maximizes the list comprehensiveness metric. The experimental results indicate that the proposed framework can further improve the multi-generator reranking performance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。