To Model or to Intervene: A Comparison of Counterfactual and Online Learning to Rank from User Interactions
Not on the map. Why?
Abstract (arXiv)
Learning to Rank (LTR) from user interactions is challenging as user feedback often contains high levels of bias and noise. At the moment, two methodologies for dealing with bias prevail in the field of LTR: counterfactual methods that learn from historical data and model user behavior to deal with biases; and online methods that perform interventions to deal with bias but use no explicit user models. For practitioners the decision between either methodology is very important because of its direct impact on end users. Nevertheless, there has never been a direct comparison between these two approaches to unbiased LTR. In this study we provide the first benchmarking of both counterfactual and online LTR methods under different experimental conditions. Our results show that the choice between the methodologies is consequential and depends on the presence of selection bias, and the degree of position bias and interaction noise. In settings with little bias or noise counterfactual methods can obtain the highest ranking performance; however, in other circumstances their optimization can be detrimental to the user experience. Conversely, online methods are very robust to bias and noise but require control over the displayed rankings. Our findings confirm and contradict existing expectations on the impact of model-based and intervention-based methods in LTR, and allow practitioners to make an informed decision between the two methodologies.
Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). First posted on arXiv 15 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 3; 2024: 1; 2025: 1; 2026: 2.
13 papers.
Sort:
By area:
- 2021Learning Robust Recommenders through Cross-Model Agreementcited by 15
- 2023RankFormer: Listwise Learning-to-Rank Using Listwide Labelscited by 9
- 2021Robust Generalization and Safe Query-Specialization in Counterfactual Learning to Rankcited by 6
- 2023BSL: Understanding and Improving Softmax Loss for Recommendationcited by 5
- 2022Intersection of Parallels as an Early Stopping Criterioncited by 3
- 2022Extending Open Bandit Pipeline to Simulate Industry Challengescited by 2
- 2024Denoising Long- and Short-term Interests for Sequential Recommendationcited by 2
- 2021Learning Robust Recommender from Noisy Implicit Feedbackcited by 1
- 2022Off-policy evaluation for learning-to-rank via interpolating the item-position model and the position-based modelcited by 1
- 2025Unidentified and Confounded? Understanding Two-Tower Models for Unbiased Learning to Rankcited by 1
- 2023Label Denoising through Cross-Model Agreementcited by 0
- 2026SalesLoop: Reinforcement Learning from Performance Feedback for Sales Lead Rankingcited by 0
- 2026Embedding Surgery: Localized Updates for Adaptive Ranking Correction in Dense Retrieval4 Sep 2026
- 2026SalesLoop: Reinforcement Learning from Performance Feedback for Sales Lead Ranking22 Jul 2026
- 2025Unidentified and Confounded? Understanding Two-Tower Models for Unbiased Learning to Rank25 Jun 2025
- 2024Denoising Long- and Short-term Interests for Sequential Recommendation20 Jul 2024
- 2023BSL: Understanding and Improving Softmax Loss for Recommendation20 Dec 2023
- 2023Label Denoising through Cross-Model Agreement27 Aug 2023
- 2023RankFormer: Listwise Learning-to-Rank Using Listwide Labels9 Jun 2023
- 2022Off-policy evaluation for learning-to-rank via interpolating the item-position model and the position-based model15 Oct 2022
- 2022Extending Open Bandit Pipeline to Simulate Industry Challenges9 Sep 2022
- 2022Intersection of Parallels as an Early Stopping Criterion19 Aug 2022
- 2021Learning Robust Recommender from Noisy Implicit Feedback2 Dec 2021
- 2021Learning Robust Recommenders through Cross-Model Agreement20 May 2021
- 2021Learning Robust Recommenders through Cross-Model Agreementcited by 15
- 2023RankFormer: Listwise Learning-to-Rank Using Listwide Labelscited by 9
- 2021Robust Generalization and Safe Query-Specialization in Counterfactual Learning to Rankcited by 6
- 2023BSL: Understanding and Improving Softmax Loss for Recommendationcited by 5
- 2022Intersection of Parallels as an Early Stopping Criterioncited by 3
- 2022Extending Open Bandit Pipeline to Simulate Industry Challengescited by 2
- 2024Denoising Long- and Short-term Interests for Sequential Recommendationcited by 2
- 2021Learning Robust Recommender from Noisy Implicit Feedbackcited by 1
- 2022Off-policy evaluation for learning-to-rank via interpolating the item-position model and the position-based modelcited by 1
- 2025Unidentified and Confounded? Understanding Two-Tower Models for Unbiased Learning to Rankcited by 1
- 2023Label Denoising through Cross-Model Agreementcited by 0
- 2025Unidentified and Confounded? Understanding Two-Tower Models for Unbiased Learning to Rank25 Jun 2025
- 2024Denoising Long- and Short-term Interests for Sequential Recommendation20 Jul 2024
- 2023BSL: Understanding and Improving Softmax Loss for Recommendation20 Dec 2023
- 2023Label Denoising through Cross-Model Agreement27 Aug 2023
- 2023RankFormer: Listwise Learning-to-Rank Using Listwide Labels9 Jun 2023
- 2022Off-policy evaluation for learning-to-rank via interpolating the item-position model and the position-based model15 Oct 2022
- 2022Extending Open Bandit Pipeline to Simulate Industry Challenges9 Sep 2022
- 2022Intersection of Parallels as an Early Stopping Criterion19 Aug 2022
- 2021Learning Robust Recommender from Noisy Implicit Feedback2 Dec 2021
- 2021Learning Robust Recommenders through Cross-Model Agreement20 May 2021
- 2021Robust Generalization and Safe Query-Specialization in Counterfactual Learning to Rank11 Feb 2021