356 citations · 1.2k across the 14 of their papers we have counts for
Showing 2018 · cs.LGShow all
2 papers · 2 filters
cs.LG2018★ 245 cited
Exploration by Random Network Distillation
Yuri Burda, Harrison Edwards, Amos Storkey +1
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 o…
cs.LG2018★ 356 cited
Large-Scale Study of Curiosity-Driven Learning
Yuri Burda, Harri Edwards, Deepak Pathak +3
Reinforcement learning algorithms rely on carefully engineering environment rewards that are extrinsic to the agent. However, annotating each environment with hand-designed, dense…