Taking the Counterfactual Online: Efficient and Unbiased Online Evaluation for Ranking
Not on the map. Why?
Abstract (arXiv)
Counterfactual evaluation can estimate Click-Through-Rate (CTR) differences between ranking systems based on historical interaction data, while mitigating the effect of position bias and item-selection bias. We introduce the novel Logging-Policy Optimization Algorithm (LogOpt), which optimizes the policy for logging data so that the counterfactual estimate has minimal variance. As minimizing variance leads to faster convergence, LogOpt increases the data-efficiency of counterfactual estimation. LogOpt turns the counterfactual approach - which is indifferent to the logging policy - into an online approach, where the algorithm decides what rankings to display. We prove that, as an online evaluation method, LogOpt is unbiased w.r.t. position and item-selection bias, unlike existing interleaving methods. Furthermore, we perform large-scale experiments by simulating comparisons between thousands of rankers. Our results show that while interleaving methods make systematic errors, LogOpt is as efficient as interleaving without being biased.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Jul 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 4; 2024: 0; 2025: 0; 2026: 2.
8 papers.
- 2021Robust On-Policy Sampling for Data-Efficient Policy Evaluation in Reinforcement Learningcited by 15
- 2022Safe Exploration for Efficient Policy Evaluation and Comparisoncited by 15
- 2023Safe Deployment for Counterfactual Learning to Rank with Exposure-Based Risk Minimizationcited by 11
- 2023SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Banditscited by 3
- 2023Recent Advances in the Foundations and Applications of Unbiased Learning to Rankcited by 1
- 2023Theoretical Analysis on the Efficiency of Interleaved Comparisonscited by 0
- 2026Accelerating A/B-Tests with Counterfactual Estimation: Reducing Variance through Policy Overlapcited by 0
- 2026Exposure-Based Reinforcement Learning to Rankcited by 0
- 2026Exposure-Based Reinforcement Learning to Rank21 Jul 2026
- 2026Accelerating A/B-Tests with Counterfactual Estimation: Reducing Variance through Policy Overlap16 Jul 2026
- 2023Theoretical Analysis on the Efficiency of Interleaved Comparisons31 May 2023
- 2023Recent Advances in the Foundations and Applications of Unbiased Learning to Rank4 May 2023
- 2023Safe Deployment for Counterfactual Learning to Rank with Exposure-Based Risk Minimization26 Apr 2023
- 2023SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Bandits29 Jan 2023
- 2022Safe Exploration for Efficient Policy Evaluation and Comparison26 Feb 2022
- 2021Robust On-Policy Sampling for Data-Efficient Policy Evaluation in Reinforcement Learning29 Nov 2021