GEP-PG: Decoupling Exploration and Exploitation in Deep Reinforcement Learning Algorithms

By Cédric Colas, Olivier Sigaud, Pierre-Yves Oudeyer. 2017

169 citations recorded by the source corpus.

In continuous action domains, standard deep reinforcement learning algorithms like DDPG suffer from inefficient exploration when facing sparse or deceptive reward problems. Conversely, evolutionary and developmental methods focusing on exploration like Novelty Search, Quality-Diversity or Goal Exploration Processes explore more robustly but are less efficient at fine-tuning policies using gradient descent. In this paper, we present the GEP-PG approach, taking the best of both worlds by sequentially combining a Goal Exploration Process and two variants of DDPG. We study the learning performance of these components and their combination on a low dimensional deceptive reward problem and on the larger Half-Cheetah benchmark. We show that DDPG fails on the former and that GEP-PG improves over the best DDPG variant in both environments. Supplementary videos and discussion can be found at http://frama.link/gep_pg, the code at this http URL.

Subfields: Artificial Intelligence, Computer Networks and Communications, Computer Vision and Pattern Recognition

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. Chelsea Finn
  4. Jeff Clune
  5. Ruslan Salakhutdinov
  6. Timothée Lesort
  7. Yoshua Bengio
  8. Trevor Darrell

In Computer Networks and Communications

  1. Kagan Tumer
  2. Shauharda Khadka
  3. Sébastien Forestier
  4. Yoan Mollard
  5. Pierre-Yves Oudeyer
  6. Scott Fujimoto
  7. Doina Precup
  8. David Meger

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Trevor Darrell
  3. Jitendra Malik
  4. Dacheng Tao
  5. Xiaogang Wang
  6. Cordelia Schmid
  7. Ming-Hsuan Yang
  8. Abhinav Kumar Gupta

Citations in the corpus