Don't Do What Doesn't Matter: Intrinsic Motivation with Action Usefulness
Mathieu Seurin, Florian Strub, Philippe Preux, Olivier Pietquin

TL;DR
This paper introduces DoWhaM, an intrinsic motivation method for reinforcement learning that emphasizes relevant actions over state novelty, leading to more efficient exploration and reduced sample complexity.
Contribution
It proposes a novel exploration approach that rewards environment-effective actions, shifting focus from state novelty to action relevance, improving learning efficiency.
Findings
DoWhaM outperforms state-of-the-art methods on MiniGrid.
It significantly reduces sample complexity in exploration tasks.
The method effectively identifies environment-relevant actions.
Abstract
Sparse rewards are double-edged training signals in reinforcement learning: easy to design but hard to optimize. Intrinsic motivation guidances have thus been developed toward alleviating the resulting exploration problem. They usually incentivize agents to look for new states through novelty signals. Yet, such methods encourage exhaustive exploration of the state space rather than focusing on the environment's salient interaction opportunities. We propose a new exploration method, called Don't Do What Doesn't Matter (DoWhaM), shifting the emphasis from state novelty to state with relevant actions. While most actions consistently change the state when used, \textit{e.g.} moving the agent, some actions are only effective in specific states, \textit{e.g.}, \emph{opening} a door, \emph{grabbing} an object. DoWhaM detects and rewards actions that seldom affect the environment. We evaluate…
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 · Adversarial Robustness in Machine Learning · Advanced Bandit Algorithms Research
