Evolutionary learning of interpretable decision trees
Authors: Leonardo Lucio Custode, Giovanni Iacca
AI-generated Key Points
- Reinforcement learning techniques have achieved human-level performance in various tasks over the past decade.
- Interpretability has become increasingly important as the field advances.
- Understanding how AI systems operate and the rationale behind their decisions is crucial for safety assessment and problem-solving.
- Existing techniques for interpretable reinforcement learning may be limited by suboptimal solutions due to reliance on greedy algorithms or underutilization of rewards.
- A novel approach using decision trees combines evolutionary algorithms with Q-learning for enhanced performance and interpretability.
- The two-level optimization strategy aims to improve state space decomposition and action association, leading to competitive results in benchmark tests.
- Experimentation showed that the new method is on par with current state-of-the-art techniques in terms of both performance and interpretability.
- Ablation study confirmed significant performance improvement in complex environments compared to traditional single-layer optimization methods.
Abstract: Reinforcement learning techniques achieved human-level performance in several tasks in the last decade. However, in recent years, the need for interpretability emerged: we want to be able to understand how a system works and the reasons behind its decisions. Not only we need interpretability to assess the safety of the produced systems, we also need it to extract knowledge about unknown problems. While some techniques that optimize decision trees for reinforcement learning do exist, they usually use greedy algorithms or they do not exploit the rewards given by the environment. This means that these techniques may easily get stuck in bad local optima. In this work, we propose a novel approach to interpretable reinforcement learning that uses decision trees. We use a two-level optimization approach that combines the advantages of evolutionary algorithms with the advantages of Q-learning. This way we decompose the problem in two sub-problems: the problem of finding a meaningful and useful decomposition of the state space, and the problem of associating an action to each state. We test our approach in three well-known reinforcement learning benchmarks and the results make our approach competitive with respect to the state of the art in both performance and interpretability. Finally, we perform an ablation study that confirms that using the two-level optimization approach gives us a boost in performance in non-trivial environments with respect to a one-layer optimization technique.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.