Interesting Object, Curious Agent: Learning Task-Agnostic Exploration
Simone Parisi, Victoria Dean, Deepak Pathak, Abhinav Gupta
Abstract
Common approaches for task-agnostic exploration learn tabula-rasa --the agent assumes isolated environments and no prior knowledge or experience. However, in the real world, agents learn in many environments and always come with prior experiences as they explore new ones. Exploration is a lifelong process. In this paper, we propose a paradigm change in the formulation and evaluation of task-agnostic exploration. In this setup, the agent first learns to explore across many environments without any extrinsic goal in a task-agnostic manner. Later on, the agent effectively transfers the learned exploration policy to better explore new environments when solving tasks. In this context, we evaluate several baseline exploration strategies and present a simple yet effective approach to learning task-agnostic exploration policies. Our key idea is that there are two components of exploration: (1) an agent-centric component encouraging exploration of unseen parts of the environment based on an agent's belief; (2) an environment-centric component encouraging exploration of inherently interesting objects. We show that our formulation is effective and provides the most consistent exploration across several training-testing environment pairs. We also introduce benchmarks and metrics for evaluating task-agnostic exploration strategies. The source code is available at https://github.com/sparisi/cbet/.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 9c4126ca-0fa8-49b3-8302-1d953e87f227Cited by top-tier papers15
- The Unsurprising Effectiveness of Pre-Trained Vision Models for ControlSimone Parisi, Aravind Rajeswaran, Senthil Purushwalkam, Abhinav GuptaICML 2022 · 233 citations
- Heterogeneous Skill Learning for Multi-agent TasksYuntao Liu, Yuan Li, Xinhai Xu, Yong Dou et al.NeurIPS 2022 · 33 citations
- Unsupervised Reinforcement Learning in Multiple EnvironmentsMirco Mutti, Mattia Mancassola, Marcello RestelliAAAI 2022 · 30 citations
- A Study of Global and Episodic Bonuses for Exploration in Contextual MDPsMikael Henaff, Minqi Jiang, Roberta RaileanuICML 2023 · 18 citations
- Curious Replay for Model-based AdaptationIsaac Kauvar, Chris Doyle, Linqi Zhou, Nick HaberICML 2023 · 18 citations
Builds on7
- Habitat: A Platform for Embodied AI ResearchManolis Savva, Jitendra Malik, Devi Parikh, Dhruv Batra et al.ICCV 2019 · 1,863 citations
- Reinforcement Learning with Prototypical RepresentationsDenis Yarats, Rob Fergus, Alessandro Lazaric, Lerrel PintoICML 2021 · 262 citations
- RIDE: Rewarding Impact-Driven Exploration for Procedurally-Generated EnvironmentsRoberta Raileanu, Tim RocktäschelICLR 2020 · 198 citations
- Fast Task Inference with Variational Intrinsic Successor FeaturesSteven Hansen, Will Dabney, André Barreto, David Warde-Farley et al.ICLR 2020 · 176 citations
- Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDPYuanhao Wang, Kefan Dong, Xiaoyu Chen, Liwei WangICLR 2020 · 107 citations
Related papers
- Task-agnostic Exploration in Reinforcement LearningXuezhou Zhang, Yuzhe Ma, Adish SinglaNeurIPS 2020 · 56 citations
- Towards Principled Unsupervised Multi-Agent Reinforcement LearningRiccardo Zamboni, Mirco Mutti, Marcello RestelliNeurIPS 2025 · 5 citations
- Incremental Reinforcement Learning with Dual-Adaptive ε-Greedy ExplorationWei Ding, Siyang Jiang, Hsi-Wen Chen, Ming-Syan ChenAAAI 2023 · 11 citations
- MetaCURE: Meta Reinforcement Learning with Empowerment-Driven ExplorationJin Zhang, Jianhao Wang, Hao Hu, Tong Chen et al.ICML 2021 · 33 citations
- Task-Agnostic Exploration via Policy Gradient of a Non-Parametric State Entropy EstimateMirco Mutti, Lorenzo Pratissoli, Marcello RestelliAAAI 2021 · 62 citations
