Feature Attribution with Necessity and Sufficiency via Dual-stage Perturbation Test for Causal Explanation
Not on the map. Why?
Abstract (arXiv)
We investigate the problem of explainability for machine learning models, focusing on Feature Attribution Methods (FAMs) that evaluate feature importance through perturbation tests. Despite their utility, FAMs struggle to distinguish the contributions of different features, when their prediction changes are similar after perturbation. To enhance FAMs' discriminative power, we introduce Feature Attribution with Necessity and Sufficiency (FANS), which find a neighborhood of the input such that perturbing samples within this neighborhood have a high Probability of being Necessity and Sufficiency (PNS) cause for the change in predictions, and use this PNS as the importance of the feature. Specifically, FANS compute this PNS via a heuristic strategy for estimating the neighborhood and a perturbation test involving two stages (factual and interventional) for counterfactual reasoning. To generate counterfactual samples, we use a resampling-based approach on the observed samples to approximate the required conditional distribution. We demonstrate that FANS outperforms existing attribution methods on six benchmarks. Please refer to the source code via urlhttps://github.com/DMIRLAB-Group/FANS.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 29 of its 46 references that are in the map. First posted on arXiv 13 Feb 2024.
Builds on
29 of 46 references.
References · 29
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2017Axiomatic Attribution for Deep Networkscited by 3,350
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,348
- 2013Visualizing and Understanding Convolutional Networkscited by 2,278
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2014Striving for Simplicity: The All Convolutional Netcited by 983
- 2019GNNExplainer: Generating Explanations for Graph Neural Networkscited by 735
- 2017Interpretable Explanations of Black Boxes by Meaningful Perturbationcited by 611
17 more
- 2020Captum: A unified and generic model interpretability library for PyTorchcited by 542
- 2020Parameterized Explainer for Graph Neural Networkcited by 423
- 2019On the (In)fidelity and Sensitivity for Explanationscited by 309
- 2022Quantus: An Explainable AI Toolkit for Responsible Evaluation of Neural Network Explanations and Beyondcited by 171
- 2018Visual Interpretability for Deep Learning: a Surveycited by 155
- 2021CF-GNNExplainer: Counterfactual Explanations for Graph Neural Networkscited by 118
- 2022Learning and Evaluating Graph Neural Network Explanations based on Counterfactual and Factual Reasoningcited by 78
- 2022GraphFramEx: Towards Systematic Evaluation of Explainability Methods for Graph Neural Networkscited by 57
- 2021Explaining Black-Box Algorithms Using Probabilistic Contrastive Counterfactualscited by 55
- 2021Robust Explainability: A Tutorial on Gradient-Based Attribution Methods for Deep Neural Networkscited by 48
- 2020IROF: a low resource evaluation metric for explanation methodscited by 45
- 2021Local Explanations via Necessity and Sufficiency: Unifying Theory and Practicecited by 45
- 2021Causes of Effects: Learning individual responses from population datacited by 36
- 2023Invariant Learning via Probability of Sufficient and Necessary Causescited by 22
- 2023MixupExplainer: Generalizing Explanations for Graph Neural Networks with Data Augmentationcited by 18
- 2023IDGI: A Framework to Eliminate Explanation Noise from Integrated Gradientscited by 16
- 2022On the Probability of Necessity and Sufficiency of Explaining Graph Neural Networks: A Lower Bound Optimization Approachcited by 11
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 4.
6 papers.
- 2024Unifying Invariant and Variant Features for Graph Out-of-Distribution via Probability of Necessity and Sufficiencycited by 2
- 2025ARM-Explainer -- Explaining and improving graph neural network predictions for the maximum clique problem using node features and association rule miningcited by 0
- 2026Explaining Synergistic Effects in Social Recommendationscited by 0
- 2026The Compressive Knowledge Graph Hypothesis: Which Graph Facts Matter for Scientific Hypothesis Generation?cited by 0
- 2026Feature Attribution in Directed Acyclic Graphs Using Edge Interventioncited by 0
- 2026Regional Explanations via Causal Sufficiency and Necessitycited by 0
- 2026Regional Explanations via Causal Sufficiency and Necessity16 Sep 2026
- 2026Feature Attribution in Directed Acyclic Graphs Using Edge Intervention13 Jun 2026
- 2026The Compressive Knowledge Graph Hypothesis: Which Graph Facts Matter for Scientific Hypothesis Generation?26 May 2026
- 2026Explaining Synergistic Effects in Social Recommendations26 Jan 2026
- 2025ARM-Explainer -- Explaining and improving graph neural network predictions for the maximum clique problem using node features and association rule mining28 Nov 2025
- 2024Unifying Invariant and Variant Features for Graph Out-of-Distribution via Probability of Necessity and Sufficiency21 Jul 2024