Learning Cascade Ranking as One Network

Yunli Wang, Zhen Zhang, Zhiqiang Wang, Zixuan Yang, Yu Li +4 more
3/12/2025
cs.IRcs.LG

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wang2025learning,
  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},
  year   = {2025},
  eprint = {2503.09492},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.09492v3},
  journal = {ICML 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.09492.svg)](https://codeofpaper.com/paper/2503.09492)

Discussion