Metric-agnostic Learning-to-Rank via Boosting and Rank Approximation
Camilo Gomez, Pengyang Wang, Yanjie Fu

TL;DR
This paper introduces a metric-agnostic, differentiable learning-to-rank framework using boosting and rank approximation, enabling efficient optimization across multiple ranking metrics.
Contribution
It proposes a novel listwise LTR method with a differentiable loss and gradient boosting, improving generalization and performance over existing metric-dependent approaches.
Findings
Outperforms state-of-the-art in information retrieval metrics
Efficient training with a new differentiable ranking loss
Generalizes well across different ranking metrics
Abstract
Learning-to-Rank (LTR) is a supervised machine learning approach that constructs models specifically designed to order a set of items or documents based on their relevance or importance to a given query or context. Despite significant success in real-world information retrieval systems, current LTR methods rely on one prefix ranking metric (e.g., such as Normalized Discounted Cumulative Gain (NDCG) or Mean Average Precision (MAP)) for optimizing the ranking objective function. Such metric-dependent setting limits LTR methods from two perspectives: (1) non-differentiable problem: directly optimizing ranking functions over a given ranking metric is inherently non-smooth, making the training process unstable and inefficient; (2) limited ranking utility: optimizing over one single metric makes it difficult to generalize well to other ranking metrics of interest. To address the above issues,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
