Pith. sign in

REVIEW 3 cited by

Shapley explainability on the data manifold

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 2006.01272 v4 pith:OYVBC3U3 submitted 2020-06-01 cs.LG cs.AIstat.ML

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

Explainability in AI is crucial for model development, compliance with regulation, and providing operational nuance to predictions. The Shapley framework for explainability attributes a model's predictions to its input features in a mathematically principled and model-agnostic way. However, general implementations of Shapley explainability make an untenable assumption: that the model's features are uncorrelated. In this work, we demonstrate unambiguous drawbacks of this assumption and develop two solutions to Shapley explainability that respect the data manifold. One solution, based on generative modelling, provides flexible access to data imputations; the other directly learns the Shapley value-function, providing performance and stability at the cost of flexibility. While "off-manifold" Shapley values can (i) give rise to incorrect explanations, (ii) hide implicit model dependence on sensitive attributes, and (iii) lead to unintelligible explanations in higher-dimensional data, on-manifold explainability overcomes these problems.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. From Baselines to Transport Geodesics: Axiomatic Attribution via Optimal Generative Flows

    cs.LG 2026-03 unverdicted novelty 7.0 of 10

    Transport-geodesic attribution via optimal generative flows selects principled paths for feature attributions by minimizing kinetic action.

  2. Causal SHAP: Feature Attribution with Dependency Awareness through Causal Discovery

    cs.LG 2025-08 conditional novelty 5.0 of 10

    Causal SHAP replaces SHAP's independence assumption with a PC-discovered causal graph and IDA-derived causal strengths, zeroing out features that are correlated but not causal.

  3. Interpret Policies in Deep Reinforcement Learning using SILVER with RL-Guided Labeling: A Model-level Approach to High-dimensional and Multi-action Environments

    cs.LG 2025-10 reject novelty 4.0 of 10

    SILVER with RL-guided labeling: SHAP plus clustering plus policy-query labels plus decision trees or regression to interpret multi-action Atari policies.

Pith tools