PDD-SHAP: Fast Approximations for Shapley Values using Functional Decomposition
Not on the map. Why?
Abstract (arXiv)
Because of their strong theoretical properties, Shapley values have become very popular as a way to explain predictions made by black box models. Unfortuately, most existing techniques to compute Shapley values are computationally very expensive. We propose PDD-SHAP, an algorithm that uses an ANOVA-based functional decomposition model to approximate the black-box model being explained. This allows us to calculate Shapley values orders of magnitude faster than existing methods for large datasets, significantly reducing the amortized cost of computing Shapley values when many predictions need to be explained.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 6 of its 20 references that are in the map. First posted on arXiv 26 Aug 2022.
Builds on
6 of 20 references.
References · 6
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
- 2018Consistent Individualized Feature Attribution for Tree Ensemblescited by 285
- 2019The Shapley Taylor Interaction Indexcited by 143
- 2021FastSHAP: Real-Time Shapley Value Estimationcited by 125
- 2021Sampling Permutations for Shapley Value Estimationcited by 102
- 2019Explainable AI for Trees: From Local Explanations to Global Understandingcited by 65
Built on by
Citing papers per year: 2024: 1.
1 paper.
- 2024Function Trees: Transparent Machine Learningcited by 1
- 2024Function Trees: Transparent Machine Learning19 Mar 2024