Balancing Exploration and Exploitation in Hierarchical Reinforcement Learning via Latent Landmark Graphs
Not on the map. Why?
Abstract (arXiv)
Goal-Conditioned Hierarchical Reinforcement Learning (GCHRL) is a promising paradigm to address the exploration-exploitation dilemma in reinforcement learning. It decomposes the source task into subgoal conditional subtasks and conducts exploration and exploitation in the subgoal space. The effectiveness of GCHRL heavily relies on subgoal representation functions and subgoal selection strategy. However, existing works often overlook the temporal coherence in GCHRL when learning latent subgoal representations and lack an efficient subgoal selection strategy that balances exploration and exploitation. This paper proposes HIerarchical reinforcement learning via dynamically building Latent Landmark graphs (HILL) to overcome these limitations. HILL learns latent subgoal representations that satisfy temporal coherence using a contrastive representation learning objective. Based on these representations, HILL dynamically builds latent landmark graphs and employs a novelty measure on nodes and a utility measure on edges. Finally, HILL develops a subgoal selection strategy that balances exploration and exploitation by jointly considering both measures. Experimental results demonstrate that HILL outperforms state-of-the-art baselines on continuous control tasks with sparse rewards in sample efficiency and asymptotic performance. Our code is available at https://github.com/papercode2022/HILL.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 36 references that are in the map. First posted on arXiv 22 Jul 2023.
Builds on
22 of 36 references.
References · 22
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2017Hindsight Experience Replaycited by 1,136
- 2018Data-Efficient Hierarchical Reinforcement Learningcited by 455
- 2017FeUdal Networks for Hierarchical Reinforcement Learningcited by 337
- 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 309
- 2016Hierarchical Deep Reinforcement Learning: Integrating Temporal Abstraction and Intrinsic Motivationcited by 286
- 2019Search on the Replay Buffer: Bridging Planning and Reinforcement Learningcited by 194
- 2018Count-Based Exploration with the Successor Representationcited by 112
- 2019Hierarchical Foresight: Self-Supervised Learning of Long-Horizon Tasks via Visual Subgoal Generationcited by 83
- 2020World Model as a Graph: Learning Latent Landmarks for Planningcited by 69
- 2019Why Does Hierarchy (Sometimes) Work So Well in Reinforcement Learning?cited by 68
- 2020Generating Adjacency-Constrained Subgoals in Hierarchical Reinforcement Learningcited by 58
10 more
- 2018Learning Actionable Representations with Goal-Conditioned Policiescited by 54
- 2022Hierarchical Planning Through Goal-Conditioned Offline Reinforcement Learningcited by 50
- 2020Sparse Graphical Memory for Robust Planningcited by 31
- 2018Unsupervised Learning of Goal Spaces for Intrinsically Motivated Goal Explorationcited by 23
- 2021Active Hierarchical Exploration with Stable Subgoal Representation Learningcited by 17
- 2017Feature Control as Intrinsic Motivation for Hierarchical Reinforcement Learningcited by 15
- 2019Learning World Graphs to Accelerate Hierarchical Reinforcement Learningcited by 12
- 2019Scheduled Intrinsic Drive: A Hierarchical Take on Intrinsically Motivated Explorationcited by 11
- 2020Curious Hierarchical Actor-Critic Reinforcement Learningcited by 8
- 2018Hierarchical Reinforcement Learning with Abductive Planningcited by 5
Built on by
Citing papers per year: 2025: 1.
1 paper.