mlsanityData to 7 Oct 2026

Safe Deployment for Counterfactual Learning to Rank with Exposure-Based Risk Minimization

arXiv 2305.01522 ↗First posted 26 Apr 2023cs.IR cs.LGcited by 11

Not on the map. Why?

Abstract (arXiv)

Counterfactual learning to rank (CLTR) relies on exposure-based inverse propensity scoring (IPS), a LTR-specific adaptation of IPS to correct for position bias. While IPS can provide unbiased and consistent estimates, it often suffers from high variance. Especially when little click data is available, this variance can cause CLTR to learn sub-optimal ranking behavior. Consequently, existing CLTR methods bring significant risks with them, as naively deploying their models can result in very negative user experiences. We introduce a novel risk-aware CLTR method with theoretical guarantees for safe deployment. We apply a novel exposure-based concept of risk regularization to IPS estimation for LTR. Our risk regularization penalizes the mismatch between the ranking behavior of a learned model and a given safe model. Thereby, it ensures that learned ranking models stay close to a trusted model, when there is high uncertainty in IPS estimation, which greatly reduces the risks during deployment. Our experimental results demonstrate the efficacy of our proposed method, which is effective at avoiding initial periods of bad performance when little data is available, while also maintaining high performance at convergence. For the CLTR field, our novel exposure-based risk minimization method enables practitioners to adopt CLTR methods in a safer manner that mitigates many of the risks attached to previous methods.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 13 of its 53 references that are in the map. First posted on arXiv 26 Apr 2023.

Builds on

13 of 53 references.

References · 13

  1. 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 504
  2. 2016Unbiased Learning-to-Rank with Biased Feedbackcited by 155
  3. 2013Introducing LETOR 4.0 Datasetscited by 120
  4. 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
  5. 2021Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairnesscited by 35
  6. 2019Policy-Gradient Training of Fair and Unbiased Ranking Functionscited by 16
  7. 2020Unifying Online and Counterfactual Learning to Rankcited by 15
  8. 2020Safe Exploration for Optimizing Contextual Banditscited by 14
  9. 2022Reaching the End of Unbiasedness: Uncovering Implicit Limitations of Click-Based Learning to Rankcited by 10
  10. 2020Taking the Counterfactual Online: Efficient and Unbiased Online Evaluation for Rankingcited by 8
  11. 2021Robust Generalization and Safe Query-Specialization in Counterfactual Learning to Rankcited by 6
  12. 2020Learning from User Interactions with Rankings: A Unification of the Fieldcited by 5
1 more
  1. 2019Off-policy Learning for Multiple Loggerscited by 4

Built on by

Cited by year (2026 to 7 Oct)

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

11 papers.