Skip to content
DraconiticResearch
Search Sources API
174,684 studies31 sourcesUpdated 1 h ago
PreprintCC BY 4.0arXiv

Model-based Bootstrap for Offline Policy Evaluation in Tabular Reinforcement Learning

Abstract

Offline policy evaluation (OPE) is crucial in high-stakes reinforcement learning applications, where new policies must be assessed reliably before deployment. In such settings, point estimates alone are insufficient; principled uncertainty quantification, such as confidence intervals and variance estimates, is essential for safe and risk-aware decision-making. A comprehensive way to unify these tasks is to estimate the sampling distribution of the evaluation error. Existing approaches, however, often suffer from limited robustness, scalability, or finite-sample validity. In this paper, we propose a model-based bootstrap framework for uncertainty quantification of OPE in finite-horizon, time-inhomogeneous Markov decision processes (MDPs). Unlike classical bootstrap methods that rely on resampling complete episodes, the proposed method regenerates trajectories from an estimated MDP and can therefore accommodate a much broader range of offline data formats, including complete trajectories, transition-level observations, and trajectory fragments. This flexibility further improves finite-sample statistical efficiency. We establish bootstrap distributional consistency, asymptotically valid confidence intervals, and consistent variance estimation for the target policy value. Extensive simulations show that the proposed method accurately captures the sampling distribution of the OPE estimator, yielding tighter confidence intervals and more accurate variance estimates in most settings.

Related

  1. Confounding Masquerading as Improvement: A Systematic Evaluation of Offline Reinforcement Learning for Stroke Antithrombotic Treatment in a 129,000-Patient Registry
    Kihun Rhee
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Offline Approximate Value Iteration: A Reinforcement Learning Approach for Satellite Constellation Deployment
    Tristan Leuridan, Yiping Fang, Adam Abdin
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Exact Fast Batch Simulation for Tabular Reinforcement Learning
    Haochen Zhang, Lingzhou Xue, Zhong Zheng
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. Provably Efficient Risk-Sensitive Offline Reinforcement Learning via Optimized Certainty Equivalents
    Hanzhen Wang, Boxiang Lyu, Zhongxiang Dai +3
    arXivPreprintarXiv licenceFull textOptimisation & controlStatisticsarXiv
  5. Density-Guided Bootstrap Boundaries for Latent World-Model Reinforcement Learning
    Shashank Gupta, Pilhwa Lee
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{wang2026modelbased,
  title = {{Model-based Bootstrap for Offline Policy Evaluation in Tabular Reinforcement Learning}},
  author = {Weiwei Wang and Yuqiang Li and Xianyi Wu and Bingyi Jing},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.20389},
  eprint = {2609.20389},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.20389},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Model-based Bootstrap for Offline Policy Evaluation in Tabular Reinforcement Learning
AU  - Weiwei Wang
AU  - Yuqiang Li
AU  - Xianyi Wu
AU  - Bingyi Jing
PY  - 2026
DA  - 2026/09/17
PB  - arXiv
DO  - 10.48550/arxiv.2609.20389
UR  - https://arxiv.org/abs/2609.20389
AB  - Offline policy evaluation (OPE) is crucial in high-stakes reinforcement learning applications, where new policies must be assessed reliably before deployment. In such settings, point estimates alone are insufficient; principled uncertainty quantification, such as confidence intervals and variance estimates, is essential for safe and risk-aware decision-making. A comprehensive way to unify these tasks is to estimate the sampling distribution of the evaluation error. Existing approaches, however, often suffer from limited robustness, scalability, or finite-sample validity. In this paper, we propose a model-based bootstrap framework for uncertainty quantification of OPE in finite-horizon, time-inhomogeneous Markov decision processes (MDPs). Unlike classical bootstrap methods that rely on resampling complete episodes, the proposed method regenerates trajectories from an estimated MDP and can therefore accommodate a much broader range of offline data formats, including complete trajectories, transition-level observations, and trajectory fragments. This flexibility further improves finite-sample statistical efficiency. We establish bootstrap distributional consistency, asymptotically valid confidence intervals, and consistent variance estimation for the target policy value. Extensive simulations show that the proposed method accurately captures the sampling distribution of the OPE estimator, yielding tighter confidence intervals and more accurate variance estimates in most settings.
ER  -