Interpretable Model-based Hierarchical Reinforcement Learning Using Inductive Logic Programming

Abstract

Recently deep reinforcement learning has achieved tremendous success in wide ranges of applications. However, it notoriously lacks data-efficiency and interpretability. Data-efficiency is important as interacting with the environment is expensive. Further, interpretability can increase the transparency of the black-box-style deep RL models and hence gain trust from the users. In this work, we propose a new hierarchical framework via symbolic RL, leveraging a symbolic transition model to improve the data-efficiency and introduce the interpretability for learned policy. This framework consists of a high-level agent, a subtask solver and a symbolic transition model. Without assuming any prior knowledge on the state transition, we adopt inductive logic programming (ILP) to learn the rules of symbolic state transitions, introducing interpretability and making the learned behavior understandable to users. In empirical experiments, we confirmed that the proposed framework offers approximately

Stats

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

Related papers

• Hierarchical Framework For Interpretable And Probabilistic Model-based Safe Reinforcement Learning (2023)0.00
• Offline Hierarchical Reinforcement Learning Via Inverse Optimization (2024)0.00
• Learning Representations In Model-free Hierarchical Reinforcement Learning (2018)11.49
• Three Pathways To Neurosymbolic Reinforcement Learning With Interpretable Model And Policy Networks (2024)0.00
• Hierarchical Decision Making Based On Structural Information Principles (2024)0.00
• Online Inductive Learning From Answer Sets For Efficient Reinforcement Learning Exploration (2025)0.00
• Learning Interpretable Policies In Hindsight-observable Pomdps Through Partially Supervised Reinforcement Learning (2024)2.26
• Exploring The Limits Of Hierarchical World Models In Reinforcement Learning (2024)6.34