From Contrastive to Abductive Explanations and Back Again

被引:36
作者
Ignatiev, Alexey [1 ]
Narodytska, Nina [2 ]
Asher, Nicholas [3 ]
Marques-Silva, Joao [3 ]
机构
[1] Monash Univ, Melbourne, Australia
[2] VMware Res, Palo Alto, CA 94103 USA
[3] CNRS, IRIT, Toulouse, France
来源
AIXIA 2020 - ADVANCES IN ARTIFICIAL INTELLIGENCE | 2021年 / 12414卷
关键词
MINIMAL UNSATISFIABLE SUBSETS; EXPLAINING EXPLANATION; DIAGNOSIS; SETS;
D O I
10.1007/978-3-030-77091-4_21
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Explanations of Machine Learning (ML) models often address a `Why?' question. Such explanations can be related with selecting feature-value pairs which are sufficient for the prediction. Recent work has investigated explanations that address a `Why Not?' question, i.e. finding a change of feature values that guarantee a change of prediction. Given their goals, these two forms of explaining predictions of ML models appear to be mostly unrelated. However, this paper demonstrates otherwise, and establishes a rigorous formal relationship between `Why?' and `Why Not?' explanations. Concretely, the paper proves that, for any given instance, `Why?' explanations are minimal hitting sets of `Why Not?' explanations and vice-versa. Furthermore, the paper devises novel algorithms for extracting and enumerating both forms of explanations.
引用
收藏
页码:335 / 355
页数:21
相关论文
共 78 条
  • [1] Achinstein P, 1980, NATURE EXPLANATION
  • [2] Peeking Inside the Black-Box: A Survey on Explainable Artificial Intelligence (XAI)
    Adadi, Amina
    Berrada, Mohammed
    [J]. IEEE ACCESS, 2018, 6 : 52138 - 52160
  • [3] A Bibliometric Analysis of the Explainable Artificial Intelligence Research Field
    Alonso, Jose M.
    Castiello, Ciro
    Mencar, Corrado
    [J]. INFORMATION PROCESSING AND MANAGEMENT OF UNCERTAINTY IN KNOWLEDGE-BASED SYSTEMS: THEORY AND FOUNDATIONS, IPMU 2018, PT I, 2018, 853 : 3 - 15
  • [4] Angwin J., 2016, Machine bias: Theres software used across the country to predict future criminals. and its biased against blacks
  • [5] Anjomshoae S, 2019, AAMAS '19: PROCEEDINGS OF THE 18TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, P1078
  • [6] [Anonymous], 2016, AUDITING BLACK BOX P
  • [7] Asher N, 2021, Arxiv, DOI arXiv:2001.07578
  • [8] Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets
    Bacchus, Fahiem
    Katsirelos, George
    [J]. COMPUTER AIDED VERIFICATION, CAV 2015, PT II, 2015, 9207 : 70 - 86
  • [9] Bailey J, 2005, LECT NOTES COMPUT SC, V3350, P174
  • [10] Recursive Online Enumeration of All Minimal Unsatisfiable Subsets
    Bendik, Jaroslav
    Cerna, Ivana
    Benes, Nikola
    [J]. AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS (ATVA 2018), 2018, 11138 : 143 - 159