Learning Robust Options

By Daniel Jaymin Mankowitz, Timothy A. Mann, Pierre-Luc Bacon, Doina Precup, Shie Mannor. 2018

51 citations recorded by the source corpus.

Robust reinforcement learning aims to produce policies that have strong guarantees even in the face of environments/transition models whose parameters have strong uncertainty. Existing work uses value-based methods and the usual primitive action setting. In this paper, we propose robust methods for learning temporally abstract actions, in the framework of options. We present a Robust Options Policy Iteration (ROPI) algorithm with convergence guarantees, which learns options that are robust to model uncertainty. We utilize ROPI to learn robust options with the Robust Options Deep Q Network (RO-DQN) that solves multiple tasks and mitigates model misspecification due to model uncertainty. We present experimental results which suggest that policy iteration with linear features may have an inherent form of robustness when using coarse feature representations. In addition, we present experimental results which demonstrate that robustness helps policy iteration implemented on top of deep neural networks to generalize over a much broader range of dynamics than non-robust policy iteration.

Subfields: Artificial Intelligence, Management Science and Operations Research

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. Hado van Hasselt
  4. Chelsea Finn
  5. Matteo Hessel
  6. Yoshua Bengio
  7. David Silver
  8. Joelle Pineau

In Management Science and Operations Research

  1. Hado van Hasselt
  2. Matteo Hessel
  3. David Silver
  4. Junhyuk Oh
  5. Gabriel Dulac-Arnold
  6. Todd Hester
  7. Cosmin Paduraru
  8. Jerry Zheng Li

Citations in the corpus