LGMLJan 1, 2020

Long-Term Visitation Value for Deep Exploration in Sparse Reward Reinforcement Learning

arXiv:2001.00119v211 citationsHas Code
AI Analysis

This addresses the problem of slow or failed learning in sparse reward scenarios for reinforcement learning practitioners, offering an incremental improvement over existing exploration methods.

The paper tackles the challenge of sparse reward reinforcement learning by proposing a novel approach that uses long-term visitation counts and decouples exploration and exploitation, outperforming existing methods in environments with sparse rewards and suboptimal reward modes, with results showing graceful scaling with environment size.

Reinforcement learning with sparse rewards is still an open challenge. Classic methods rely on getting feedback via extrinsic rewards to train the agent, and in situations where this occurs very rarely the agent learns slowly or cannot learn at all. Similarly, if the agent receives also rewards that create suboptimal modes of the objective function, it will likely prematurely stop exploring. More recent methods add auxiliary intrinsic rewards to encourage exploration. However, auxiliary rewards lead to a non-stationary target for the Q-function. In this paper, we present a novel approach that (1) plans exploration actions far into the future by using a long-term visitation count, and (2) decouples exploration and exploitation by learning a separate function assessing the exploration value of the actions. Contrary to existing methods which use models of reward and dynamics, our approach is off-policy and model-free. We further propose new tabular environments for benchmarking exploration in reinforcement learning. Empirical results on classic and novel benchmarks show that the proposed approach outperforms existing methods in environments with sparse rewards, especially in the presence of rewards that create suboptimal modes of the objective function. Results also suggest that our approach scales gracefully with the size of the environment. Source code is available at https://github.com/sparisi/visit-value-explore

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes