HAC Explore: Accelerating Exploration with Hierarchical Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Sparse rewards and long time horizons remain challenging for reinforcement learning algorithms. Exploration bonuses can help in sparse reward settings by encouraging agents to explore the state space, while hierarchical approaches can assist with long-horizon tasks by decomposing lengthy tasks into shorter subtasks. We propose HAC Explore (HACx), a new method that combines these approaches by integrating the exploration bonus method Random Network Distillation (RND) into the hierarchical approach Hierarchical Actor-Critic (HAC). HACx outperforms either component method on its own, as well as an existing approach to combining hierarchy and exploration, in a set of difficult simulated robotics tasks. HACx is the first RL method to solve a sparse reward, continuous-control task that requires over 1,000 actions.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 11 of its 19 references that are in the map. First posted on arXiv 12 Aug 2021.
Builds on
11 of 19 references.
References · 11
- 2015Continuous control with deep reinforcement learningcited by 3,407
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
- 2018Exploration by Random Network Distillationcited by 993
- 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 752
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
- 2018Data-Efficient Hierarchical Reinforcement Learningcited by 455
- 2019Relay Policy Learning: Solving Long-Horizon Tasks via Imitation and Reinforcement Learningcited by 384
- 2020OPAL: Offline Primitive Discovery for Accelerating Offline Reinforcement Learningcited by 166
- 2021Hierarchical Reinforcement Learning By Discovering Intrinsic Optionscited by 58
- 2018Hierarchical Reinforcement Learning with Hindsightcited by 26
- 2020Curious Hierarchical Actor-Critic Reinforcement Learningcited by 8
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 1.
3 papers.