Improving the Validity of Decision Trees as Explanations
Not on the map. Why?
Abstract (arXiv)
In classification and forecasting with tabular data, one often utilizes tree-based models. Those can be competitive with deep neural networks on tabular data and, under some conditions, explainable. The explainability depends on the depth of the tree and the accuracy in each leaf of the tree. We point out that decision trees containing leaves with unbalanced accuracy can provide misleading explanations. Low-accuracy leaves give less valid explanations, which could be interpreted as unfairness among subgroups utilizing these explanations. Here, we train a shallow tree with the objective of minimizing the maximum misclassification error across all leaf nodes. The shallow tree provides a global explanation, while the overall statistical performance of the shallow tree can become comparable to state-of-the-art methods (e.g., well-tuned XGBoost) by extending the leaves with further models.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 70 references that are in the map. First posted on arXiv 11 Jun 2023.
Builds on
22 of 70 references.
References · 22
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2019Explainable Artificial Intelligence (XAI): Concepts, Taxonomies, Opportunities and Challenges toward Responsible AIcited by 1,552
- 2021Revisiting Deep Learning Models for Tabular Datacited by 740
- 2019A Survey on Explainable Artificial Intelligence (XAI): Towards Medical XAIcited by 404
- 2021Interpretable Machine Learning: Fundamental Principles and 10 Grand Challengescited by 367
- 2015Recursive Partitioning for Heterogeneous Causal Effectscited by 255
- 2020A Survey on the Explainability of Supervised Machine Learningcited by 227
- 2019Optimal Sparse Decision Treescited by 105
- 2020Generalized and Scalable Optimal Sparse Decision Treescited by 100
- 2022Exploring the Whole Rashomon Set of Sparse Decision Treescited by 81
- 2018Boolean Decision Rules via Column Generationcited by 80
- 2019Machine Learning Methods Economists Should Know Aboutcited by 64
10 more
- 2020MurTree: Optimal Classification Trees via Dynamic Programming and Searchcited by 63
- 2017Interpreting Blackbox Models via Model Extractioncited by 44
- 2020Born-Again Tree Ensemblescited by 38
- 2020A Scalable MIP-based Method for Learning Optimal Multivariate Decision Treescited by 23
- 2022Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Featurescited by 20
- 2022Optimal Sparse Regression Treescited by 13
- 2020Learning Optimal Classification Trees: Strong Max-Flow Formulationscited by 11
- 2020Learning Binary Decision Trees by Argmin Differentiationcited by 11
- 2020A Formal Approach to Explainabilitycited by 9
- 2022Fairness in Forecasting of Observations of Linear Dynamical Systemscited by 4
Built on by
Not cited yet.