Model-based Bootstrap of Controlled Markov Chains

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Su, Ziwei, Banerjee, Imon, Klabjan, Diego
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916005521915904
author Su, Ziwei
Banerjee, Imon
Klabjan, Diego
author_facet Su, Ziwei
Banerjee, Imon
Klabjan, Diego
contents We propose and analyze a model-based bootstrap for transition kernels in finite controlled Markov chains (CMCs) with possibly nonstationary or history-dependent control policies, a setting that arises naturally in offline reinforcement learning (RL) when the behavior policy generating the data is unknown. We establish distributional consistency of the bootstrap transition estimator in both a single long-chain regime and the episodic offline RL regime. The key technical tools are a novel bootstrap law of large numbers (LLN) for the visitation counts and a novel use of the martingale central limit theorem (CLT) for the bootstrap transition increments. We extend bootstrap distributional consistency to the downstream targets of offline policy evaluation (OPE) and optimal policy recovery (OPR) via the delta method by verifying Hadamard differentiability of the Bellman operators, yielding asymptotically valid confidence intervals for value and $Q$-functions. Experiments on the RiverSwim problem show that the proposed bootstrap confidence intervals (CIs), especially the percentile CIs, outperform the episodic bootstrap and plug-in CLT CIs, and are often close to nominal ($50\%$, $90\%$, $95\%$) coverage, while the baselines are poorly calibrated at small sample sizes and short episode lengths.
format Preprint
id arxiv_https___arxiv_org_abs_2605_12410
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Model-based Bootstrap of Controlled Markov Chains
Su, Ziwei
Banerjee, Imon
Klabjan, Diego
Machine Learning
Optimization and Control
Statistics Theory
Primary 62F40, Secondary 62M05, 62E20, 60J10, 90C40, 68T05
G.3; I.2.6; I.2.8
We propose and analyze a model-based bootstrap for transition kernels in finite controlled Markov chains (CMCs) with possibly nonstationary or history-dependent control policies, a setting that arises naturally in offline reinforcement learning (RL) when the behavior policy generating the data is unknown. We establish distributional consistency of the bootstrap transition estimator in both a single long-chain regime and the episodic offline RL regime. The key technical tools are a novel bootstrap law of large numbers (LLN) for the visitation counts and a novel use of the martingale central limit theorem (CLT) for the bootstrap transition increments. We extend bootstrap distributional consistency to the downstream targets of offline policy evaluation (OPE) and optimal policy recovery (OPR) via the delta method by verifying Hadamard differentiability of the Bellman operators, yielding asymptotically valid confidence intervals for value and $Q$-functions. Experiments on the RiverSwim problem show that the proposed bootstrap confidence intervals (CIs), especially the percentile CIs, outperform the episodic bootstrap and plug-in CLT CIs, and are often close to nominal ($50\%$, $90\%$, $95\%$) coverage, while the baselines are poorly calibrated at small sample sizes and short episode lengths.
title Model-based Bootstrap of Controlled Markov Chains
topic Machine Learning
Optimization and Control
Statistics Theory
Primary 62F40, Secondary 62M05, 62E20, 60J10, 90C40, 68T05
G.3; I.2.6; I.2.8
url https://arxiv.org/abs/2605.12410