mlsanityData to 14 Oct 2026

Automated Off-Policy Estimator Selection via Supervised Learning

arXiv 2406.18022 ↗First posted 26 Jun 2024cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

The Off-Policy Evaluation (OPE) problem consists of evaluating the performance of counterfactual policies with data collected by another one. To solve the OPE problem, we resort to estimators, which aim to estimate in the most accurate way possible the performance that the counterfactual policies would have had if they were deployed in place of the logging policy. In the literature, several estimators have been developed, all with different characteristics and theoretical guarantees. Therefore, there is no dominant estimator and each estimator may be the best for different OPE problems, depending on the characteristics of the dataset at hand. Although the selection of the estimator is a crucial choice for an accurate OPE, this problem has been widely overlooked in the literature. We propose an automated data-driven OPE estimator selection method based on supervised learning. In particular, the core idea we propose in this paper is to create several synthetic OPE tasks and use a machine learning model trained to predict the best estimator for those synthetic tasks. We empirically show how our method is able to perform a better estimator selection compared to a baseline method on several real-world datasets, with a computational cost significantly lower than the one of the baseline.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 21 of its 51 references that are in the map. First posted on arXiv 26 Jun 2024.

Builds on

21 of 51 references.

References · 21

  1. 2020Scaling Laws for Neural Language Modelscited by 6,586
  2. 2022Training Compute-Optimal Large Language Modelscited by 3,019
  3. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,920
  4. 2015Doubly Robust Off-policy Value Evaluation for Reinforcement Learningcited by 339
  5. 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 286
  6. 2015Doubly Robust Policy Evaluation and Optimizationcited by 158
  7. 2019Empirical Study of Off-Policy Policy Evaluation for Reinforcement Learningcited by 121
  8. 2016Optimal and Adaptive Off-policy Evaluation in Contextual Banditscited by 111
  9. 2018Offline A/B testing for Recommender Systemscited by 96
  10. 2016PAC-Bayesian Theory Meets Bayesian Inferencecited by 88
  11. 2019Doubly robust off-policy evaluation with shrinkagecited by 87
  12. 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
9 more
  1. 2018Policy Optimization via Importance Samplingcited by 47
  2. 2020Adaptive Estimator Selection for Off-Policy Evaluationcited by 38
  3. 2021Evaluating the Robustness of Off-Policy Evaluationcited by 32
  4. 2019Intrinsically Efficient, Stable, and Bounded Off-Policy Evaluation for Reinforcement Learningcited by 28
  5. 2022Policy-Adaptive Estimator Selection for Off-Policy Evaluationcited by 24
  6. 2021Accelerating Offline Reinforcement Learning Application in Real-Time Bidding and Recommendation: Potential Use of Simulationcited by 16
  7. 2021Bandit Algorithms for Precision Medicinecited by 12
  8. 2020Debiased Off-Policy Evaluation for Recommendation Systemscited by 9
  9. 2023Contextual Bandits with Budgeted Information Revealcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.