Pith. sign in

REVIEW 2 cited by

Shapley Explanation Networks

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 2104.02297 v1 pith:J6HCXAID submitted 2021-04-06 cs.LG cs.AI

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

Shapley values have become one of the most popular feature attribution explanation methods. However, most prior work has focused on post-hoc Shapley explanations, which can be computationally demanding due to its exponential time complexity and preclude model regularization based on Shapley explanations during training. Thus, we propose to incorporate Shapley values themselves as latent representations in deep models thereby making Shapley explanations first-class citizens in the modeling paradigm. This intrinsic explanation approach enables layer-wise explanations, explanation regularization of the model during training, and fast explanation computation at test time. We define the Shapley transform that transforms the input into a Shapley representation given a specific function. We operationalize the Shapley transform as a neural network module and construct both shallow and deep networks, called ShapNets, by composing Shapley modules. We prove that our Shallow ShapNets compute the exact Shapley values and our Deep ShapNets maintain the missingness and accuracy properties of Shapley values. We demonstrate on synthetic and real-world datasets that our ShapNets enable layer-wise Shapley explanations, novel Shapley regularizations during training, and fast computation while maintaining reasonable performance. Code is available at https://github.com/inouye-lab/ShapleyExplanationNetworks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Decoupled Functional Evaluation of Autonomous Driving Models via Feature Map Quality Scoring

    cs.CV 2025-08 reject novelty 4.0 of 10

    A CLIP-based network predicts a feature-map score defined as 80% NDS ratio plus 20% similarity to SOTA features; using it as an auxiliary loss gives a 3.89% average NDS gain on BEVFormer.

  2. SHAP-Guided Regularization in Machine Learning Models

    cs.LG 2025-07 reject novelty 4.0 of 10

    A SHAP entropy and stability regularization for LightGBM is proposed, with small aggregate accuracy gains but no algorithm details or error bars.

Pith tools