Overcoming Model Bias for Robust Offline Deep Reinforcement Learning
By Phillip Swazinna, Steffen Udluft, Thomas A. Runkler. 2020
95 citations recorded by the source corpus.
State-of-the-art reinforcement learning algorithms mostly rely on being allowed to directly interact with their environment to collect millions of observations. This makes it hard to transfer their success to industrial control problems, where simulations are often very costly or do not exist, and exploring in the real environment can potentially lead to catastrophic events. Recently developed, model-free, offline algorithms, can learn from a single dataset by mitigating extrapolation error in value functions. However, the robustness of the training process is still comparatively low, a problem known from methods using value functions. To improve robustness and stability of the learning process, we use dynamics models to assess policy performance instead of value functions, resulting in MOOSE (MOdel-based Offline policy Search with Ensembles), an algorithm which ensures low model bias by keeping the policy within the support of the data. We compare MOOSE with state-of-the-art model-free, offline RL algorithms BEAR and BCQ on the Industrial Benchmark and Mujoco continuous control tasks in terms of robust performance, and find that MOOSE outperforms its model-free counterparts in almost all considered cases, often even by far.
Subfields: Artificial Intelligence, Control and Systems Engineering
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Sergey Levine
- Chelsea Finn
- Pieter Abbeel
- Tianhe Yu
- Aravind Rajeswaran
- Aviral Kumar
- Benjamin Eysenbach
- Ilya Kostrikov
In Control and Systems Engineering
- Sergey Levine
- Chelsea Finn
- Aravind Rajeswaran
- Tianhe Yu
- Aviral Kumar
- Benjamin Eysenbach
- Pieter Abbeel
- Rafael Rafailov
Citations in the corpus
- COMBO: Conservative Offline Model-Based Policy Optimization (2021, methodology): “Model-based offline RL. Model-based offline RL methods [11, 9, 24, 26, 67, 39, 3, 60, 48, 33, 68] provide an alternative approach to policy learning that involves the learning of a dynamics model using techniques from supervised learning and generative modeling.”
- RvS: What is Essential for Offline RL via Supervised Learning? (2021, methodology): “Recent offline RL methods use many algorithmic techniques, including value functions [15, 27], dynamics estimation alongisde value functions [24, 37, 42], dynamics estimation alone [3, 7, 39], and uncertainty quantification [1, 41, 42].”
- Offline Reinforcement Learning from Images with Latent Space Models (2020, background): “…al., 2019), approximate dynamic programming algorithms (Fujimoto et al., 2018; Kumar et al., 2019, 2020; Liu et al., 2020; Agarwal et al., 2019), and model-based RL algorithms (Kidambi et al., 2020; Yu et al., 2020b; Argenson and Dulac-Arnold, 2020; Matsushima et al., 2020; Swazinna et al., 2020).”
- Representation Balancing Offline Model-based Reinforcement Learning (2021, methodology): “Matsushima et al. (2020), MOOSE (Swazinna et al., 2020) and MBOP (Argenson & Dulac-Arnold, 2020) guide their policy optimization using the behavior policy, similar to the behavior regularization approaches.”