mlsanityData to 14 Oct 2026

Inference-time Stochastic Ranking with Risk Control

arXiv 2306.07188 ↗First posted 12 Jun 2023cs.LG cs.CY cs.IRcited by 3

Not on the map. Why?

Abstract (arXiv)

Learning to Rank (LTR) methods are vital in online economies, affecting users and item providers. Fairness in LTR models is crucial to allocate exposure proportionally to item relevance. Widely used deterministic LTR models can lead to unfair exposure distribution, especially when items with the same relevance receive slightly different ranking scores. Stochastic LTR models, incorporating the Plackett-Luce (PL) ranking model, address fairness issues but suffer from high training cost. In addition, they cannot provide guarantees on the utility or fairness, which can lead to dramatic degraded utility when optimized for fairness. To overcome these limitations, we propose Inference-time Stochastic Ranking with Risk Control (ISRR), a novel method that performs stochastic ranking at inference time with guanranteed utility or fairness given pretrained scoring functions from deterministic or stochastic LTR models. Comprehensive experimental results on three widely adopted datasets demonstrate that our proposed method achieves utility and fairness comparable to existing stochastic ranking methods with much lower computational cost. In addition, results verify that our method provides finite-sample guarantee on utility and fairness. This advancement represents a significant contribution to the field of stochastic ranking and fair LTR with promising real-world applications.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 19 of its 41 references that are in the map. First posted on arXiv 12 Jun 2023.

Builds on

19 of 41 references.

References · 19

  1. 2021A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantificationcited by 792
  2. 2022Conformal Risk Controlcited by 299
  3. 2021Distribution-Free, Risk-Controlling Prediction Setscited by 288
  4. 2018Equity of Attention: Amortizing Individual Fairness in Rankingscited by 124
  5. 2013Introducing LETOR 4.0 Datasetscited by 121
  6. 2019Policy Learning for Fairness in Rankingcited by 74
  7. 2020Controlling Fairness and Bias in Dynamic Learning-to-Rankcited by 68
  8. 2020Evaluating Stochastic Rankings with Expected Exposurecited by 53
  9. 2021Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairnesscited by 36
  10. 2018Differentiable Unbiased Online Learning to Rankcited by 24
  11. 2022Joint Multisided Exposure Fairness for Recommendationcited by 22
  12. 2018Towards Deep and Representation Learning for Talent Search at LinkedIncited by 19
7 more
  1. 2019Policy-Gradient Training of Fair and Unbiased Ranking Functionscited by 16
  2. 2022Improving Screening Processes via Calibrated Subset Selectioncited by 16
  3. 2020StochasticRank: Global Optimization of Scale-Free Discrete Functionscited by 13
  4. 2022Learning-to-Rank at the Speed of Sampling: Plackett-Luce Gradient Estimation With Minimal Computational Complexitycited by 13
  5. 2022Recommendation Systems with Distribution-Free Reliability Guaranteescited by 13
  6. 2022Learning To Rank Diversely At Airbnbcited by 6
  7. 2022Vertical Allocation-based Fair Exposure Amortizing in Rankingcited by 3

Built on by

Cited by year

Citing papers per year: 2024: 2; 2025: 1.

3 papers.