FACE: Feasible and Actionable Counterfactual Explanations

被引:162
作者
Poyiadzi, Rafael [1 ]
Sokol, Kacper [1 ]
Santos-Rodriguez, Raul [1 ]
De Bie, Tijl [2 ]
Flach, Peter [1 ]
机构
[1] Univ Bristol, Bristol, Avon, England
[2] Univ Ghent, Ghent, Belgium
来源
PROCEEDINGS OF THE 3RD AAAI/ACM CONFERENCE ON AI, ETHICS, AND SOCIETY AIES 2020 | 2020年
基金
英国工程与自然科学研究理事会;
关键词
Explainability; Interpretability; Counterfactuals; Black-box Models;
D O I
10.1145/3375627.3375850
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Work in Counterfactual Explanations tends to focus on the principle of "the closest possible world" that identifies small changes leading to the desired outcome. In this paper we argue that while this approach might initially seem intuitively appealing it exhibits shortcomings not addressed in the current literature. First, a counterfactual example generated by the state-of-the-art systems is not necessarily representative of the underlying data distribution, and may therefore prescribe unachievable goals (e.g., an unsuccessful life insurance applicant with severe disability may be advised to do more sports). Secondly, the counterfactuals may not be based on a "feasible path" between the current state of the subject and the suggested one, making actionable recourse infeasible (e.g., low-skilled unsuccessful mortgage applicants may be told to double their salary, which may be hard without first increasing their skill level). These two shortcomings may render counterfactual explanations impractical and sometimes outright offensive. To address these two major flaws, first of all, we propose a new line of Counterfactual Explanations research aimed at providing actionable and feasible paths to transform a selected instance into one that meets a certain goal. Secondly, we propose FACE: an algorithmically sound way of uncovering these "feasible paths" based on the shortest path distances defined via density-weighted metrics. Our approach generates counterfactuals that are coherent with the underlying data distribution and supported by the "feasible paths" of change, which are achievable and can be tailored to the problem at hand.
引用
收藏
页码:344 / 350
页数:7
相关论文
共 17 条
[1]  
Alamgir M., 2012, P 29 INT C MACH LEAR
[2]  
Cormen Thomas H., 2009, Introduction to Algorithms, V3rd
[3]  
Gamelin T.W., 2003, Complex Analysis
[4]  
Goodfellow I., 2015, INT C LEARNING REPRE, P1
[5]  
Gretton A, 2012, J MACH LEARN RES, V13, P723
[6]  
Kim B, 2016, ADV NEUR IN, V29
[7]  
LeCun Y., 2010, MNIST handwritten digit database, V2
[8]  
Liu LT, 2018, PR MACH LEARN RES, V80
[9]  
Lundberg SM, 2017, ADV NEUR IN, V30
[10]   "Why Should I Trust You?" Explaining the Predictions of Any Classifier [J].
Ribeiro, Marco Tulio ;
Singh, Sameer ;
Guestrin, Carlos .
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, :1135-1144