TL;DR
This paper introduces a causal graph-based approach to hierarchical reinforcement learning, enabling targeted interventions on subgoals, which significantly improves training efficiency and outperforms existing methods.
Contribution
It models subgoal structures as causal graphs and develops a causal discovery algorithm to enhance exploration and efficiency in HRL.
Findings
Significant reduction in training cost with targeted interventions.
Formal analysis of causal HRL for tree and Erdős-Rényi graph structures.
Outperforms existing methods on HRL tasks.
Abstract
Hierarchical reinforcement learning (HRL) improves the efficiency of long-horizon reinforcement-learning tasks with sparse rewards by decomposing the task into a hierarchy of subgoals. The main challenge of HRL is efficient discovery of the hierarchical structure among subgoals and utilizing this structure to achieve the final goal. We address this challenge by modeling the subgoal structure as a causal graph and propose a causal discovery algorithm to learn it. Additionally, rather than intervening on the subgoals at random during exploration, we harness the discovered causal model to prioritize subgoal interventions based on their importance in attaining the final goal. These targeted interventions result in a significantly more efficient policy in terms of the training cost. Unlike previous work on causal HRL, which lacked theoretical analysis, we provide a formal analysis of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
