Quality–diversity optimization of decision trees for interpretable reinforcement learning
Open Access
- 14 November 2023
- journal article
- research article
- Published by Springer Nature in Neural Computing and Applications
- Vol. 37 (18) , 11681-11692
Abstract
In the current Artificial Intelligence (AI) landscape, addressing explainability and interpretability in Machine Learning (ML) is of critical importance. In fact, the vast majority of works on AI focus on Deep Neural Networks (DNNs), which are not interpretable, as they are extremely hard to inspect and understand for humans. This is a crucial disadvantage of these methods, which hinders their trustability in high-stakes scenarios. On the other hand, interpretable models are considerably easier to inspect, which allows humans to test them exhaustively, and thus trust them. While the fields of eXplainable Artificial Intelligence (XAI) and Interpretable Artificial Intelligence (IAI) are progressing in supervised settings, the field of Interpretable Reinforcement Learning (IRL) is falling behind. Several approaches leveraging Decision Trees (DTs) for IRL have been proposed in recent years. However, all of them use goal-directed optimization methods, which may have limited exploration capabilities. In this work, we extend a previous study on the applicability of Quality–Diversity (QD) algorithms to the optimization of DTs for IRL. We test the methods on two well-known Reinforcement Learning (RL) benchmark tasks from OpenAI Gym, comparing their results in terms of score and “illumination” patterns. We show that using QD algorithms is an effective way to explore the search space of IRL models. Moreover, we find that, in the context of DTs for IRL, QD approaches based on MAP-Elites (ME) and its variant Covariance Matrix Adaptation MAP-Elites (CMA-ME) can significantly improve convergence speed over the goal-directed approaches.Keywords
Funding Information
- HORIZON EUROPE European Innovation Council (101071179)
- Università degli Studi di Trento
This publication has 28 references indexed in Scilit:
- Explainable Artificial Intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AIInformation Fusion, 2020
- Qualitative Measurements of Policy Discrepancy for Return-Based Deep Q-NetworkIEEE Transactions on Neural Networks and Learning Systems, 2019
- Increasing trust in meta-heuristics by using MAP-elites2019
- Stop explaining black box machine learning models for high stakes decisions and use interpretable models insteadNature Machine Intelligence, 2019
- Peeking Inside the Black-Box: A Survey on Explainable Artificial Intelligence (XAI)IEEE Access, 2018
- A Survey of Methods for Explaining Black Box ModelsACM Computing Surveys, 2018
- Using Centroidal Voronoi Tessellations to Scale Up the Multidimensional Archive of Phenotypic Elites AlgorithmIEEE Transactions on Evolutionary Computation, 2017
- Quality and Diversity Optimization: A Unifying Modular FrameworkIEEE Transactions on Evolutionary Computation, 2017
- Novelty Search and the Problem with Objectives2011
- Grammatical evolution: Evolving programs for an arbitrary language1998