Timezone: »

 
Poster
A Minimalist Approach to Offline Reinforcement Learning
Scott Fujimoto · Shixiang (Shane) Gu

Thu Dec 09 04:30 PM -- 06:00 PM (PST) @
in Poster Session 7 »

Offline reinforcement learning (RL) defines the task of learning from a fixed batch of data. Due to errors in value estimation from out-of-distribution actions, most offline RL algorithms take the approach of constraining or regularizing the policy with the actions contained in the dataset. Built on pre-existing RL algorithms, modifications to make an RL algorithm work offline comes at the cost of additional complexity. Offline RL algorithms introduce new hyperparameters and often leverage secondary components such as generative models, while adjusting the underlying RL algorithm. In this paper we aim to make a deep RL algorithm work while making minimal changes. We find that we can match the performance of state-of-the-art offline RL algorithms by simply adding a behavior cloning term to the policy update of an online RL algorithm and normalizing the data. The resulting algorithm is a simple to implement and tune baseline, while more than halving the overall run time by removing the additional computational overheads of previous methods.

Keywords: Reinforcement Learning and Planning · Generative Model

Author Information

Scott Fujimoto (McGill University)
Shixiang (Shane) Gu (Google Brain, University of Cambridge)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors