CDT: Cascading Decision Trees For Explainable Reinforcement Learning

Abstract

Deep Reinforcement Learning (DRL) has recently achieved significant advances in various domains. However, explaining the policy of RL agents still remains an open problem due to several factors, one being the complexity of explaining neural networks decisions. Recently, a group of works have used decision-tree-based models to learn explainable policies. Soft decision trees (SDTs) and discretized differentiable decision trees (DDTs) have been demonstrated to achieve both good performance and share the benefit of having explainable policies. In this work, we further improve the results for tree-based explainable RL in both performance and explainability. Our proposal, Cascading Decision Trees (CDTs) apply representation learning on the decision path to allow richer expressivity. Empirical results show that in both situations, where CDTs are used as policy function approximators or as imitation learners to explain black-box policies, CDTs can achieve better performances with more succinct

Stats

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

Related papers

• Optimizing Interpretable Decision Tree Policies For Reinforcement Learning (2024)0.00
• Explainability In Deep Reinforcement Learning, A Review Into Current Methods And Applications (2022)12.33
• Causal State Distillation For Explainable Reinforcement Learning (2023)0.00
• "so, Tell Me About Your Policy...": Distillation Of Interpretable Policies From Deep Reinforcement Learning Agents (2025)0.00
• Reccover: Detecting Causal Confusion For Explainable Reinforcement Learning (2022)0.00
• Toward Interpretable Deep Reinforcement Learning With Linear Model U-trees (2018)13.05
• RGMDT: Return-gap-minimizing Decision Tree Extraction In Non-euclidean Metric Space (2024)0.00
• Mixrts: Toward Interpretable Multi-agent Reinforcement Learning Via Mixing Recurrent Soft Decision Trees (2022)7.16