Maximum Entropy Deep Inverse Reinforcement Learning

By Markus Wulfmeier, Peter Ondruska, Ingmar Posner. 2015

458 citations recorded by the source corpus.

This paper presents a general framework for exploiting the representational capacity of neural networks to approximate complex, nonlinear reward functions in the context of solving the inverse reinforcement learning (IRL) problem. We show in this context that the Maximum Entropy paradigm for IRL lends itself naturally to the efficient training of deep architectures. At test time, the approach leads to a computational complexity independent of the number of demonstrations, which makes it especially well-suited for applications in life-long learning scenarios. Our approach achieves performance commensurate to the state-of-the-art on existing benchmarks while exceeding on an alternative benchmark based on highly varying reward structures. Finally, we extend the basic architecture - which is equivalent to a simplified subclass of Fully Convolutional Neural Networks (FCNNs) with width one - to include larger convolutions in order to eliminate dependency on precomputed spatial features and work on raw input representations.

Subfields: Artificial Intelligence, Control and Systems Engineering, Reinforcement Learning

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. Chelsea Finn
  3. Pieter Abbeel
  4. Trevor Darrell
  5. Yoshua Bengio
  6. Ruslan Salakhutdinov
  7. Abhinav Kumar Gupta
  8. Li Fei-Fei

In Control and Systems Engineering

  1. Sergey Levine
  2. Chelsea Finn
  3. Pieter Abbeel
  4. Peter Stone
  5. Scott Niekum
  6. Oliver Kroemer
  7. Pierre Sermanet
  8. Corey Lynch

In Reinforcement Learning

  1. Sergey Levine
  2. Pieter Abbeel
  3. Chelsea Finn
  4. Scott Niekum
  5. Ofir Nachum
  6. Peter Stone
  7. Justin Fu
  8. Lei Tai

Citations in the corpus