Pith. sign in

REVIEW 1 cited by

The Explanation Game: Explaining Machine Learning Models Using Shapley Values

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 1909.08128 v3 pith:XPKKN3LM submitted 2019-09-17 cs.LG cs.AIstat.ML

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

A number of techniques have been proposed to explain a machine learning model's prediction by attributing it to the corresponding input features. Popular among these are techniques that apply the Shapley value method from cooperative game theory. While existing papers focus on the axiomatic motivation of Shapley values, and efficient techniques for computing them, they offer little justification for the game formulations used, and do not address the uncertainty implicit in their methods' outputs. For instance, the popular SHAP algorithm's formulation may give substantial attributions to features that play no role in the model. In this work, we illustrate how subtle differences in the underlying game formulations of existing methods can cause large differences in the attributions for a prediction. We then present a general game formulation that unifies existing methods, and enables straightforward confidence intervals on their attributions. Furthermore, it allows us to interpret the attributions as contrastive explanations of an input relative to a distribution of reference inputs. We tie this idea to classic research in cognitive psychology on contrastive explanations, and propose a conceptual framework for generating and interpreting explanations for ML models, called formulate, approximate, explain (FAE). We apply this framework to explain black-box models trained on two UCI datasets and a Lending Club dataset.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. 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.

Pith tools