Settling the sample complexity of model-based offline reinforcement learning

Abstract

This paper is concerned with offline reinforcement learning (RL), which learns using precollected data without further exploration. Effective offline RL would be able to accommodate distribution shift and limited data coverage. However, prior results either suffer from suboptimal sample complexities or incur high burn-in cost to reach sample optimality, thus posing an impediment to efficient offline RL in sample-starved applications.

We demonstrate that the model-based (or “plug-in”) approach achieves minimax-optimal sample complexity without any burn-in cost for tabular Markov decision processes (MDPs). Concretely, consider a γ-discounted infinite-horizon (resp., finite-horizon) MDP with S states and effective horizon $\frac{1}{1-\mathit{\gamma }}$ (resp., horizon H), and suppose the distribution shift of data is reflected by some single-policy clipped concentrability coefficient ${\mathit{C}}_{\mathsf{clipped}}^{\star }$. We prove that model-based offline RL yields ε-accuracy with a sample complexity of

$$\left\{\begin{array}{ll}\frac{\mathit{S}{\mathit{C}}_{\mathsf{clipped}}^{\star }}{{(1-\mathit{\gamma })}^3{\mathit{\epsilon }}^2}& (\text{infinite-horizon MDPs}),\\ \frac{{\mathit{H}}^4\mathit{S}{\mathit{C}}_{\mathsf{clipped}}^{\star }}{{\mathit{\epsilon }}^2}& (\text{finite-horizon MDPs}),\end{array}\right.$$

up to log factor, which is minimax optimal for the entire ε-range. The proposed algorithms are “pessimistic” variants of value iteration with Bernstein-style penalties, and do not require sophisticated variance reduction. Our analysis framework is established upon delicate leave-one-out decoupling arguments in conjunction with careful self-bounding techniques tailored to MDPs.