Episodic Curiosity through Reachability
Nikolay Savinov, Anton Raichuk, Rapha\"el Marinier, Damien Vincent,, Marc Pollefeys, Timothy Lillicrap, Sylvain Gelly

TL;DR
This paper introduces a novel episodic curiosity method using reachability-based memory comparisons to enhance exploration in sparse reward environments, outperforming existing methods in visual 3D navigation and locomotion tasks.
Contribution
The paper presents a new curiosity approach leveraging episodic memory and reachability to better measure novelty, overcoming prior issues like the 'couch-potato' problem.
Findings
Outperforms ICM in ViZDoom and DMLab navigation tasks.
Enables MuJoCo ant to learn locomotion from first-person curiosity.
Effective in visually rich 3D environments.
Abstract
Rewards are sparse in the real world and most of today's reinforcement learning algorithms struggle with such sparsity. One solution to this problem is to allow the agent to create rewards for itself - thus making rewards dense and more suitable for learning. In particular, inspired by curious behaviour in animals, observing something novel could be rewarded with a bonus. Such bonus is summed up with the real task reward - making it possible for RL algorithms to learn from the combined reward. We propose a new curiosity method which uses episodic memory to form the novelty bonus. To determine the bonus, the current observation is compared with the observations in memory. Crucially, the comparison is done based on how many environment steps it takes to reach the current observation from those in memory - which incorporates rich information about environment dynamics. This allows us to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Multimodal Machine Learning Applications · Domain Adaptation and Few-Shot Learning
