Exploring through Random Curiosity with General Value Functions
Aditya A. Ramesh, Louis Kirsch, Sjoerd van Steenkiste, Jürgen Schmidhuber
Abstract
Efficient exploration in reinforcement learning is a challenging problem commonly addressed through intrinsic rewards. Recent prominent approaches are based on state novelty or variants of artificial curiosity. However, directly applying them to partially observable environments can be ineffective and lead to premature dissipation of intrinsic rewards. Here we propose random curiosity with general value functions (RC-GVF), a novel intrinsic reward function that draws upon connections between these distinct approaches. Instead of using only the current observation's novelty or a curiosity bonus for failing to predict precise environment dynamics, RC-GVF derives intrinsic rewards through predicting temporally extended general value functions. We demonstrate that this improves exploration in a hard-exploration diabolical lock problem. Furthermore, RC-GVF significantly outperforms previous methods in the absence of ground-truth episodic counts in the partially observable MiniGrid environments. Panoramic observations on Mini-Grid further boost RC-GVF's performance such that it is competitive to baselines exploiting privileged information in form of episodic counts. * Part of this work was done while the author was a Postdoctoral researcher at IDSIA. 36th Conference on Neural Information Processing Systems (NeurIPS 2022).
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.
Cited by top-tier papers7
- A Study of Global and Episodic Bonuses for Exploration in Contextual MDPsMikael Henaff, Minqi Jiang, Roberta RaileanuICML 2023 · 18 citations
- MIMEx: Intrinsic Rewards from Masked Input ModelingToru Lin, Allan JabriNeurIPS 2023 · 8 citations
- Random Latent Exploration for Deep Reinforcement LearningSrinath Mahankali, Zhang-Wei Hong, Ayush Sekhari, Alexander Rakhlin et al.ICML 2024 · 8 citations
- Learning Interpretable Options by Identifying Reward Diffusion Bottlenecks in Reinforcement LearningYiming Fei, Ziming Wang, Rui Yan, Huajin TangICML 2026
- Epistemic Monte Carlo Tree SearchYaniv Oren, Viliam Vadocz, Matthijs T. J. Spaan, Wendelin BoehmerICLR 2025
Builds on14
- Planning to Explore via Self-Supervised World ModelsRamanan Sekar, Oleh Rybkin, Kostas Daniilidis, Pieter Abbeel et al.ICML 2020 · 489 citations
- RIDE: Rewarding Impact-Driven Exploration for Procedurally-Generated EnvironmentsRoberta Raileanu, Tim RocktäschelICLR 2020 · 198 citations
- Kinematic State Abstraction and Provably Efficient Rich-Observation Reinforcement LearningDipendra Misra, Mikael Henaff, Akshay Krishnamurthy, John LangfordICML 2020 · 158 citations
- PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient LearningAlekh Agarwal, Mikael Henaff, Sham M. Kakade, Wen SunNeurIPS 2020 · 126 citations
- NovelD: A Simple yet Effective Exploration CriterionTianjun Zhang, Huazhe Xu, Xiaolong Wang, Yi Wu et al.NeurIPS 2021 · 106 citations
Related papers
- Go Beyond Imagination: Maximizing Episodic Reachability with World ModelsYao Fu, Run Peng, Honglak LeeICML 2023 · 1 citation
- Sequential Generative Exploration Model for Partially Observable Reinforcement LearningHaiyan Yin, Jianda Chen, Sinno Jialin Pan, Sebastian TschiatschekAAAI 2021 · 7 citations
- Revisiting Intrinsic Reward for Exploration in Procedurally Generated EnvironmentsKaixin Wang, Kuangqi Zhou, Bingyi Kang, Jiashi Feng et al.ICLR 2023
- LECO: Learnable Episodic Count for Task-Specific Intrinsic RewardDaeJin Jo, Sungwoong Kim, Daniel Wontae Nam, Taehwan Kwon et al.NeurIPS 2022 · 14 citations
- Rank the Episodes: A Simple Approach for Exploration in Procedurally-Generated EnvironmentsDaochen Zha, Wenye Ma, Lei Yuan, Xia Hu et al.ICLR 2021 · 47 citations
