Combating the Compounding-Error Problem with a Multi-step Model

By Kavosh Asadi, Dipendra Kumar Misra, Seungchan Kim, Michael L. Littman. 2019

71 citations recorded by the source corpus.

Model-based reinforcement learning is an appealing framework for creating agents that learn, plan, and act in sequential environments. Model-based algorithms typically involve learning a transition model that takes a state and an action and outputs the next state---a one-step model. This model can be composed with itself to enable predicting multiple steps into the future, but one-step prediction errors can get magnified, leading to unacceptable inaccuracy. This compounding-error problem plagues planning and undermines model-based reinforcement learning. In this paper, we address the compounding-error problem by introducing a multi-step model that directly outputs the outcome of executing a sequence of actions. Novel theoretical and empirical results indicate that the multi-step model is more conducive to efficient value-function estimation, and it yields better action selection compared to the one-step model. These results make a strong case for using multi-step models in the context of model-based reinforcement learning.

Subfields: Artificial Intelligence, Software, Statistics and Probability

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

  1. Sergey Levine
  2. Pieter Abbeel
  3. Yoshua Bengio
  4. Chelsea Finn
  5. Ruslan Salakhutdinov
  6. Igor Mordatch
  7. Quoc V. Le
  8. Josh Tenenbaum

In Software

  1. Sergey Levine
  2. Igor Mordatch
  3. Pieter Abbeel
  4. Michael Janner
  5. Aravind Rajeswaran

In Statistics and Probability

  1. Theophane Weber
  2. Karol Gregor
  3. Nan Rosemary Ke
  4. Pieter Abbeel
  5. Sergey Levine
  6. Danilo Jimenez Rezende
  7. Lars Buesing
  8. Igor Mordatch

Citations in the corpus