Skip to content
Open access

Hierarchical Reinforcement Learning with Optimal Level Synchronization Based on Flow-Based Deep Generative Model

Jul 2021 · Journal of Artificial Intelligence Research · Vol 86 · 0 citations · 44 references
Computer Science

TL;DR

A novel HRL model is proposed that supports direct off-policy correction based on a Flow-based Deep Generative Model (FDGM) that leverages the inverse operation of FDGM to achieve goals aligned with the current knowledge of the lower-level policy.

Abstract

High-dimensional state and action spaces com- bined with sparse reward structures in reinforcement learning (RL) environments typically require advanced control architec- tures. Hierarchical Reinforcement Learning (HRL) demonstrates superior performance compared to atomic RL approaches in these challenging scenarios. HRL can manage the complexity of commands to achieve task objectives through its hierarchical structure. One of the key challenges in HRL is efficiently training each level’s policy with optimal data collection from its experience. Off-policy correction is a critical technique for facilitating sample-efficient off-policy training in HRL, as it addresses the non-stationary issue of higher-level policy training. However, existing methods typically employ indirect probabilistic approaches that fail to accurately capture the current capability of the lower-level policy. This mismatch ultimately constrains the effectiveness of higher-level policy training. In this paper, we propose a novel HRL model that supports direct off-policy correction based on a Flow-based Deep Generative Model (FDGM). This approach leverages the inverse operation of FDGM to achieve goals aligned with the current knowledge of the lower-level policy. Additionally, our model addresses the limitations of FDGM to enable its effective use in HRL. Through comparative experiments on benchmark environments, our model demonstrates superior performance over existing models

Read PDF

Similar papers

Jul 2026

Sample Efficient Hierarchical Reinforcement Learning via Best Policy Identification

In the sparse-reward, goal-directed setting, the sample complexity upper bound for HBPI-UCRL is strictly lower than that of its non-hierarchical counterpart, providing theoretical justification for the empirical success of HRL.

Anders Jonsson, E. Kaufmann, Gianmarco Tedeschi et al. · 0 citations
Preprint Jul 2026

ORCAID: Oblique Rule-Based Continuous-Action Interpretation for Deep RL Policies

This work introduces ORCAID, a novel method for extracting interpretable rule-based policies from RL agents operating in mixed continuous-discrete environments with continuous action spaces, with an efficient oblique decision tree training algorithm that partitions the state space by hyperplanes and fits local linear m...

Ignacio D. Lopez-Miguel, E. Bartocci, Thomas Eiter et al. · 0 citations
Open access Aug 2026

L-ARLPT: An LLM-Augmented Reinforcement Learning Framework for Autonomous Penetration Testing

A Large Language Model-enhanced Autonomous Reinforcement Learning Penetration Testing framework that leverages the domain knowledge embedded in a Large Language Model to perform tactical planning, thereby pruning the original action space into a compact set of candidate actions.

Rufeng Zhan, Junyi Zhu, Yinghui Xu et al. · 0 citations
Jul 2026

Hierarchical Soft Actor-Critic for Sparse-Reward Long-Horizon Reinforcement Learning

HRL-SAC effectively addresses sparse-reward long-horizon search problems characterized by delayed rewards and continuous control, and its outperforming the flat SAC baseline reinforcement learning in terms of success rates, coverage efficiency, and convergence.

Zahra Abdalla Elashaal, Afef Hfaiedh, N. Khraief et al. · 0 citations
Preprint Aug 2026

Learning Hierarchical Skill Policies with Offline Quality-Diversity Reinforcement Learning

QDOS (Quality-Diversity Offline Skill learning), a unified pipeline for robust offline-to-online learning, incorporates an Advantage-Weighted Quality-Diversity pretraining objective, which weights the skill extraction and diversity objectives by the estimated advantage of each trajectory segment.

Tanachai Anakewat, Takayuki Osa, Tatsuya Harada · 0 citations
#artificial intelligence Preprint Aug 2026

Q-Learning With World Models

This work proposes QWM, a framework that leverages world models to perform test-time search over imagined trajectories on top of Q-learning to select high-value actions during both online rollouts and evaluation, and significantly outperforms strong prior state-of-the-art methods on both sample efficiency and performan...

Perry Dong, Yue-Ru Jia, Chelsea Finn et al. · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.