返回
A Novel Tree-Based Method for Interpretable Reinforcement Learning
DOI:10.1145/3695464.png)
摘要
En 中文
Deep reinforcement learning (DRL) has garnered remarkable success across various domains, propelled by advancements in deep learning (DL) technologies. However, the opacity of DL presents significant challenges, limiting the application of DRL in critical systems. In response, decision tree (DT)-based methods, known for their transparent decision-making mechanisms, have shown promise in making interpretable policies for decision-making problems. Existing methods often employ differential DTs to model RL policies and discretize them to conventional DTs for higher interpretability. Yet, this method leads to discrepancies between the trained differential DTs and the discretized DTs. To address this issue, we introduce Generative Consistent Trees (GCTs), a novel solution that circumvents the information loss typically associated with the argmax operation in prior research. By implementing a reparameterization technique to approximate the categorical distribution, GCTs ensure the consistencies between trained GCTs and discretized counterparts. Moreover, we have developed an imitation learning-based framework for interpretable reinforcement learning. This framework is designed to train GCTs by efficiently mimicking expert policies. Our extensive experiments across multiple environments have validated the effectiveness of this approach, highlighting the potential of GCTs in enhancing the interpretability and applicability of DRL.
Keyword:
Interpretable reinforcement learning
decision tree
decision-making
期刊
IF:
4.8
论文数:
1.3K
被引数:
4.4K
机构
引用论文
Neighbourhood analysis of competition between two Namaqualand ephemeral plant species两种Namaqualand短命植物种间竞争的邻域分析
A Model-Agnostic Approach to Mitigate Gradient Interference for Multi-Task Learning一种用于减轻多任务学习的梯度干扰的模型不可知方法
Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead停止解释高风险决策的黑盒机器学习模型,而改用可解释的模型

