Efficient Policy Evaluation with Offline Data Informed Behavior Policy Design
Shuze Daniel Liu, Shangtong Zhang
Abstract
Most reinforcement learning practitioners evaluate their policies with online Monte Carlo estimators for either hyperparameter tuning or testing different algorithmic design choices, where the policy is repeatedly executed in the environment to get the average outcome. Such massive interactions with the environment are prohibitive in many scenarios. In this paper, we propose novel methods that improve the data efficiency of online Monte Carlo estimators while maintaining their unbiasedness. We first propose a tailored closed-form behavior policy that provably reduces the variance of an online Monte Carlo estimator. We then design efficient algorithms to learn this closed-form behavior policy from previously collected offline data. Theoretical analysis is provided to characterize how the behavior policy learning error affects the amount of reduced variance. Compared with previous works, our method achieves better empirical performance in a broader set of environments, with fewer requirements for offline data.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers9
- Offline Two-Player Zero-Sum Markov Games with KL RegularizationClaire Chen, Yuheng Zhang, Xinyu Liu, Zixuan Xie et al.ICML 2026 · 2 citations
- Pessimistic Data Integration for Policy EvaluationXiangkun Wu, Ting Li, Gholamali Aminian, Armin Behnamnia et al.NeurIPS 2025 · 2 citations
- Designing Time Series Experiments in A/B Testing with Transformer Reinforcement LearningXiangkun Wu, Qianglin Wen, Yingying Zhang, Hongtu Zhu et al.ICLR 2026 · 1 citation
- Behaviour Policy Optimization: Provably Lower Variance Return Estimates for Off-Policy Reinforcement LearningAlexander W. Goodall, Edwin Hamel-De le Court, Francesco BelardinelliAAAI 2026 · 1 citation
- Demystifying the Paradox of Importance Sampling with an Estimated History-Dependent Behavior Policy in Off-Policy EvaluationHongyi Zhou, Josiah P. Hanna, Jin Zhu, Ying Yang et al.ICML 2025
Builds on11
- Minimax Weight and Q-Function Learning for Off-Policy EvaluationMasatoshi Uehara, Jiawei Huang, Nan JiangICML 2020 · 199 citations
- Online and Offline Reinforcement Learning by Planning with a Learned ModelJulian Schrittwieser, Thomas Hubert, Amol Mandhane, Mohammadamin Barekatain et al.NeurIPS 2021 · 149 citations
- Batch Value-function Approximation with Only RealizabilityTengyang Xie, Nan JiangICML 2021 · 131 citations
- Off-Policy Evaluation via the Regularized LagrangianMengjiao Yang, Ofir Nachum, Bo Dai, Lihong Li et al.NeurIPS 2020 · 125 citations
- Autoregressive Dynamics Models for Offline Policy Evaluation and OptimizationMichael R. Zhang, Thomas Paine, Ofir Nachum, Cosmin Paduraru et al.ICLR 2021 · 52 citations
Related papers
- Robust On-Policy Sampling for Data-Efficient Policy Evaluation in Reinforcement LearningRujie Zhong, Duohan Zhang, Lukas Schäfer, Stefano V. Albrecht et al.NeurIPS 2022 · 19 citations
- Efficient Multi-Policy Evaluation for Reinforcement LearningShuze Daniel Liu, Claire Chen, Shangtong ZhangAAAI 2025 · 2 citations
- Behavior Estimation from Multi-Source Data for Offline Reinforcement LearningGuoxi Zhang, Hisashi KashimaAAAI 2023 · 2 citations
- Efficient Policy Evaluation with Safety Constraint for Reinforcement LearningClaire Chen, Shuze Daniel Liu, Shangtong ZhangICLR 2025
- Offline Reinforcement Learning with Closed-Form Policy Improvement OperatorsJiachen Li, Edwin Zhang, Ming Yin, Qinxun Bai et al.ICML 2023 · 18 citations
