Rigorous Feature Importance Scores based on Shapley Value and Banzhaf Index
Not on the map. Why?
Abstract (arXiv)
Feature attribution methods based on game theory are ubiquitous in the field of eXplainable Artificial Intelligence (XAI). Recent works proposed rigorous feature attribution using logic-based explanations, specifically targeting high-stakes uses of machine learning (ML) models. Typically, such works exploit weak abductive explanation (WAXp) as the characteristic function to assign importance to features. However, one possible downside is that the contribution of non-WAXp sets is neglected. In fact, non-WAXp sets can also convey important information, because of the relationship between formal explanations (XPs) and adversarial examples (AExs). Accordingly, this paper leverages Shapley value and Banzhaf index to devise two novel feature importance scores. We take into account non-WAXp sets when computing feature contribution, and the novel scores quantify how effective each feature is at excluding AExs. Furthermore, the paper identifies properties and studies the computational complexity of the proposed scores.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 28 of its 61 references that are in the map. First posted on arXiv 16 Aug 2025.
Builds on
28 of 61 references.
References · 28
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2013Intriguing properties of neural networkscited by 5,155
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
- 2017Axiomatic Attribution for Deep Networkscited by 3,384
- 2017Explanation in Artificial Intelligence: Insights from the Social Sciencescited by 1,206
- 2019The many Shapley values for model explanationcited by 344
- 2020Problems with Shapley-value-based explanations as feature importance measurescited by 200
- 2019Feature relevance quantification in explainable AI: A causal problemcited by 167
- 2017PMLB: A Large Benchmark Suite for Machine Learning Evaluation and Comparisoncited by 140
- 2019Asymmetric Shapley values: incorporating causal knowledge into model-agnostic explainabilitycited by 114
16 more
- 2018L-Shapley and C-Shapley: Efficient Model Interpretation for Structured Datacited by 100
- 2020On the Tractability of SHAP Explanationscited by 92
- 2020Model Interpretability through the Lens of Computational Complexitycited by 75
- 2023First Three Years of the International Verification of Neural Networks Competition (VNN-COMP)cited by 58
- 2021Shapley values for feature selection: The good, the bad, and the axiomscited by 54
- 2021On Efficiently Explaining Graph-Based Classifierscited by 37
- 2021On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Resultscited by 32
- 2022VeriX: Towards Verified Explainability of Deep Neural Networkscited by 30
- 2023Logic for Explainable AIcited by 23
- 2023Explainability is NOT a Gamecited by 23
- 2021Counterfactual Shapley Additive Explanationscited by 22
- 2021Rational Shapley Valuescited by 18
- 2020High Dimensional Model Explanations: an Axiomatic Approachcited by 13
- 2023Axiomatic Aggregations of Abductive Explanationscited by 10
- 2023Anytime Approximate Formal Feature Attributioncited by 9
- 2017Feature importance scores and lossless feature pruning using Banzhaf power indicescited by 3
Built on by
Not cited yet.