Density-based bonuses on learned representations for reward-free exploration in deep reinforcement learning

Omar Darwiche Domingues, Corentin Tallec, Rémi Munos, Michal Valko

2021 · in (ICML 2021 - URL)

Abstract

In this paper, we study the problem of representation learning and exploration in reinforcement learning. We propose a framework to compute exploration bonuses based on density estimation, that can be used with any representation learning method, and that allows the agent to explore without extrinsic rewards. In the special case of tabular Markov decision processes (MDPs), this approach mimics the behavior of theoretically sound algorithms. In continuous and partially observable MDPs, the same approach can be applied by learning a latent representation, on which a probability density is estimated.

PDF · ICML 2021 Workshop: Unsupervised Reinforcement Learning · OpenReview · bibtex