Improving the Validity of Decision Trees as Explanations
Jiri Nemecek, Tomas Pevny, Jakub Marecek
TL;DR
This work addresses the validity of decision-tree explanations by focusing on leaf-level accuracy. It introduces a mixed-integer optimization framework that trains shallow trees to maximize the minimum leaf accuracy $A_L(T)$, yielding globally interpretable rules with improved fairness signals. A secondary step extends nonempty leaves with per-leaf models (notably XGBoost) to form a hybrid-tree whose accuracy approaches state-of-the-art methods while maintaining a global explanation. Empirically, leaf-accuracy gains of about 7 percentage points on tabular benchmarks are demonstrated, and statistical tests confirm significant improvements over CART, with hybrid-tree variants achieving competitive performance relative to XGBoost. This approach offers a principled, expandable path toward explanations that remain valid across subgroups while preserving practical predictive power on tabular data.
Abstract
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.
