Diversity-Driven Exploration Strategy for Deep Reinforcement Learning

By Zhang-Wei Hong, Tzu-Yun Shann, Shih-Yang Su, Yi-Hsiang Chang, Chun-Yi Lee. 2018

147 citations recorded by the source corpus.

Efficient exploration remains a challenging research problem in reinforcement learning, especially when an environment contains large state spaces, deceptive local optima, or sparse rewards. To tackle this problem, we present a diversity-driven approach for exploration, which can be easily combined with both off- and on-policy reinforcement learning algorithms. We show that by simply adding a distance measure to the loss function, the proposed methodology significantly enhances an agent's exploratory behaviors, and thus preventing the policy from being trapped in local optima. We further propose an adaptive scaling method for stabilizing the learning process. Our experimental results in Atari 2600 show that our method outperforms baseline approaches in several tasks in terms of mean scores and exploration efficiency.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

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. Aldo Pacchiano
  2. Jack Parker-Holder
  3. Ibrahim Sobh
  4. B. R. Kiran
  5. Patrick Pérez
  6. Stephen J. Roberts
  7. Krzysztof Marcin Choromanski
  8. Lilian Weng

In Computational Theory and Mathematics

  1. Jack Parker-Holder
  2. Patrick Pérez
  3. Stephen J. Roberts
  4. Krzysztof Marcin Choromanski
  5. Lilian Weng
  6. Senthil Kumar Yogamani
  7. Aldo Pacchiano
  8. Patrick Mannion

Citations in the corpus