Bidirectional-Reachable Hierarchical Reinforcement Learning with Mutually Responsive Policies

Yu Luo, Fuchun Sun, Tianying Ji, Xianyuan Zhan
6/26/2024
cs.LGcs.AI

No official code found. Best implementation: Roythuly/BrHPO (2 stars, last commit 2024-06-12).

Abstract

Hierarchical reinforcement learning (HRL) addresses complex long-horizon tasks by skillfully decomposing them into subgoals. Therefore, the effectiveness of HRL is greatly influenced by subgoal reachability. Typical HRL methods only consider subgoal reachability from the unilateral level, where a dominant level enforces compliance to the subordinate level. However, we observe that when the dominant level becomes trapped in local exploration or generates unattainable subgoals, the subordinate level is negatively affected and cannot follow the dominant level's actions. This can potentially make both levels stuck in local optima, ultimately hindering subsequent subgoal reachability. Allowing real-time bilateral information sharing and error correction would be a natural cure for this issue, which motivates us to propose a mutual response mechanism. Based on this, we propose the Bidirectional-reachable Hierarchical Policy Optimization (BrHPO)--a simple yet effective algorithm that also enjoys computation efficiency. Experiment results on a variety of long-horizon tasks showcase that BrHPO outperforms other state-of-the-art HRL baselines, coupled with a significantly higher exploration efficiency and robustness.

View on arXivView PDF

Code Implementations(1)

Roythuly/BrHPOCommunity100%
20PythonJun 12, 20242 years ago

Similar Papers

Cite this paper

@article{luo2024bidirectionalreachable,
  title  = {Bidirectional-Reachable Hierarchical Reinforcement Learning with Mutually Responsive Policies},
  author = {Yu Luo and Fuchun Sun and Tianying Ji and Xianyuan Zhan},
  year   = {2024},
  eprint = {2406.18053},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.18053v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.18053.svg)](https://codeofpaper.com/paper/2406.18053)

Discussion