mlsanityData to 7 Oct 2026

A New Class of Explanations for Classifiers with Non-Binary Features

arXiv 2304.14760 ↗First posted 28 Apr 2023cs.AI cs.LG cs.LOcited by 8

Not on the map. Why?

Abstract (arXiv)

Two types of explanations have been receiving increased attention in the literature when analyzing the decisions made by classifiers. The first type explains why a decision was made and is known as a sufficient reason for the decision, also an abductive explanation or a PI-explanation. The second type explains why some other decision was not made and is known as a necessary reason for the decision, also a contrastive or counterfactual explanation. These explanations were defined for classifiers with binary, discrete and, in some cases, continuous features. We show that these explanations can be significantly improved in the presence of non-binary features, leading to a new class of explanations that relay more information about decisions and the underlying classifiers. Necessary and sufficient reasons were also shown to be the prime implicates and implicants of the complete reason for a decision, which can be obtained using a quantification operator. We show that our improved notions of necessary and sufficient reasons are also prime implicates and implicants but for an improved notion of complete reason obtained by a new quantification operator that we also define and study.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 21 of its 68 references that are in the map. First posted on arXiv 28 Apr 2023.

Builds on

21 of 68 references.

References · 21

  1. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  2. 2017Explanation in Artificial Intelligence: Insights from the Social Sciencescited by 1,201
  3. 2018Abduction-Based Explanations for Machine Learning Modelscited by 159
  4. 2018A Symbolic Approach to Explaining Bayesian Network Classifierscited by 130
  5. 2020On The Reasons Behind Decisionscited by 99
  6. 2017Verifying Properties of Binarized Deep Neural Networkscited by 77
  7. 2021On Explaining Random Forests with SATcited by 57
  8. 2022On Tackling Explanation Redundancy in Decision Treescited by 44
  9. 2021Explanations for Monotonic Classifierscited by 39
  10. 2020On Tractable Representations of Binary Neural Networkscited by 34
  11. 2019On Validating, Repairing and Refining Heuristic ML Explanationscited by 32
  12. 2022ASTERYX : A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanationscited by 26
9 more
  1. 2021Probabilistic Sufficient Explanationscited by 24
  2. 2022On the Computation of Necessary and Sufficient Explanationscited by 23
  3. 2022Computing Abductive Explanations for Boosted Treescited by 23
  4. 2021On Quantifying Literals in Boolean Logic and Its Applications to Explainable AIcited by 16
  5. 2020On Symbolically Encoding the Behavior of Random Forestscited by 15
  6. 2020On Relating 'Why?' and 'Why Not?' Explanationscited by 15
  7. 2021A unified logical framework for explanations in classifier systemscited by 15
  8. 2021Efficient Explanations for Knowledge Compilation Languagescited by 9
  9. 2023On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuitscited by 5

Built on by

Cited by year (2026 to 7 Oct)

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

8 papers.