Towards trustable SHAP scores
Not on the map. Why?
Abstract (arXiv)
SHAP scores represent the proposed use of the well-known Shapley values in eXplainable Artificial Intelligence (XAI). Recent work has shown that the exact computation of SHAP scores can produce unsatisfactory results. Concretely, for some ML models, SHAP scores will mislead with respect to relative feature influence. To address these limitations, recently proposed alternatives exploit different axiomatic aggregations, all of which are defined in terms of abductive explanations. However, the proposed axiomatic aggregations are not Shapley values. This paper investigates how SHAP scores can be modified so as to extend axiomatic aggregations to the case of Shapley values in XAI. More importantly, the proposed new definition of SHAP scores avoids all the known cases where unsatisfactory results have been identified. The paper also characterizes the complexity of computing the novel definition of SHAP scores, highlighting families of classifiers for which computing these scores is tractable. Furthermore, the paper proposes modifications to the existing implementations of SHAP scores. These modifications eliminate some of the known limitations of SHAP scores, and have negligible impact in terms of performance.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 30 Apr 2024.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2024: 2.
2 papers.
- 2024SHAP scores fail pervasively even when Lipschitz succeedscited by 2
- 2024Efficient Contrastive Explanations on Demandcited by 1
- 2024Efficient Contrastive Explanations on Demand24 Dec 2024
- 2024SHAP scores fail pervasively even when Lipschitz succeeds18 Dec 2024