mlsanityData to 14 Oct 2026

An Evaluation Study of Intrinsic Motivation Techniques applied to Reinforcement Learning over Hard Exploration Environments

arXiv 2205.11184 ↗First posted 23 May 2022cs.LG cs.AIcited by 8

Not on the map. Why?

Abstract (arXiv)

In the last few years, the research activity around reinforcement learning tasks formulated over environments with sparse rewards has been especially notable. Among the numerous approaches proposed to deal with these hard exploration problems, intrinsic motivation mechanisms are arguably among the most studied alternatives to date. Advances reported in this area over time have tackled the exploration issue by proposing new algorithmic ideas to generate alternative mechanisms to measure the novelty. However, most efforts in this direction have overlooked the influence of different design choices and parameter settings that have also been introduced to improve the effect of the generated intrinsic bonus, forgetting the application of those choices to other intrinsic motivation techniques that may also benefit of them. Furthermore, some of those intrinsic methods are applied with different base reinforcement algorithms (e.g. PPO, IMPALA) and neural network architectures, being hard to fairly compare the provided results and the actual progress provided by each solution. The goal of this work is to stress on this crucial matter in reinforcement learning over hard exploration environments, exposing the variability and susceptibility of avant-garde intrinsic motivation techniques to diverse design factors. Ultimately, our experiments herein reported underscore the importance of a careful selection of these design aspects coupled with the exploration requirements of the environment and the task in question under the same setup, so that fair comparisons can be guaranteed.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 24 of its 31 references that are in the map. First posted on arXiv 23 May 2022.

Builds on

24 of 31 references.

References · 24

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
  3. 2016Generative Adversarial Imitation Learningcited by 1,597
  4. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
  5. 2018Exploration by Random Network Distillationcited by 993
  6. 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 883
  7. 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 786
  8. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
  9. 2016Guided Cost Learning: Deep Inverse Optimal Control via Policy Optimizationcited by 406
  10. 2019Emergent Tool Use From Multi-Agent Autocurriculacited by 313
  11. 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 309
  12. 2018Large-Scale Study of Curiosity-Driven Learningcited by 280
12 more
  1. 2020Never Give Up: Learning Directed Exploration Strategiescited by 212
  2. 2020What Matters In On-Policy Reinforcement Learning? A Large-Scale Empirical Studycited by 162
  3. 2020RIDE: Rewarding Impact-Driven Exploration for Procedurally-Generated Environmentscited by 135
  4. 2018Count-Based Exploration with the Successor Representationcited by 112
  5. 2020Learning with AMIGo: Adversarially Motivated Intrinsic Goalscited by 88
  6. 2019A survey on intrinsic motivation in reinforcement learningcited by 81
  7. 2021What Matters for Adversarial Imitation Learning?cited by 70
  8. 2021Adversarially Guided Actor-Criticcited by 47
  9. 2021On Bonus-Based Exploration Methods in the Arcade Learning Environmentcited by 37
  10. 2021Rank the Episodes: A Simple Approach for Exploration in Procedurally-Generated Environmentscited by 28
  11. 2021When should agents explore?cited by 20
  12. 2021Don't Do What Doesn't Matter: Intrinsic Motivation with Action Usefulnesscited by 7

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 2; 2024: 3; 2025: 2.

8 papers.