Interventional SHAP Values and Interaction Values for Piecewise Linear Regression Trees
Artjom Zern, Klaus Broelemann, Gjergji Kasneci
Abstract
In recent years, game-theoretic Shapley values have gained increasing attention with respect to local model explanation by feature attributions. While the approach using Shapley values is model-independent, their (exact) computation is usually intractable, so efficient model-specific algorithms have been devised including approaches for decision trees or their ensembles in general. Our work goes further in this direction by extending the interventional TreeSHAP algorithm to piecewise linear regression trees, which gained more attention in the past few years. To this end, we introduce a decomposition of the contribution function based on decision paths, which allows a more comprehensible formulation of SHAP algorithms for tree-based models. Our algorithm can also be readily applied to computing SHAP interaction values for these models. In particular, as the main contribution of this paper, we provide a more efficient approach of interventional SHAP for tree-based models by precomputing statistics of the background data based on the tree structure.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers9
- Beyond TreeSHAP: Efficient Computation of Any-Order Shapley Interactions for Tree EnsemblesMaximilian Muschalik, Fabian Fumagalli, Barbara Hammer, Eyke HüllermeierAAAI 2024 · 35 citations
- SHAP values via sparse Fourier representationAli Gorji, Andisheh Amrollahi, Andreas KrauseNeurIPS 2025 · 11 citations
- SHAP Meets Tensor Networks: Provably Tractable Explanations with ParallelismReda Marzouk, Shahaf Bassan, Guy KatzNeurIPS 2025 · 9 citations
- Exactly Computing do-Shapley ValuesR. Teal Witter, Álvaro Parafita, Tomas Garriga, Maximilian Muschalik et al.ICML 2026 · 3 citations
- Data-faithful Feature Attribution: Mitigating Unobservable Confounders via Instrumental VariablesQiheng Sun, Haocheng Xia, Jinfei LiuNeurIPS 2024 · 3 citations
Builds on5
- Algorithmic Transparency via Quantitative Input Influence: Theory and Experiments with Learning SystemsAnupam Datta, Shayak Sen, Yair ZickS&P 2016 · 774 citations
- Understanding Global Feature Contributions With Additive Importance MeasuresIan Covert, Scott M. Lundberg, Su-In LeeNeurIPS 2020 · 476 citations
- Problems with Shapley-value-based explanations as feature importance measuresI. Elizabeth Kumar, Suresh Venkatasubramanian, Carlos Scheidegger, Sorelle A. FriedlerICML 2020 · 458 citations
- FastSHAP: Real-Time Shapley Value EstimationNeil Jethani, Mukund Sudarshan, Ian Connick Covert, Su-In Lee et al.ICLR 2022 · 186 citations
- Dynamic Model Tree for Interpretable Data Stream LearningJohannes Haug, Klaus Broelemann, Gjergji KasneciICDE 2022 · 7 citations
Related papers
- Linear tree shapPeng Yu, Albert Bifet, Jesse Read, Chao XuNeurIPS 2022 · 27 citations
- Fast Estimation of Partial Dependence Functions using TreesJinyang Liu, Tessa Steensgaard, Marvin N. Wright, Niklas Pfister et al.ICML 2025
- From Decision Trees to Boolean Logic: A Fast and Unified SHAP AlgorithmAlexander Nadel, Ron WettensteinAAAI 2026 · 1 citation
- Regression-adjusted Monte Carlo Estimators for Shapley Values and Probabilistic ValuesR. Teal Witter, Yurong Liu, Christopher MuscoNeurIPS 2025 · 22 citations
- Support Vector-based Estimation of Multilinear Games for Feature Selection and ExplanationMajid Mohammadi, Ilaria Tiddi, Annette ten TeijeAAAI 2025 · 1 citation
