pith. sign in

arxiv: 1810.01176 · v6 · pith:RX4MKH7Qnew · submitted 2018-10-02 · 💻 cs.LG · cs.AI· stat.ML

EMI: Exploration with Mutual Information

classification 💻 cs.LG cs.AIstat.ML
keywords explorationactionsforwardgenerativeguidemodelspredictiverandom
0
0 comments X
read the original abstract

Reinforcement learning algorithms struggle when the reward signal is very sparse. In these cases, naive random exploration methods essentially rely on a random walk to stumble onto a rewarding state. Recent works utilize intrinsic motivation to guide the exploration via generative models, predictive forward models, or discriminative modeling of novelty. We propose EMI, which is an exploration method that constructs embedding representation of states and actions that does not rely on generative decoding of the full observation but extracts predictive signals that can be used to guide exploration based on forward prediction in the representation space. Our experiments show competitive results on challenging locomotion tasks with continuous control and on image-based exploration tasks with discrete actions on Atari. The source code is available at https://github.com/snu-mllab/EMI .

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.