Poster

On-Policy Model Errors in Reinforcement Learning

Lukas Fröhlich · Maksym Lefarov · Melanie Zeilinger · Felix Berkenkamp

Keywords: [ reinforcement learning ] [ model learning ] [ model-based reinforcement learning ]

[ Abstract ]
[ Visit Poster at Spot A0 in Virtual World ] [ OpenReview
Wed 27 Apr 2:30 a.m. PDT — 4:30 a.m. PDT

Abstract:

Model-free reinforcement learning algorithms can compute policy gradients given sampled environment transitions, but require large amounts of data. In contrast, model-based methods can use the learned model to generate new data, but model errors and bias can render learning unstable or suboptimal. In this paper, we present a novel method that combines real-world data and a learned model in order to get the best of both worlds. The core idea is to exploit the real-world data for on-policy predictions and use the learned model only to generalize to different actions. Specifically, we use the data as time-dependent on-policy correction terms on top of a learned model, to retain the ability to generate data without accumulating errors over long prediction horizons. We motivate this method theoretically and show that it counteracts an error term for model-based policy improvement. Experiments on MuJoCo- and PyBullet-benchmarks show that our method can drastically improve existing model-based approaches without introducing additional tuning parameters.

Chat is not available.