Abstract

Offline reinforcement learning (RL) leverages previously collected data for policy optimization without any further active exploration. Despite the recent interest in this problem, its theoretical results in neural network function approximation settings remain elusive. In this paper, we study the statistical theory of offline RL with deep ReLU network function approximation. In particular, we establish the sample complexity of \(n = \tilde\{\mathcal\{O\}\}( H^\{4 + 4 \frac\{d\}\{\alpha\}\} \kappa_\{\mu\}^\{1 + \frac\{d\}\{\alpha\}\} \epsilon^\{-2 - 2\frac\{d\}\{\alpha\}\} )\) for offline RL with deep ReLU networks, where \(\kappa_\{\mu\}\) is a measure of distributional shift, \{\(H = (1-\gamma)^\{-1\}\) is the effective horizon length\}, \(d\) is the dimension of the state-action space, \(\alpha\) is a (possibly fractional) smoothness parameter of the underlying Markov decision process (MDP), and \(\epsilon\) is a user-specified error. Notably, our sample complexity holds under two n

Authors

(none)

Tags

  • Offline RL
  • Exploration

Stats

Related papers