Beyond Noisy-TVs: Noise-Robust Exploration Via Learning Progress Monitoring
Zhibo Hou, Zhiyu An, Wan Du
摘要
When there exists an unlearnable source of randomness (noisy-TV) in the environment, a naively intrinsic reward driven exploring agent gets stuck at that source of randomness and fails at exploration. Intrinsic reward based on uncertainty estimation or distribution similarity, while eventually escapes noisy-TVs as time unfolds, suffers from poor sample efficiency and high computational cost. Inspired by recent findings from neuroscience that humans monitor their improvements during exploration, we propose a novel method for intrinsically-motivated exploration, named Learning Progress Monitoring (LPM). During exploration, LPM rewards model improvements instead of prediction error or novelty, effectively rewards the agent for observing learnable transitions rather than the unlearnable transitions. We introduce a dual-network design that uses an error model to predict the expected prediction error of the dynamics model in its previous iteration, and use the difference between the model errors of the current iteration and previous iteration to guide exploration. We theoretically show that the intrinsic reward of LPM is zero-equivariant and a monotone indicator of Information Gain (IG), and that the error model is necessary to achieve monotonicity correspondence with IG. We empirically compared LPM against state-of-the-art baselines in noisy environments based on MNIST, 3D maze with 160x120 RGB inputs, and Atari. Results show that LPM's intrinsic reward converges faster, explores more states in the maze experiment, and achieves higher extrinsic reward in Atari. This conceptually simple approach marks a shift-of-paradigm of noise-robust exploration. For code to reproduce our experiments, see https://github.com/Akuna23Matata/LPM_exploration
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper17
- Never Give Up: Learning Directed Exploration StrategiesAdrià Puigdomènech Badia, Pablo Sprechmann, Alex Vitvitskyi, Zhaohan Daniel Guo 等ICLR 2020 · 被引用 349 次
- RIDE: Rewarding Impact-Driven Exploration for Procedurally-Generated EnvironmentsRoberta Raileanu, Tim RocktäschelICLR 2020 · 被引用 198 次
- NovelD: A Simple yet Effective Exploration CriterionTianjun Zhang, Huazhe Xu, Xiaolong Wang, Yi Wu 等NeurIPS 2021 · 被引用 106 次
- Improving Intrinsic Exploration with Language AbstractionsJesse Mu, Victor Zhong, Roberta Raileanu, Minqi Jiang 等NeurIPS 2022 · 被引用 81 次
- Adversarially Guided Actor-CriticYannis Flet-Berliac, Johan Ferret, Olivier Pietquin, Philippe Preux 等ICLR 2021 · 被引用 78 次
相关 Paper
- How to Stay Curious while avoiding Noisy TVs using Aleatoric Uncertainty EstimationAugustine N. Mavor-Parker, Kimberly A. Young, Caswell Barry, Lewis D. GriffinICML 2022 · 被引用 32 次
- Curiosity in Hindsight: Intrinsic Exploration in Stochastic EnvironmentsDaniel Jarrett, Corentin Tallec, Florent Altché, Thomas Mesnard 等ICML 2023 · 被引用 3 次
- Redeeming intrinsic rewards via constrained optimizationEric Chen, Zhang-Wei Hong, Joni Pajarinen, Pulkit AgrawalNeurIPS 2022 · 被引用 48 次
- Implicit Generative Modeling for Efficient ExplorationNeale Ratzlaff, Qinxun Bai, Fuxin Li, Wei XuICML 2020 · 被引用 15 次
- MIMEx: Intrinsic Rewards from Masked Input ModelingToru Lin, Allan JabriNeurIPS 2023 · 被引用 8 次
