Reliable Off-policy Evaluation for Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
In a sequential decision-making problem, off-policy evaluation estimates the expected cumulative reward of a target policy using logged trajectory data generated from a different behavior policy, without execution of the target policy. Reinforcement learning in high-stake environments, such as healthcare and education, is often limited to off-policy settings due to safety or ethical concerns, or inability of exploration. Hence it is imperative to quantify the uncertainty of the off-policy estimate before deployment of the target policy. In this paper, we propose a novel framework that provides robust and optimistic cumulative reward estimates using one or multiple logged trajectories data. Leveraging methodologies from distributionally robust optimization, we show that with proper selection of the size of the distributional uncertainty set, these estimates serve as confidence bounds with non-asymptotic and asymptotic guarantees under stochastic or adversarial environments. Our results are also generalized to batch reinforcement learning and are supported by empirical analysis.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Nov 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 2; 2024: 1; 2025: 2; 2026: 1.
9 papers.
- 2021Sinkhorn Distributionally Robust Optimizationcited by 38
- 2023Model Based Reinforcement Learning for Personalized Heparin Dosingcited by 5
- 2021Offline Policy Comparison under Limited Historical Agent-Environment Interactionscited by 3
- 2023Quantile-Based Deep Reinforcement Learning using Two-Timescale Policy Gradient Algorithmscited by 3
- 2024Efficient and Sharp Off-Policy Evaluation in Robust Markov Decision Processescited by 3
- 2025Towards Optimal Offline Reinforcement Learningcited by 2
- 2022Bridging the Gap Between Offline and Online Reinforcement Learning Evaluation Methodologiescited by 1
- 2025Iterative Sampling Methods for Sinkhorn Distributionally Robust Optimizationcited by 1
- 2026Beyond Bellman: High-Order Generator Regression for Continuous-Time Policy Evaluationcited by 0
- 2026Beyond Bellman: High-Order Generator Regression for Continuous-Time Policy Evaluation21 Apr 2026
- 2025Iterative Sampling Methods for Sinkhorn Distributionally Robust Optimization14 Dec 2025
- 2025Towards Optimal Offline Reinforcement Learning15 Mar 2025
- 2024Efficient and Sharp Off-Policy Evaluation in Robust Markov Decision Processes29 Mar 2024
- 2023Quantile-Based Deep Reinforcement Learning using Two-Timescale Policy Gradient Algorithms12 May 2023
- 2023Model Based Reinforcement Learning for Personalized Heparin Dosing19 Apr 2023
- 2022Bridging the Gap Between Offline and Online Reinforcement Learning Evaluation Methodologies15 Dec 2022
- 2021Sinkhorn Distributionally Robust Optimization24 Sep 2021
- 2021Offline Policy Comparison under Limited Historical Agent-Environment Interactions7 Jun 2021
Similar, not cited
Close in wording, no citation either way
- 2024Diffusion Policies for Risk-Averse Behavior Modeling in Offline Reinforcement Learning
- 2020Doubly Robust Off-Policy Value and Gradient Estimation for Deterministic Policies
- 2022Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
- 2020Confounding-Robust Policy Evaluation in Infinite-Horizon Reinforcement Learning
- 2023Robust Offline Reinforcement learning with Heavy-Tailed Rewards
- 2020Expert-Supervised Reinforcement Learning for Offline Policy Learning and Evaluation
- 2023Double Pessimism is Provably Efficient for Distributionally Robust Offline Reinforcement Learning: Generic Algorithm and Robust Partial Coverage
- 2026Bayesian Conservative Policy Optimization (BCPO): A Novel Uncertainty-Calibrated Offline Reinforcement Learning with Credible Lower Bounds