mlsanityData to 7 Oct 2026

Doubly Robust Policy Evaluation and Optimization

arXiv 1503.02834 ↗First posted 10 Mar 2015stat.ME cs.AIcited by 158

Not on the map. Why?

Abstract (arXiv)

We study sequential decision making in environments where rewards are only partially observed, but can be modeled as a function of observed contexts and the chosen action by the decision maker. This setting, known as contextual bandits, encompasses a wide variety of applications such as health care, content recommendation and Internet advertising. A central task is evaluation of a new policy given historic data consisting of contexts, actions and received rewards. The key challenge is that the past data typically does not faithfully represent proportions of actions taken by a new policy. Previous approaches rely either on models of rewards or models of the past policy. The former are plagued by a large bias whereas the latter have a large variance. In this work, we leverage the strengths and overcome the weaknesses of the two approaches by applying the doubly robust estimation technique to the problems of policy evaluation and optimization. We prove that this approach yields accurate value estimates when we have either a good (but not necessarily consistent) model of rewards or a good (but not necessarily consistent) model of past policy. Extensive empirical comparison demonstrates that the doubly robust estimation uniformly improves over existing techniques, achieving both lower variance in value estimation and better policies. As such, we expect the doubly robust approach to become common practice in policy evaluation and optimization.

Key facts. Cited by 158 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Mar 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2020: 2; 2021: 25; 2022: 33; 2023: 28; 2024: 26; 2025: 23; 2026: 21.

158 papers.

Sort:

By area:

  1. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
  2. 2022A Review of Off-Policy Evaluation in Reinforcement Learningcited by 92
  3. 2021Benchmarks for Deep Off-Policy Evaluationcited by 89
  4. 2022Off-Policy Evaluation for Large Action Spaces via Embeddingscited by 53
  5. 2021Causal Inference Under Unmeasured Confounding With Negative Controls: A Minimax Learning Approachcited by 43
  6. 2022Anytime-valid off-policy inference for contextual banditscited by 37
  7. 2023Off-Policy Evaluation for Large Action Spaces via Conjunct Effect Modelingcited by 34
  8. 2021Post-Contextual-Bandit Inferencecited by 32
  9. 2021Evaluating the Robustness of Off-Policy Evaluationcited by 32
  10. 2022Minimax Regret Optimization for Robust Machine Learning under Distribution Shiftcited by 31
  11. 2022Doubly Robust Off-Policy Evaluation for Ranking Policies under the Cascade Behavior Modelcited by 30
  12. 2021Off-Policy Risk Assessment in Contextual Banditscited by 29
38 more
  1. 2021Towards Theoretical Understandings of Robust Markov Decision Processes: Sample Complexity and Asymptoticscited by 27
  2. 2022Conformal Off-Policy Prediction in Contextual Banditscited by 25
  3. 2022Policy-Adaptive Estimator Selection for Off-Policy Evaluationcited by 24
  4. 2021Doubly Robust Off-Policy Actor-Critic: Convergence and Optimalitycited by 20
  5. 2022An Instrumental Variable Approach to Confounded Off-Policy Evaluationcited by 20
  6. 2022Doubly-Robust Estimation for Correcting Position-Bias in Click Feedback for Unbiased Learning to Rankcited by 17
  7. 2024Off-Policy Evaluation of Slate Bandit Policies via Optimizing Abstractioncited by 17
  8. 2024Optimal Design for Human Preference Elicitationcited by 17
  9. 2021Accelerating Offline Reinforcement Learning Application in Real-Time Bidding and Recommendation: Potential Use of Simulationcited by 16
  10. 2021Generalizing Off-Policy Learning under Sample Selection Biascited by 16
  11. 2024Logarithmic Smoothing for Pessimistic Off-Policy Evaluation, Selection and Learningcited by 16
  12. 2022Safe Exploration for Efficient Policy Evaluation and Comparisoncited by 15
  13. 2023Model-based Constrained MDP for Budget Allocation in Sequential Incentive Marketingcited by 15
  14. 2023Exponential Smoothing for Off-Policy Learningcited by 15
  15. 2023Reliable Off-Policy Learning for Dosage Combinationscited by 15
  16. 2023Oracle-Efficient Pessimism: Offline Policy Optimization in Contextual Banditscited by 14
  17. 2023Off-Policy Evaluation for Large Action Spaces via Policy Convolutioncited by 14
  18. 2026A Survey on LLM-based Conversational User Simulationcited by 14
  19. 2020Self-Imitation Learning via Generalized Lower Bound Q-learningcited by 13
  20. 2024POTEC: Off-Policy Learning for Large Action Spaces via Two-Stage Policy Decompositioncited by 13
  21. 2024Optimal Baseline Corrections for Off-Policy Contextual Banditscited by 13
  22. 2021Bandit Algorithms for Precision Medicinecited by 12
  23. 2022Towards assessing agricultural land suitability with causal machine learningcited by 11
  24. 2025Doubly Robust Alignment for Large Language Modelscited by 11
  25. 2021Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy Learningcited by 10
  26. 2024Multi-Objective Recommendation via Multivariate Policy Learningcited by 10
  27. 2025Offline RL by Reward-Weighted Fine-Tuning for Conversation Optimizationcited by 10
  28. 2022Multi-Task Off-Policy Learning from Bandit Feedbackcited by 9
  29. 2023On the Actionability of Outcome Predictioncited by 9
  30. 2023Wasserstein Distributionally Robust Policy Evaluation and Learning for Contextual Banditscited by 9
  31. 2023Marginal Density Ratio for Off-Policy Evaluation in Contextual Banditscited by 9
  32. 2024Long-term Off-Policy Evaluation and Learningcited by 9
  33. 2024Delta-rm OPE: Off-Policy Estimation with Pairs of Policiescited by 9
  34. 2024Effective Off-Policy Evaluation and Learning in Contextual Combinatorial Banditscited by 8
  35. 2025Should You Use Your Large Language Model to Explore or Exploit?cited by 8
  36. 2022Off-Policy Evaluation with Online Adaptation for Robot Exploration in Challenging Environmentscited by 7
  37. 2022Probabilistic Rank and Reward: A Scalable Model for Slate Recommendationcited by 7
  38. 2022Off-Policy Risk Assessment in Markov Decision Processescited by 7

50 most cited of 158 All 158 (JSON)