arXiv:2503.09492cs.IRcs.LG2025-03ICML被引 6

提出统一训练框架,让多阶段排序系统更精准召回目标项

Learning Cascade Ranking as One Network

  • 用下界概率设计新损失函数,对齐整体召回目标
  • 每阶段加辅助损失,提升各阶段协作效率
  • 端到端训练,显著优于现有方法

级联排序是推荐与广告平台中大规模 top-k 选择的主流架构。传统训练方法仅关注单阶段优化,忽视阶段间交互。尽管已有研究引入交互感知训练,但仍面临两大挑战:1)训练目标与整个级联排序的最终目标(即准确召回真实项)不一致;2)难以学习不同阶段间的有效协作模式。为此,我们提出 LCRON,基于真实项被级联排序选中的下界概率,设计新型代理损失函数,确保与系统整体目标对齐。根据该下界性质,进一步为每一阶段设计辅助损失,驱动下界减小,从而实现更稳健有效的 top-k 选择。LCRON 可将整个级联排序系统作为统一网络进行端到端训练。实验表明,其在公开数据集和工业应用中均显著优于现有方法,有效解决级联排序训练的关键瓶颈,大幅提升系统性能。

原文摘要 · Abstract (English)

Cascade Ranking is a prevalent architecture in large-scale top-k selection systems like recommendation and advertising platforms. Traditional training methods focus on single-stage optimization, neglecting interactions between stages. Recent advances have introduced interaction-aware training paradigms, but still struggle to 1) align training objectives with the goal of the entire cascade ranking (i.e., end-to-end recall of ground-truth items) and 2) learn effective collaboration patterns for different stages. To address these challenges, we propose LCRON, which introduces a novel surrogate loss function derived from the lower bound probability that ground truth items are selected by cascade ranking, ensuring alignment with the overall objective of the system. According to the properties of the derived bound, we further design an auxiliary loss for each stage to drive the reduction of this bound, leading to a more robust and effective top-k selection. LCRON enables end-to-end training of the entire cascade ranking system as a unified network. Experimental results demonstrate that LCRON achieves significant improvement over existing methods on public benchmarks and industrial applications, addressing key limitations in cascade ranking training and significantly enhancing system performance.

排序模型级联排序端到端训练

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。