Pith. sign in

REVIEW 8 cited by

Explainable AI for Trees: From Local Explanations to Global Understanding

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1905.04610 v1 pith:QIFEWB53 submitted 2019-05-11 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords localexplanationslearningmachinemodelmodelsglobalnon-linear
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Tree-based machine learning models such as random forests, decision trees, and gradient boosted trees are the most popular non-linear predictive models used in practice today, yet comparatively little attention has been paid to explaining their predictions. Here we significantly improve the interpretability of tree-based models through three main contributions: 1) The first polynomial time algorithm to compute optimal explanations based on game theory. 2) A new type of explanation that directly measures local feature interaction effects. 3) A new set of tools for understanding global model structure based on combining many local explanations of each prediction. We apply these tools to three medical machine learning problems and show how combining many high-quality local explanations allows us to represent global structure while retaining local faithfulness to the original model. These tools enable us to i) identify high magnitude but low frequency non-linear mortality risk factors in the general US population, ii) highlight distinct population sub-groups with shared risk characteristics, iii) identify non-linear interaction effects among risk factors for chronic kidney disease, and iv) monitor a machine learning model deployed in a hospital by identifying which features are degrading the model's performance over time. Given the popularity of tree-based machine learning models, these improvements to their interpretability have implications across a broad set of domains.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 8 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 263 citations worldwide. Full citation record

  1. Interpreting Multi-Branch Anti-Spoofing Architectures: Correlating Internal Strategy with Empirical Performance

    cs.SD 2026-02 unverdicted novelty 6.0 of 10

    A framework using covariance-based spectral signatures and TreeSHAP attributions on AASIST3 branches identifies four operational archetypes and a flawed specialization mode that explains high error rates on specific s...

  2. Robust Explanations Through Uncertainty Decomposition: A Path to Trustworthier AI

    cs.LG 2025-07 conditional novelty 6.0 of 10

    Aleatoric uncertainty selects between counterfactual and feature-importance explanations, epistemic uncertainty rejects unreliable explanations, and correlation experiments support the rule.

  3. Unifying Attribution-Based Explanations Using Functional Decomposition

    cs.LG 2024-12 reject novelty 6.0 of 10

    A unification framework for XAI attribution methods whose core canonical decomposition theorem fails because the components sum to the fully removed function rather than to the original function.

  4. Wavelet Scattering Transform for Interpretable Schizophrenia Biomarker Discovery and Classification from Resting-State EEG

    eess.SP 2026-07 conditional novelty 5.0 of 10

    A single sentence stating the discovery directly. ≤ 300 chars.

  5. Forma mentis networks predict creativity ratings of short texts via interpretable artificial intelligence in human and GPT-simulated raters

    cs.AI 2024-11 conditional novelty 5.0 of 10

    GPT-3.5's creativity ratings of short stories barely correlate with human ratings, and when scoring its own stories it leans on emotional features while humans lean on semantic network structure.

  6. Evaluating Machine Learning Models for Post-Wildfire Debris-Flow Prediction

    cs.LG 2026-08 conditional novelty 4.0 of 10

    TabPFN and top tree-based models reach threat scores of about 0.62 to 0.64 for post-wildfire debris-flow prediction, with rainfall intensity and storm accumulation the most important features, and synthetic data augme...

  7. Automating Credit Card Limit Adjustments Using Machine Learning

    cs.LG 2025-01 conditional novelty 4.0 of 10

    An XGBoost model with cost-sensitive learning reports Cohen's kappa of 0.81 against a bank committee's credit card limit decisions and is proposed to automate the process.

  8. Integrating Explainable AI for Effective Malware Detection in Encrypted Network Traffic

    cs.CR 2025-01 reject novelty 3.0 of 10

    An application of standard ensemble classifiers and SHAP to a private dataset reports >99% detection accuracy, but the evaluation may be leaky and no baselines are given.

Pith tools