Exploring through Random Curiosity with General Value Functions
Not on the map. Why?
Abstract (arXiv)
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 MiniGrid further boost RC-GVF's performance such that it is competitive to baselines exploiting privileged information in form of episodic counts.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 42 of its 83 references that are in the map. First posted on arXiv 18 Nov 2022.
Builds on
42 of 83 references.
References · 42
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
- 2017Deep Image Priorcited by 1,097
- 2018Exploration by Random Network Distillationcited by 966
- 2019Aleatoric and Epistemic Uncertainty in Machine Learning: An Introduction to Concepts and Methodscited by 903
- 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 866
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
- 2016Deep Exploration via Bootstrapped DQNcited by 518
- 2016Reinforcement Learning with Unsupervised Auxiliary Taskscited by 400
- 2020Planning to Explore via Self-Supervised World Modelscited by 365
- 2020Agent57: Outperforming the Atari Human Benchmarkcited by 300
30 more
- 2018Large-Scale Study of Curiosity-Driven Learningcited by 277
- 2019Self-Supervised Exploration via Disagreementcited by 263
- 2017Count-Based Exploration with Neural Density Modelscited by 255
- 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 218
- 2020RIDE: Rewarding Impact-Driven Exploration for Procedurally-Generated Environmentscited by 135
- 2019Kinematic State Abstraction and Provably Efficient Rich-Observation Reinforcement Learningcited by 114
- 2014Generalization and Exploration via Randomized Value Functionscited by 112
- 2018Model-Based Active Explorationcited by 105
- 2021DEUP: Direct Epistemic Uncertainty Predictioncited by 102
- 2020PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient Learningcited by 91
- 2020Learning with AMIGo: Adversarially Motivated Intrinsic Goalscited by 86
- 2021A Survey of Exploration Methods in Reinforcement Learningcited by 68
- 2021Reinforcement Learning, Bit by Bitcited by 59
- 2021On The Effect of Auxiliary Tasks on Representation Dynamicscited by 56
- 2021Tactical Optimism and Pessimism for Deep Reinforcement Learningcited by 55
- 2019A Geometric Perspective on Optimal Representations for Reinforcement Learningcited by 54
- 2021Adversarially Guided Actor-Criticcited by 47
- 2019Discovery of Useful Questions as Auxiliary Taskscited by 45
- 2021Interesting Object, Curious Agent: Learning Task-Agnostic Explorationcited by 38
- 2020Policy Evaluation Networkscited by 28
- 2021Rank the Episodes: A Simple Approach for Exploration in Procedurally-Generated Environmentscited by 28
- 2022The Challenges of Exploration for Offline Reinforcement Learningcited by 26
- 2020Parameter-Based Value Functionscited by 24
- 2019Using a Logarithmic Mapping to Enable Lower Discount Factors in Reinforcement Learningcited by 16
- 2022Reward-Respecting Subtasks for Model-Based Reinforcement Learningcited by 15
- 2015Temporal-Difference Networkscited by 12
- 2022Continual Auxiliary Task Learningcited by 9
- 2018The Barbados 2018 List of Open Issues in Continual Learningcited by 7
- 2021Learning State Representations from Random Deep Action-conditional Predictionscited by 6
- 2021Finding Useful Predictions by Meta-gradient Descent to Improve Decision-makingcited by 1
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 4; 2025: 2; 2026: 1.
10 papers.
- 2023A Study of Global and Episodic Bonuses for Exploration in Contextual MDPscited by 19
- 2025Episodic Novelty Through Temporal Distancecited by 15
- 2023MIMEx: Intrinsic Rewards from Masked Input Modelingcited by 6
- 2024Settling Decentralized Multi-Agent Coordinated Exploration by Novelty Sharingcited by 6
- 2024Random Latent Exploration for Deep Reinforcement Learningcited by 6
- 2022Learning One Abstract Bit at a Time Through Self-Invented Experiments Encoded as Neural Networkscited by 4
- 2024Training on Irrelevant States Implies Data Augmentation: Generalization in Contextual MDPscited by 1
- 2024Explore-Go: Leveraging Exploration for Generalisation in Deep Reinforcement Learningcited by 0
- 2025Finite-time Convergence Analysis of Actor-Critic with Evolving Rewardcited by 0
- 2026SLOPE: Optimistic Potential Landscape Shaping for Model-based Reinforcement Learningcited by 0
- 2026SLOPE: Optimistic Potential Landscape Shaping for Model-based Reinforcement Learning3 Feb 2026
- 2025Finite-time Convergence Analysis of Actor-Critic with Evolving Reward14 Oct 2025
- 2025Episodic Novelty Through Temporal Distance26 Jan 2025
- 2024Training on Irrelevant States Implies Data Augmentation: Generalization in Contextual MDPs4 Oct 2024
- 2024Random Latent Exploration for Deep Reinforcement Learning18 Jul 2024
- 2024Explore-Go: Leveraging Exploration for Generalisation in Deep Reinforcement Learning12 Jun 2024
- 2024Settling Decentralized Multi-Agent Coordinated Exploration by Novelty Sharing3 Feb 2024
- 2023A Study of Global and Episodic Bonuses for Exploration in Contextual MDPs5 Jun 2023
- 2023MIMEx: Intrinsic Rewards from Masked Input Modeling15 May 2023
- 2022Learning One Abstract Bit at a Time Through Self-Invented Experiments Encoded as Neural Networks29 Dec 2022