Exploring through Random Curiosity with General Value Functions
About
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.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Exploration | Diabolical Lock H=100 (test) | Mean Farthest Column Reached100 | 6 | |
| Reaching the farthest column | Diabolical Lock 5M frames H=100 | Mean Farthest Column Reached61 | 5 | |
| Reaching the farthest column | Diabolical Lock H=100 (10M frames) | Mean Farthest Column Reached94 | 5 | |
| Reaching the farthest column | Diabolical Lock H=100 (15M frames) | Mean Farthest Column Reached100 | 5 | |
| Reaching the farthest column | Diabolical Lock 20M frames H=100 | Mean Farthest Column Reached100 | 5 |