mlsanityData to 14 Oct 2026

Axiomatic Aggregations of Abductive Explanations

arXiv 2310.03131 ↗First posted 29 Sep 2023cs.AIcited by 10

Not on the map. Why?

Abstract (arXiv)

The recent criticisms of the robustness of post hoc model approximation explanation methods (like LIME and SHAP) have led to the rise of model-precise abductive explanations. For each data point, abductive explanations provide a minimal subset of features that are sufficient to generate the outcome. While theoretically sound and rigorous, abductive explanations suffer from a major issue -- there can be several valid abductive explanations for the same data point. In such cases, providing a single abductive explanation can be insufficient; on the other hand, providing all valid abductive explanations can be incomprehensible due to their size. In this work, we solve this issue by aggregating the many possible abductive explanations into feature importance scores. We propose three aggregation methods: two based on power indices from cooperative game theory and a third based on a well-known measure of causal strength. We characterize these three methods axiomatically, showing that each of them uniquely satisfies a set of desirable properties. We also evaluate them on multiple datasets and show that these explanations are robust to the attacks that fool SHAP and LIME.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 22 of its 43 references that are in the map. First posted on arXiv 29 Sep 2023.

Builds on

22 of 43 references.

References · 22

  1. 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
  2. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
  3. 2017Axiomatic Attribution for Deep Networkscited by 3,384
  4. 2019Fooling LIME and SHAP: Adversarial Attacks on Post hoc Explanation Methodscited by 443
  5. 2019The many Shapley values for model explanationcited by 344
  6. 2018Abduction-Based Explanations for Machine Learning Modelscited by 160
  7. 2018A Symbolic Approach to Explaining Bayesian Network Classifierscited by 131
  8. 2019The Hidden Assumptions Behind Counterfactual Explanations and Principal Reasonscited by 115
  9. 2019Asymmetric Shapley values: incorporating causal knowledge into model-agnostic explainabilitycited by 114
  10. 2020Deep Learning for Financial Applications : A Surveycited by 91
  11. 2020Secure and Robust Machine Learning for Healthcare: A Surveycited by 80
  12. 2020Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delaycited by 57
10 more
  1. 2021Explaining Black-Box Algorithms Using Probabilistic Contrastive Counterfactualscited by 55
  2. 2021Local Explanations via Necessity and Sufficiency: Unifying Theory and Practicecited by 45
  3. 2021Explanations for Monotonic Classifierscited by 39
  4. 2022On Computing Probabilistic Explanations for Decision Treescited by 35
  5. 2019On Validating, Repairing and Refining Heuristic ML Explanationscited by 32
  6. 2023The Inadequacy of Shapley Values for Explainabilitycited by 31
  7. 2022On Computing Probabilistic Abductive Explanationscited by 18
  8. 2020High Dimensional Model Explanations: an Axiomatic Approachcited by 13
  9. 2023On Formal Feature Attribution and Its Approximationcited by 11
  10. 2023A Unifying Formal Approach to Importance Values in Boolean Functionscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 3; 2025: 6; 2026: 1.

10 papers.