English

MIME: Mutual Information Minimisation Exploration

Machine Learning 2020-01-17 v1 Machine Learning

Abstract

We show that reinforcement learning agents that learn by surprise (surprisal) get stuck at abrupt environmental transition boundaries because these transitions are difficult to learn. We propose a counter-intuitive solution that we call Mutual Information Minimising Exploration (MIME) where an agent learns a latent representation of the environment without trying to predict the future states. We show that our agent performs significantly better over sharp transition boundaries while matching the performance of surprisal driven agents elsewhere. In particular, we show state-of-the-art performance on difficult learning games such as Gravitar, Montezuma's Revenge and Doom.

Keywords

Cite

@article{arxiv.2001.05636,
  title  = {MIME: Mutual Information Minimisation Exploration},
  author = {Haitao Xu and Brendan McCane and Lech Szymanski and Craig Atkinson},
  journal= {arXiv preprint arXiv:2001.05636},
  year   = {2020}
}
R2 v1 2026-06-23T13:12:36.262Z