On ranking via sorting by estimated expected utility
Clément Calauzènes, Nicolas Usunier
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- H-Consistency Bounds for Pairwise Misranking Loss SurrogatesAnqi Mao, Mehryar Mohri, Yutao ZhongICML 2023 · 被引用 28 次
- Regression with Cost-based RejectionXin Cheng, Yuzhou Cao, Haobo Wang, Hongxin Wei 等NeurIPS 2023 · 被引用 14 次
- Formalizing Preferences Over Runtime DistributionsDevon R. Graham, Kevin Leyton-Brown, Tim RoughgardenICML 2023 · 被引用 6 次
- Structured Prediction with Stronger Consistency GuaranteesAnqi Mao, Mehryar Mohri, Yutao ZhongNeurIPS 2023 · 被引用 37 次
- Learning by Minimizing the Sum of Ranked RangeShu Hu, Yiming Ying, Xin Wang, Siwei LyuNeurIPS 2020 · 被引用 31 次
