English

Learning Cascade Ranking as One Network

Information Retrieval 2025-06-05 v3 Machine Learning

Abstract

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.

Keywords

Cite

@article{arxiv.2503.09492,
  title  = {Learning Cascade Ranking as One Network},
  author = {Yunli Wang and Zhen Zhang and Zhiqiang Wang and Zixuan Yang and Yu Li and Jian Yang and Shiyang Wen and Peng Jiang and Kun Gai},
  journal= {arXiv preprint arXiv:2503.09492},
  year   = {2025}
}

Comments

Accepted by ICML 2025

R2 v1 2026-06-28T22:17:45.131Z