about
Exploration by Random Network Distillation (2018) (arxiv.org)
1 point by headalgorithm on Feb 11, 2019 | hide | past | pdf | discuss on HN

In plain words: The agent earns a bonus for unfamiliar sights, measured by how badly one network fails to predict a fixed random network's reaction to each screen. On hard Atari games it beat average human play in Montezuma's Revenge without demonstrations or peeking at game state.

Abstract · Exploration by Random Network Distillation

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.

Yuri Burda, Harrison Edwards, Amos Storkey, Oleg Klimov
arXiv:1810.12894 · cs.LG, cs.AI, stat.ML · submitted Oct 30, 2018
abstract · pdf · html

add comment on HN