Cited by 42Explainable Artificial Intelligence (XAI)Logic, Reasoning, and KnowledgeData Mining Algorithms and Applications

Abduction-Based Explanations for Machine Learning Models

Open access
Ignatiev, Alexey, Narodytska, Nina, Marques-Silva, Joao·2019·Proceedings of the AAAI Conference on Artificial Intelligence

Abstract

The growing range of applications of Machine Learning (ML) in a multitude of settings motivates the ability of computing small explanations for predictions made. Small explanations are generally accepted as easier for human decision makers to understand. Most earlier work on computing explanations is based on heuristic approaches, providing no guarantees of quality, in terms of how close such solutions are from cardinality- or subset-minimal explanations. This paper develops a constraint-agnostic solution for computing explanations for any ML model. The proposed solution exploits abductive reasoning, and imposes the requirement that the ML model can be represented as sets of constraints using some target constraint reasoning system for which the decision problem can be answered with some oracle. The experimental results, obtained on well-known datasets, validate the scalability of the proposed approach as well as the quality of the computed solutions.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1609/aaai.v33i01.33011511

Cites

44 of 44 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Examples of compactness metrics include the number of features in an explanation, average path length in a decision tree, reduction with respect to the complete data sample, and the number of decision rules in a set.

    “Examples include: the number of features in an explanation (e.g., [54,109,192,204,223,265]), average path length in a decision tree (e.g., [135,276,277]), reduction w.r.t.complete data sample (e.g., [7,33,109]), or the number of decision rules in a set (e.g., [137,144,203,223,266,302]).”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. Angelino, E.; Larus-Stone, N.; Alabi, D.; Seltzer, M.; and Rudin, C. 2017. Learning certifiably optimal rule lists. In KDD, 35-44.
  2. Biere, A.; Heule, M.; van Maaren, H.; and Walsh, T., eds. 2009. Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press.
  3. Gario, M., and Micheli, A. 2015. PySMT: a solver-agnostic library for fast prototyping of SMT-based algorithms. In SMT Workshop.
  4. Ruan, W.; Huang, X.; and Kwiatkowska, M. 2018. Reach- ability analysis of deep neural networks with provable guar- antees. In IJCAI, 2651-2659.

Cited by

Sorted by citations

Authors
Ignatiev, A., Narodytska, N., & Marques-Silva, J.
Affiliations
  • University of Lisbon (PT)
  • VMware (United States) (US)
Venue
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2019-07-17
Volume
33
Issue
01
Pages
1511-1519
ISSN
  • 2159-5399 (ISSN-L)
  • 2374-3468
OpenAlex
W2902934778
Cited by
40
References
43
Citations by year
2025: 1 · 2024: 3 · 2023: 14 · 2022: 13 · 2021: 7 · 2020: 2
FWCI
2.10
Type
conference paper
Language
en
Open access
Locations
  • Proceedings of the AAAI Conference on Artificial Intelligence (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
Fundação para a Ciência e a Tecnologia (01-0145, PTDC/CCI-COM/29300/2017, /2017, SFRH/BPD/120315/2016, CEECIND/04549/2017/CP1387/CT0037, LISBOA-01-0145-FEDER)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
Keywords
abductive reasoning, constraint-based reasoning, minimal explanations, explainable machine learning

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review