按年被提到
20182019 · 1 次2026
强化学习与智能体›博弈与游戏 AI·arXiv:1810.12894 · cs.LG

Exploration by Random Network Distillation

Yuri Burda, Harrison Edwards, Amos Storkey, Oleg Klimov · 2018
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2019-02-11 · 最近 2024-08-11
2不同的人
2活跃月份
2讨论串
525被引(OpenAlex)
arXiv 摘要(候选层不写导读)

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.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论adroniser · 2024-08

“But RL algorithms do implement things like curiosity to drive exploration?? https://arxiv.org/pdf/1810.12894. Thinking to arbitrary depth sounds like Monte Carlo tree search? Which is often implemented in conjunction with RL. And working memory I think is a matter of the architecture you use in conjunction with RL, agree that transformers aren't very hel…”

RLHF is just barely RL原评论 ↗
被提交为 story · 1 次