Pith. sign in

REVIEW 11 cited by

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 1605.01713 v3 pith:SIKYJ5EG submitted 2016-05-05 cs.LG cs.CVcs.NE

Not Just a Black Box: Learning Important Features Through Propagating Activation Differences

classification cs.LG cs.CVcs.NE
keywords deepliftactivationblackfeaturesimportantlearningneuralscores
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Note: This paper describes an older version of DeepLIFT. See https://arxiv.org/abs/1704.02685 for the newer version. Original abstract follows: The purported "black box" nature of neural networks is a barrier to adoption in applications where interpretability is essential. Here we present DeepLIFT (Learning Important FeaTures), an efficient and effective method for computing importance scores in a neural network. DeepLIFT compares the activation of each neuron to its 'reference activation' and assigns contribution scores according to the difference. We apply DeepLIFT to models trained on natural images and genomic data, and show significant advantages over gradient-based methods.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 11 Pith papers

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

  1. Manifold-Aligned Guided Integrated Gradients for Reliable Feature Attribution

    cs.LG 2026-05 unverdicted novelty 7.0

    MA-GIG uses VAE latent space to align Integrated Gradients paths with the data manifold for more faithful feature attributions in deep neural networks.

  2. From Local to Global to Mechanistic: An iERF-Centered Unified Framework for Interpreting Vision Models

    cs.CV 2026-05 unverdicted novelty 7.0

    An iERF-centric framework unifies local, global, and mechanistic interpretability in vision models via SRD for saliency, CAFE for concept anchoring, and ICAT for interlayer attribution.

  3. CALM: Interpretable Cross-Modal Alignment for Biomarker Discovery from Unpaired Data

    cs.LG 2026-07 unverdicted novelty 6.0

    CALM aligns unpaired neuroimaging and genetics data in a shared latent space via linear projections that match class-conditional distributions and ensure separability to discover interpretable ROI-pathway associations.

  4. Graph Neural Network based Hierarchy-Aware Embeddings of Knowledge Graphs: Applications to Yeast Phenotype Prediction

    cs.LG 2026-05 unverdicted novelty 6.0

    GNNs with ontology-derived semantic loss create hierarchy-aware box embeddings of a yeast knowledge graph that raise double-knockout growth prediction R² to 0.377 and generalize to triple knockouts while identifying a...

  5. Manifold-Aligned Guided Integrated Gradients for Reliable Feature Attribution

    cs.LG 2026-05 unverdicted novelty 6.0

    MA-GIG improves Integrated Gradients by performing path integration in the latent space of a pre-trained VAE so that decoded points remain closer to the learned data manifold and reduce off-manifold gradient noise.

  6. Causal Attribution via Activation Patching

    cs.CV 2026-03 unverdicted novelty 6.0

    CAAP produces patch attributions in ViTs by direct activation patching on intermediate layers to measure causal contribution to the target class score.

  7. Less is More: Efficient Black-box Attribution via Minimal Interpretable Subset Selection

    cs.LG 2025-04 unverdicted novelty 6.0

    LiMA reformulates attribution as submodular subset selection and uses bidirectional greedy search to identify minimal important regions, reporting 36.3% better insertion and 39.6% better deletion scores than prior met...

  8. CIExplainer++: Generating Causal and Interpretable Explanations for Graph Neural Networks

    cs.LG 2026-06 unverdicted novelty 5.0

    CIExplainer uses causal inference via the Potential Outcome Framework to find high-impact subgraphs for GNN explanations, with G2TeXplainer generating feature and relation-aware natural language descriptions.

  9. AnchorMoE: Interpretable Time Series Classification via Anchor-Routed MoE

    cs.LG 2026-06 unverdicted novelty 5.0

    AnchorMoE applies an anchor-routed MoE with geometric orthogonality and an uncertainty gate to deliver ante-hoc interpretable MTSC via additive decomposition over input segments.

  10. Graph Neural Network based Hierarchy-Aware Embeddings of Knowledge Graphs: Applications to Yeast Phenotype Prediction

    cs.LG 2026-05 unverdicted novelty 5.0

    GNNs with ontology-derived semantic loss create hierarchy-aware KG embeddings that predict yeast double gene knockout phenotypes with mean R²=0.360 (improved to 0.377 with semantic loss), outperforming baselines, gene...

  11. Heterogeneous Graph Neural Networks with Post-hoc Explanations for Multi-modal and Explainable Land Use Inference

    cs.AI 2024-06 unverdicted novelty 4.0

    Heterogeneous graph neural networks with post-hoc explanations improve accuracy on six land-use indicators from mobility data and provide feature attribution and counterfactual insights aligned with commuting patterns.