Hyperbolic Embeddings For Learning Options In Hierarchical Reinforcement Learning

Abstract

Hierarchical reinforcement learning deals with the problem of breaking down large tasks into meaningful sub-tasks. Autonomous discovery of these sub-tasks has remained a challenging problem. We propose a novel method of learning sub-tasks by combining paradigms of routing in computer networks and graph based skill discovery within the options framework to define meaningful sub-goals. We apply the recent advancements of learning embeddings using Riemannian optimisation in the hyperbolic space to embed the state set into the hyperbolic space and create a model of the environment. In doing so we enforce a global topology on the states and are able to exploit this topology to learn meaningful sub-tasks. We demonstrate empirically, both in discrete and continuous domains, how these embeddings can improve the learning of meaningful sub-tasks.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keytiwari2018hyperbolic

Related papers

• Learning Representations In Model-free Hierarchical Reinforcement Learning (2018)11.49
• Near-optimal Representation Learning For Hierarchical Reinforcement Learning (2018)0.00
• Learning And Exploiting Multiple Subgoals For Fast Exploration In Hierarchical Reinforcement Learning (2019)0.00
• Reusable Options Through Gradient-based Meta Learning (2022)0.00
• Globally Optimal Hierarchical Reinforcement Learning For Linearly-solvable Markov Decision Processes (2021)2.26
• Multi-horizon Representations With Hierarchical Forward Models For Reinforcement Learning (2022)0.00
• A Provably Efficient Option-based Algorithm For Both High-level And Low-level Learning (2024)0.00
• Option Discovery In Hierarchical Reinforcement Learning Using Spatio-temporal Clustering (2016)0.00