mlsanityData to 7 Oct 2026

The Distributional Uncertainty of the SHAP score in Explainable Machine Learning

arXiv 2401.12731 ↗First posted 23 Jan 2024cs.AI cs.LG cs.LOcited by 1

Not on the map. Why?

Abstract (arXiv)

Attribution scores reflect how important the feature values in an input entity are for the output of a machine learning model. One of the most popular attribution scores is the SHAP score, which is an instantiation of the general Shapley value used in coalition game theory. The definition of this score relies on a probability distribution on the entity population. Since the exact distribution is generally unknown, it needs to be assigned subjectively or be estimated from data, which may lead to misleading feature scores. In this paper, we propose a principled framework for reasoning on SHAP scores under unknown entity population distributions. In our framework, we consider an uncertainty region that contains the potential distributions, and the SHAP score of a feature becomes a function defined over this region. We study the basic problems of finding maxima and minima of this function, which allows us to determine tight ranges for the SHAP scores of all features. In particular, we pinpoint the complexity of these problems, and other related ones, showing them to be NP-complete. Finally, we present experiments on a real-world dataset, showing that our framework may contribute to a more robust feature scoring.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 34 references that are in the map. First posted on arXiv 23 Jan 2024.

Builds on

12 of 34 references.

References · 12

  1. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  2. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  3. 2017Learning Important Features Through Propagating Activation Differencescited by 1,454
  4. 2018On the Robustness of Interpretability Methodscited by 310
  5. 2020Reliable Post hoc Explanations: Modeling Uncertainty in Explainabilitycited by 125
  6. 2020On the Tractability of SHAP Explanationscited by 92
  7. 2020Model Interpretability through the Lens of Computational Complexitycited by 75
  8. 2021On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Resultscited by 32
  9. 2020Causality-based Explanation of Classification Outcomescited by 25
  10. 2020Declarative Approaches to Counterfactual Explanations for Classificationcited by 14
  11. 2023From Robustness to Explainability and Back Againcited by 14
  12. 2023Efficient Computation of Shap Explanation Scores for Neural Network Classifiers via Knowledge Compilationcited by 3

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.