mlsanityData to 14 Oct 2026

Hyperparameter Optimization Can Even be Harmful in Off-Policy Learning and How to Deal with It

arXiv 2404.15084 ↗First posted 23 Apr 2024cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

There has been a growing interest in off-policy evaluation in the literature such as recommender systems and personalized medicine. We have so far seen significant progress in developing estimators aimed at accurately estimating the effectiveness of counterfactual policies based on biased logged data. However, there are many cases where those estimators are used not only to evaluate the value of decision making policies but also to search for the best hyperparameters from a large candidate space. This work explores the latter hyperparameter optimization (HPO) task for off-policy learning. We empirically show that naively applying an unbiased estimator of the generalization performance as a surrogate objective in HPO can cause an unexpected failure, merely pursuing hyperparameters whose generalization performance is greatly overestimated. We then propose simple and computationally efficient corrections to the typical HPO procedure to deal with the aforementioned issues simultaneously. Empirical investigations demonstrate the effectiveness of our proposed HPO algorithm in situations where the typical procedure fails severely.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 36 of its 54 references that are in the map. First posted on arXiv 23 Apr 2024.

Builds on

36 of 54 references.

References · 36

  1. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
  2. 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 840
  3. 2017Deep Reinforcement Learning that Matterscited by 754
  4. 2018A Tutorial on Bayesian Optimizationcited by 744
  5. 2019Behavior Regularized Offline Reinforcement Learningcited by 662
  6. 2016The CMA Evolution Strategy: A Tutorialcited by 377
  7. 2017Are GANs Created Equal? A Large-Scale Studycited by 267
  8. 2019Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approachescited by 185
  9. 2015Doubly Robust Policy Evaluation and Optimizationcited by 158
  10. 2021Bayesian Optimization is Superior to Random Search for Machine Learning Hyperparameter Tuning: Analysis of the Black-Box Optimization Challenge 2020cited by 148
  11. 2018More Robust Doubly Robust Off-policy Evaluationcited by 141
  12. 2020Hyperparameter Selection for Offline Reinforcement Learningcited by 114
24 more
  1. 2016Optimal and Adaptive Off-policy Evaluation in Contextual Banditscited by 111
  2. 2021Benchmarks for Deep Off-Policy Evaluationcited by 89
  3. 2019Doubly robust off-policy evaluation with shrinkagecited by 87
  4. 2019Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedbackcited by 79
  5. 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
  6. 2021Model Selection for Offline Reinforcement Learning: Practical Considerations for Healthcare Settingscited by 68
  7. 2022Off-Policy Evaluation for Large Action Spaces via Embeddingscited by 54
  8. 2016CMA-ES for Hyperparameter Optimization of Deep Neural Networkscited by 48
  9. 2020Confident Off-Policy Evaluation and Selection through Self-Normalized Importance Weightingcited by 38
  10. 2020Counterfactual Evaluation of Slate Recommendations with Sequential Reward Interactionscited by 35
  11. 2023Off-Policy Evaluation for Large Action Spaces via Conjunct Effect Modelingcited by 34
  12. 2021Evaluating the Robustness of Off-Policy Evaluationcited by 32
  13. 2020Offline Policy Selection under Uncertaintycited by 31
  14. 2020Optimal Off-Policy Evaluation from Multiple Logging Policiescited by 30
  15. 2022Doubly Robust Off-Policy Evaluation for Ranking Policies under the Cascade Behavior Modelcited by 30
  16. 2020Warm Starting CMA-ES for Hyperparameter Optimizationcited by 19
  17. 2019Imitation-Regularized Offline Learningcited by 17
  18. 2024Off-Policy Evaluation of Slate Bandit Policies via Optimizing Abstractioncited by 17
  19. 2021Accelerating Offline Reinforcement Learning Application in Real-Time Bidding and Recommendation: Potential Use of Simulationcited by 16
  20. 2023Towards Assessing and Benchmarking Risk-Return Tradeoff of Off-Policy Evaluationcited by 13
  21. 2024POTEC: Off-Policy Learning for Large Action Spaces via Two-Stage Policy Decompositioncited by 13
  22. 2024cmaes: A Simple yet Practical Python Library for CMA-EScited by 12
  23. 2019Towards Resolving Propensity Contradiction in Offline Recommender Learningcited by 6
  24. 2020Efficient Hyperparameter Optimization under Multi-Source Covariate Shiftcited by 2

Built on by

Cited by year (2026 to 14 Oct)

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

5 papers.