A Novel Approach to Curiosity and Explainable Reinforcement Learning via Interpretable Sub-Goals
Not on the map. Why?
Abstract (arXiv)
Two key challenges within Reinforcement Learning involve improving (a) agent learning within environments with sparse extrinsic rewards and (b) the explainability of agent actions. We describe a curious subgoal focused agent to address both these challenges. We use a novel method for curiosity produced from a Generative Adversarial Network (GAN) based model of environment transitions that is robust to stochastic environment transitions. Additionally, we use a subgoal generating network to guide navigation. The explainability of the agent's behavior is increased by decomposing complex tasks into a sequence of interpretable subgoals that do not require any manual design. We show that this method also enables the agent to solve challenging procedurally-generated tasks that contain stochastic transitions above other state-of-the-art methods.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 17 of its 22 references that are in the map. First posted on arXiv 14 Apr 2021.
Builds on
17 of 22 references.
References · 17
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2017Axiomatic Attribution for Deep Networkscited by 3,350
- 2019Mastering Atari, Go, Chess and Shogi by Planning with a Learned Modelcited by 1,327
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
- 2018Exploration by Random Network Distillationcited by 966
- 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 866
- 2016Benchmarking Deep Reinforcement Learning for Continuous Controlcited by 361
- 2020Agent57: Outperforming the Atari Human Benchmarkcited by 300
- 2017Toward Multimodal Image-to-Image Translationcited by 295
- 2018Large-Scale Study of Curiosity-Driven Learningcited by 277
- 2016Modular Multitask Reinforcement Learning with Policy Sketchescited by 200
- 2019Explainable Reinforcement Learning Through a Causal Lenscited by 177
5 more
- 2019Explaining Deep Neural Networks with a Polynomial Time Algorithm for Shapley Values Approximationcited by 115
- 2020Learning with AMIGo: Adversarially Motivated Intrinsic Goalscited by 86
- 2019TorchBeast: A PyTorch Platform for Distributed RLcited by 41
- 2017Maximum-Likelihood Augmented Discrete Generative Adversarial Networkscited by 39
- 2019Learning and Exploiting Multiple Subgoals for Fast Exploration in Hierarchical Reinforcement Learningcited by 1
Built on by
Citing papers per year: 2022: 1; 2023: 1.
2 papers.