paper-with-me

Papers

Improving the Validity of Decision Trees as Explanations

2023-06-11 · Jiri Nemecek, Tomas Pevny, Jakub Marecek

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.

📄 PDF Abstract BibTeX arXiv:2306.06777

Code (1)

Epanemu/FCT 공식 구현

Tasks

valid

Similar Papers 제목 키워드 기반

On Tackling Explanation Redundancy in Decision Trees

2022-05-20 · Yacine Izza, Alexey Ignatiev, Joao Marques-Silva

Decision trees (DTs) epitomize the ideal of interpretability of machine learning (ML) models. The interpretability of decision trees motivates explainability approaches by so-called intrinsic interpretability, and it is …

BELLATREX: Building Explanations through a LocaLly AccuraTe Rule EXtractor

2022-03-29 · Klest Dedja, Felipe Kenji Nakano, Konstantinos Pliakos, Celine Vens

Tree-ensemble algorithms, such as random forest, are effective machine learning methods popular for their flexibility, high performance, and robustness to overfitting. However, since multiple learners are combined, they …

Binary ClassificationMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATION

Succinct Explanations With Cascading Decision Trees

2020-10-13 · Jialu Zhang, Yitan Wang, Mark Santolucito, Ruzica Piskac

The decision tree is one of the most popular and classical machine learning models from the 1980s. However, in many practical applications, decision trees tend to generate decision paths with excessive depth. Long decisi…

ClassificationGeneral ClassificationMissing Values

On Efficiently Explaining Graph-Based Classifiers

2021-06-02 · Xuanxiang Huang, Yacine Izza, Alexey Ignatiev, Joao Marques-Silva

Recent work has shown that not only decision trees (DTs) may not be interpretable but also proposed a polynomial-time algorithm for computing one PI-explanation of a DT. This paper shows that for a wide range of classifi…

Trepan Reloaded: A Knowledge-driven Approach to Explaining Artificial Neural Networks

2019-06-19 · Roberto Confalonieri, Tillman Weyde, Tarek R. Besold, Fermín Moscoso del Prado Martín

Explainability in Artificial Intelligence has been revived as a topic of active research by the need of conveying safety and trust to users in the `how' and `why' of automated decision-making. Whilst a plethora of approa…

Decision MakingInterpretable Machine Learning