On ranking via sorting by estimated expected utility
Clément Calauzènes, Nicolas Usunier
Abstract
Ranking tasks are defined through losses that measure trade-offs between different desiderata such as the relevance and the diversity of the items at the top of the list. This paper addresses the question of which of these tasks are asymptotically solved by sorting by decreasing order of expected utility, for some suitable notion of utility, or, equivalently, when is square loss regression consistent for ranking via score-andsort? We answer to this question by finding a characterization of ranking losses for which a suitable regression is consistent. This characterization has two strong corollaries. First, whenever there exists a consistent approach based on convex risk minimization, there also is a consistent approach based on regression. Second, when regression is not consistent, there are data distributions for which consistent surrogate approaches necessarily have non-trivial local minima, and for which optimal scoring function are necessarily discontinuous, even when the underlying data distribution is regular. In addition to providing a better understanding of surrogate approaches for ranking, these results illustrate the intrinsic difficulty of solving general ranking problems with the score-and-sort approach.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6199f815-f95e-41c1-b81a-e9508ddf4b6bCited by top-tier papers1
Ask how each one uses itRelated papers
- H-Consistency Bounds for Pairwise Misranking Loss SurrogatesAnqi Mao, Mehryar Mohri, Yutao ZhongICML 2023 · 28 citations
- Regression with Cost-based RejectionXin Cheng, Yuzhou Cao, Haobo Wang, Hongxin Wei et al.NeurIPS 2023 · 14 citations
- Formalizing Preferences Over Runtime DistributionsDevon R. Graham, Kevin Leyton-Brown, Tim RoughgardenICML 2023 · 6 citations
- Structured Prediction with Stronger Consistency GuaranteesAnqi Mao, Mehryar Mohri, Yutao ZhongNeurIPS 2023 · 37 citations
- Learning by Minimizing the Sum of Ranked RangeShu Hu, Yiming Ying, Xin Wang, Siwei LyuNeurIPS 2020 · 31 citations
