Exploration by Random Network Distillation

Yuri Burda, Harrison Edwards, Amos Storkey, Oleg Klimov
10/30/2018
cs.LGcs.AIstat.ML

Official code: openai/random-network-distillation (930 stars, last commit 2020-10-01).

Abstract

We introduce an exploration bonus for deep reinforcement learning methods that is easy to implement and adds minimal overhead to the computation performed. The bonus is the error of a neural network predicting features of the observations given by a fixed randomly initialized neural network. We also introduce a method to flexibly combine intrinsic and extrinsic rewards. We find that the random network distillation (RND) bonus combined with this increased flexibility enables significant progress on several hard exploration Atari games. In particular we establish state of the art performance on Montezuma's Revenge, a game famously difficult for deep reinforcement learning methods. To the best of our knowledge, this is the first method that achieves better than average human performance on this game without using demonstrations or having access to the underlying state of the game, and occasionally completes the first level.

View on arXivView PDF

Code Implementations(1)

Code for the paper "Exploration by Random Network Distillation"

930166PythonOct 16, 20186 years ago
paper

Cite this paper

@article{burda2018exploration,
  title  = {Exploration by Random Network Distillation},
  author = {Yuri Burda and Harrison Edwards and Amos Storkey and Oleg Klimov},
  year   = {2018},
  eprint = {1810.12894},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1810.12894}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1810.12894.svg)](https://codeofpaper.com/paper/1810.12894)

Discussion