Off-Policy Deep Reinforcement Learning without Exploration

Scott Fujimoto, David Meger, Doina Precup
12/7/2018
cs.LGcs.AIstat.ML

Official code: sfujim/BCQ (664 stars, MIT, last commit 2021-04-06).

Abstract

Many practical applications of reinforcement learning constrain agents to learn from a fixed batch of data which has already been gathered, without offering further possibility for data collection. In this paper, we demonstrate that due to errors introduced by extrapolation, standard off-policy deep reinforcement learning algorithms, such as DQN and DDPG, are incapable of learning with data uncorrelated to the distribution under the current policy, making them ineffective for this fixed batch setting. We introduce a novel class of off-policy algorithms, batch-constrained reinforcement learning, which restricts the action space in order to force the agent towards behaving close to on-policy with respect to a subset of the given data. We present the first continuous control deep reinforcement learning algorithm which can learn effectively from arbitrary, fixed batch data, and empirically demonstrate the quality of its behavior in several tasks.

View on arXivView PDF

Code Implementations(1)

sfujim/BCQOfficial100%
MIT

Author's PyTorch implementation of BCQ for continuous and discrete actions

664147PythonDec 18, 20185 years agoMIT

Cite this paper

@article{fujimoto2018offpolicy,
  title  = {Off-Policy Deep Reinforcement Learning without Exploration},
  author = {Scott Fujimoto and David Meger and Doina Precup},
  year   = {2018},
  eprint = {1812.02900},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1812.02900}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1812.02900.svg)](https://codeofpaper.com/paper/1812.02900)

Discussion