Quantifying Generalization in Reinforcement Learning

By Karl Cobbe, Oleg Klimov, Christopher Hesse, Taehoon Kim, John Schulman. 2018

782 citations recorded by the source corpus.

In this paper, we investigate the problem of overfitting in deep reinforcement learning. Among the most common benchmarks in RL, it is customary to use the same environments for both training and testing. This practice offers relatively little insight into an agent's ability to generalize. We address this issue by using procedurally generated environments to construct distinct training and test sets. Most notably, we introduce a new environment called CoinRun, designed as a benchmark for generalization in RL. Using CoinRun, we find that agents overfit to surprisingly large training sets. We then show that deeper convolutional architectures improve generalization, as do methods traditionally found in supervised learning, including L2 regularization, dropout, data augmentation and batch normalization.

Subfields: Artificial Intelligence, Control and Systems Engineering, Reinforcement Learning, Evaluation & Benchmarks

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. Quoc V. Le
  7. Trevor Darrell
  8. Mohit Bansal

In Control and Systems Engineering

  1. Sergey Levine
  2. Pieter Abbeel
  3. Chelsea Finn
  4. Lerrel Pinto
  5. Trevor Darrell
  6. Karol Hausman
  7. Julian Ibarz
  8. Vikash Kumar

In Reinforcement Learning

  1. Sergey Levine
  2. Pieter Abbeel
  3. Chelsea Finn
  4. Shimon Whiteson
  5. Ofir Nachum
  6. Yuxi Li
  7. Shixiang Shane Gu
  8. Timothy P. Lillicrap

In Evaluation & Benchmarks

  1. Sergey Levine
  2. Pieter Abbeel
  3. Chelsea Finn
  4. Joelle Pineau
  5. Timothy P. Lillicrap
  6. Trevor Darrell
  7. Shimon Whiteson
  8. Pablo Samuel Castro

Citations in the corpus