Curious hierarchical reinforcement learning improves learning performance.
problem Combining hierarchical abstraction and curiosity-driven exploration in reinforcement learning.
method Developed a method that combines hierarchical reinforcement learning with curiosity.
result Curiosity can more than double learning performance and success rates.
Develops hierarchical reinforcement learning value function approximators.
problem Estimating long-term returns in reinforcement learning with multiple goals.
method Introduces hierarchical universal value function approximators (H-UVFAs) using the options framework.
result Demonstrates generalization and improved performance of H-UVFAs over UVFAs.
Optimal learning paths designed for E-learning systems using reinforcement learning.
problem Designing optimal learning paths for E-learning systems.
method Developed a hierarchical skill model and a proficiency level model, applied reinforcement learning to find the optimal learning strategy.
result Demonstrated the effectiveness of the proposed framework via numerical experiments.
Model learns sub-goals and low-level policies for hierarchical reinforcement learning.
problem Determining appropriate low-level policies in hierarchical reinforcement learning.
method Unsupervised learning scheme based on asymmetric self-play.
result Obtains performance gains over non-hierarchical approaches.
Free Random Projection enhances reinforcement learning by naturally incorporating hierarchical structure.
problem Improving reinforcement learning algorithms for better generalization and adaptability.
method Introduces Free Random Projection, a method that uses free probability theory to create random orthogonal matrices encoding hierarchical structure.
result Empirically shows consistent improvement in generalization over standard methods on multi-environment benchmarks.
Novel online algorithm for hierarchical imitation learning.
problem Scalability issue in reinforcement learning and options discovery.
method Online Baum-Welch algorithm for hierarchical imitation learning.
result The online algorithm outperforms the batch version in both discrete and continuous environments.
Hierarchical RL simplifies exploration in RL tasks.
problem Why does hierarchy work well in RL?
method Evaluated hierarchical RL on various tasks, focusing on exploration benefits.
result Most benefits of hierarchy can be attributed to improved exploration.
Proves efficient learning of hierarchical structure in meta-reinforcement learning.
problem Lack of provable guarantees for learning hierarchical structures in reinforcement learning.
method Analyzed HRL in meta-RL setting with tabular transition dynamics, providing diversity conditions and regret bounds.
result Sample-efficient recovery of natural hierarchical structure with provable guarantees.
SeCTAR learns latent representations of trajectories for hierarchical reinforcement learning.
problem Learning lower layers in a hierarchy of reinforcement learning problems.
method SeCTAR uses variational autoencoders to learn latent representations of trajectories, combining policy and model consistency.
result SeCTAR effectively solves long-term and multi-stage problems with sparse rewards.
A new HRL method learns hierarchical policies using mutual information maximization.
problem Learning hierarchical policies in reinforcement learning for structured tasks.
method Mutual information maximization for latent variable learning, advantage-weighted importance sampling for option policies, deterministic policy gradient for optimization.
result Enhanced performance in continuous control tasks through learned hierarchical policies.
HAL learns hierarchical affordances to prune impossible subtasks, improving reinforcement learning efficiency.
problem Reinforcement learning struggles with complex hierarchical dependency structures.
method HAL learns a model of hierarchical affordances to prune impossible subtasks.
result HAL agents are better at learning complex tasks, navigating stochastic environments, and acquiring diverse skills.
A novel framework for adaptive multi-agent communication in reinforcement learning.
problem Manual specification of communication structures in multi-agent reinforcement learning.
method Learning Structured Communication (LSC) framework using hierarchical graph neural networks.
result Adaptive hierarchical formations and efficient message propagation among agents.
We improve learning sub-tasks in hierarchical reinforcement learning using hyperbolic embeddings.
problem Learning meaningful sub-tasks in hierarchical reinforcement learning remains challenging.
method Combining routing in computer networks and graph-based skill discovery, we use hyperbolic embeddings to define sub-goals.
result Hyperbolic embeddings enforce a global topology on states, enabling the learning of meaningful sub-tasks.
We study how to effectively leverage expert feedback to learn sequential decision-making policies. We focus on problems with sparse rewards and long time horizons, which typically pose significant challenges in reinforcement learning. We propose an algorithmic framework, called hierarchical guidance, that leverages the…
Graph Pointer Networks and hierarchical reinforcement learning solve combinatorial optimization problems like TSP.
problem Traveling Salesman Problem (TSP) with constraints.
method Graph Pointer Networks (GPNs) and hierarchical reinforcement learning.
result GPNs and hierarchical RL find optimal solutions for TSP and TSP with time windows.
Paper tackles RL for power grid topology optimization.
problem Managing large action spaces in growing power networks.
method Hierarchical multi-agent reinforcement learning (MARL) framework.
result MARL framework outperforms single-agent RL methods.
RHPO improves data-efficiency for hierarchical reinforcement learning.
problem High data requirements for general reinforcement learning algorithms in robotics.
method RHPO employs compositional inductive biases and task sharing mechanisms.
result RHPO enables stable and fast learning for complex domains with positive transfer.
The paper introduces an adjacency constraint to improve goal-conditioned HRL.
problem Training inefficiency in goal-conditioned HRL due to large action space.
method Restricting the high-level action space to a k-step adjacent region of the current state.
result The adjacency constraint preserves optimal hierarchical policies and improves HRL performance.
A new reinforcement learning approach using competitive primitives that specialize and specialize based on information needs.
problem Complex environments require efficient and specialized decision-making.
method Decomposes policy into competitive primitives that decide based on information needs, regularized to use minimal information.
result Improves generalization over flat and hierarchical policies.
Proposes a model for multi-agent reinforcement learning with hierarchical graph attention network.
problem Limited transferability of trained policies to new multi-agent tasks.
method Uses hierarchical graph attention network for representation learning and multi-agent actor-critic for policy learning.
result Demonstrates superior performance in mixed cooperative and competitive tasks compared to existing methods.
HiPPO adapts skills and higher-level policies together for better transfer in hierarchical RL.
problem Sub-optimality in skill transfer when lower-level skills are fixed.
method HiPPO: a novel hierarchical policy gradient method that trains all levels of the hierarchy jointly.
result Improved robustness of skills to environment changes through training time-abstractions.
Proves EM algorithm guarantees for hierarchical imitation learning.
problem Learning hierarchical policies from expert demonstrations.
method Converts hierarchical imitation learning to latent variable model inference, analyzes EM algorithm.
result Proves EM algorithm converges to true parameter under regular conditions.
MGHRL learns to generate high-level meta strategies for new tasks.
problem Efficiency and generalization in meta-RL for wide task distributions.
method Generates high-level meta strategies over subgoals, leaving subtask learning independent.
result More efficient and generalized meta-learning from past experience.
Eikonal-Constrained QRL improves goal-reaching in reinforcement learning.
problem Reward design and out-of-distribution generalization in reinforcement learning.
method Eikonal-Constrained Quasimetric Reinforcement Learning (Eik-QRL) using the Eikonal PDE.
result Eik-QRL achieves state-of-the-art performance in offline goal-conditioned navigation and manipulation tasks.
Proposes a hierarchical RL method with abductive planning for complex tasks.
problem Challenges in applying RL to complex real-life problems.
method Hierarchical reinforcement learning with abductive planning.
result Significantly improves learning efficiency in unknown state spaces.
Paper shows intrinsic motivation boosts exploration efficiency in HRL.
problem Efficient exploration and subgoal discovery in model-free HRL.
method Unsupervised learning over agent's experiences for subgoal discovery.
result Intrinsic motivation learning improves exploration efficiency.
A novel framework combines LLMs and RL for financial portfolio optimization.
problem Optimizing financial portfolios using sentiment analysis and market indicators.
method Hierarchical RL structure with base, meta, and super-agents.
result Achieved a 26% annualized return and Sharpe ratio of 1.2.
DSE learns transferable skills across changing dynamics and goals.
problem Learning transferable skills across different reinforcement learning tasks.
method Variational inference for multi-task reinforcement learning with shared and task-specific latent spaces.
result Policies can generalize to unseen dynamics and goals conditions.
In this work, we provide theoretical guarantees for reward decomposition in deterministic MDPs. Reward decomposition is a special case of Hierarchical Reinforcement Learning, that allows one to learn many policies in parallel and combine them into a composite solution. Our approach builds on mapping this problem into a…
Global convergence proved for multi-agent LQRs with hierarchical actor-critic.
problem Challenges in understanding multi-agent reinforcement learning algorithms.
method Developed a hierarchical actor-critic algorithm for partially exchangeable agents.
result Global linear convergence to optimal policy proved.
This paper learns actionable representations for reinforcement learning.
problem Learning comprehensive representations in reinforcement learning.
method Focuses on goal-conditioned policies to learn salient, actionable representations.
result Actionable representations improve exploration and hierarchical reinforcement learning.
RLHC uses multiple critics at different levels to enhance RL performance.
problem Speed up RL learning and increase cumulative rewards in competition tasks.
method Introducing multiple cooperative critics at two levels of a hierarchy to provide global information.
result RLHC outperforms PPO in tennis and soccer competitions.
TradeR uses RL to execute trades in real markets, minimizing surprise and catastrophe.
problem Minimizing surprise and catastrophe in high-frequency trading.
method Hierarchical RL with energy-based surprise value function.
result TradeR outperforms in abrupt price changes and maintains profitability.
PALM learns abstract models for efficient planning and task transfer.
problem Efficiently learning and transferring hierarchical models for planning.
method PALM uses a new formal structure (L-AMDP) to learn independent, modular models at multiple levels of abstraction.
result PALM integrates planning and execution, facilitating rapid learning of abstract models.
Reinforcement learning and symbolic planning have both been used to build intelligent autonomous agents. Reinforcement learning relies on learning from interactions with real world, which often requires an unfeasibly large amount of experience. Symbolic planning relies on manually crafted symbolic knowledge, which may …
Framework improves resilience in operations through joint long-term and short-term decision-making.
problem Resilient operations in global markets require adaptive decision rules.
method Developed a two-timescale hierarchical reinforcement learning framework.
result Framework increases mean profit by 9.2% under joint demand-supply shocks and 11.8% under prolonged shocks.
AIRL learns robust, generalizable reward functions from demonstrations.
problem Learning robust reward functions from demonstrations for changing environments.
method Adversarial Inverse Reinforcement Learning (AIRL) with hierarchical disentangled rewards.
result Generalizable policies and comparable results to state-of-the-art methods.
Paper tackles reinforcement learning for StarCraft II, achieving high win rates.
problem Grand challenge of reinforcement learning due to huge state and action space, long-time horizon.
method Hierarchical reinforcement learning approach with two levels of abstraction.
result Achieved over 93% winning rate against level-7 AI, demonstrating strong generalization.
Option Encoder compresses reinforcement learning options into a policy basis.
problem Redundant options in reinforcement learning frameworks.
method Auto-encoder framework with constrained weights to discover a policy basis.
result Option Encoder reduces the number of options while maintaining performance.
HyPE improves sample efficiency in DRL by discovering objects and hierarchies of skills.
problem Poor sample efficiency in DRL methods, especially in complex tasks.
method HyPE algorithm that discovers objects and generates hypotheses about their controllability, learning a hierarchy of skills.
result HyPE learns high-scoring policies an order of magnitude faster than state-of-the-art methods.
Extends deep learning for hierarchical data to improve classification accuracy.
problem Classification with costly features in hierarchical data.
method Extended deep reinforcement learning with hierarchical deep sets and softmax.
result Superior performance on seven datasets, including malicious web domain classification.
AG-RL uses action grammars to improve reinforcement learning efficiency.
problem Improving sample efficiency in reinforcement learning.
method Integrates action grammars into reinforcement learning algorithms to enhance performance.
result Significant improvement in performance across multiple Atari games.
Neuro-inspired RL solves complex control problems with fewer controllers.
problem Solving nonlinear control problems with unknown dynamics efficiently.
method Hierarchical RL framework combining limb coordination and reinforcement learning.
result Local LQR controllers combined with a reinforcement learner solve global nonlinear problems.
Learning goal-directed behavior in environments with sparse feedback is a major challenge for reinforcement learning algorithms. The primary difficulty arises due to insufficient exploration, resulting in an agent being unable to learn robust value functions. Intrinsically motivated agents can explore new behavior for …
A hybrid RL-Bayesian search configures machine learning pipelines efficiently.
problem Optimizing hyper-parameters in a hierarchical conditional space.
method Combines Reinforcement Learning and Bayesian Optimization.
result Outperforms state-of-the-art methods in pipeline optimization.
Unified pair trading approach using hierarchical reinforcement learning.
problem Decoupling pair selection and trading leads to limited performance.
method Hierarchical reinforcement learning framework for joint pair selection and trading.
result Unified approach outperforms existing methods on real-world stock data.
HRL improves open-domain dialog models by optimizing long-term conversational goals.
problem Challenges in open-domain dialog generation, including repetitive outputs, difficulty tracking conversational goals, and inappropriate text.
method Proposes VHRL, a hierarchical reinforcement learning approach using policy gradients to tune utterance-level embeddings of a variational sequence model.
result Significant improvements in human evaluation and automatic metrics over state-of-the-art dialog models.
New method automates asymmetric choice for better skill transfer in reinforcement learning.
problem Improving sample efficiency and transferability of reinforcement learning agents.
method Attentive Priors for Expressive and Transferable Skills (APES) using hierarchical KL-regularization.
result APES automates asymmetric choice, leading to better skill transfer across sequential tasks.