mlsanityData to 7 Oct 2026

Multi-Label Learning to Rank through Multi-Objective Optimization

arXiv 2207.03060 ↗First posted 7 Jul 2022cs.IR cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

Learning to Rank (LTR) technique is ubiquitous in the Information Retrieval system nowadays, especially in the Search Ranking application. The query-item relevance labels typically used to train the ranking model are often noisy measurements of human behavior, e.g., product rating for product search. The coarse measurements make the ground truth ranking non-unique with respect to a single relevance criterion. To resolve ambiguity, it is desirable to train a model using many relevance criteria, giving rise to Multi-Label LTR (MLLTR). Moreover, it formulates multiple goals that may be conflicting yet important to optimize for simultaneously, e.g., in product search, a ranking model can be trained based on product quality and purchase likelihood to increase revenue. In this research, we leverage the Multi-Objective Optimization (MOO) aspect of the MLLTR problem and employ recently developed MOO algorithms to solve it. Specifically, we propose a general framework where the information from labels can be combined in a variety of ways to meaningfully characterize the trade-off among the goals. Our framework allows for any gradient based MOO algorithm to be used for solving the MLLTR problem. We test the proposed framework on two publicly available LTR datasets and one e-commerce dataset to show its efficacy.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 11 of its 43 references that are in the map. First posted on arXiv 7 Jul 2022.

Builds on

11 of 43 references.

References · 11

  1. 2021Convex optimizationcited by 2,479
  2. 2016An overview of gradient descent optimization algorithmscited by 1,021
  3. 2018Multi-Task Learning as Multi-Objective Optimizationcited by 809
  4. 2019Pareto Multi-Task Learningcited by 224
  5. 2013Introducing LETOR 4.0 Datasetscited by 120
  6. 2019Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Ratescited by 119
  7. 2019Policy Learning for Fairness in Rankingcited by 74
  8. 2020Controlling Fairness and Bias in Dynamic Learning-to-Rankcited by 67
  9. 2019On Application of Learning to Rank for E-Commerce Searchcited by 24
  10. 2019An Alternative Cross Entropy Loss for Learning-to-Rankcited by 17
  11. 2020Multi-objective Ranking via Constrained Optimizationcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 3; 2025: 3; 2026: 2.

10 papers.