REVIEW 2 cited by
InstaSHAP: Interpretable Additive Models Explain Shapley Values Instantly
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
InstaSHAP: Interpretable Additive Models Explain Shapley Values Instantly
read the original abstract
In recent years, the Shapley value and SHAP explanations have emerged as one of the most dominant paradigms for providing post-hoc explanations of black-box models. Despite their well-founded theoretical properties, many recent works have focused on the limitations in both their computational efficiency and their representation power. The underlying connection with additive models, however, is left critically under-emphasized in the current literature. In this work, we find that a variational perspective linking GAM models and SHAP explanations is able to provide deep insights into nearly all recent developments. In light of this connection, we borrow in the other direction to develop a new method to train interpretable GAM models which are automatically purified to compute the Shapley value in a single forward pass. Finally, we provide theoretical results showing the limited representation power of GAM models is the same Achilles' heel existing in SHAP and discuss the implications for SHAP's modern usage in CV and NLP.
Forward citations
Cited by 2 Pith papers
-
Cross-seed explainability using Procrustes-conditioned Joint End-to-end Top-K Sparse Autoencoders
Procrustes-conditioned joint End-to-end Top-K SAEs recover more cross-seed universal features (r≥0.70) from independent BERT seeds than post-hoc alignment baselines on three NLP datasets.
-
Tractable Shapley Values and Interactions via Tensor Networks
TN-SHAP extracts exact Shapley values and k-way interactions of a multilinear tensor-network surrogate from O(n) probe evaluations, replacing O(2^n) coalition enumeration.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.