Learning Model-Agnostic Counterfactual Explanations for Tabular Data

被引:101
作者
Pawelczyk, Martin [1 ]
Broelemann, Klaus [2 ]
Kasneci, Gjergji [1 ]
机构
[1] Univ Tubingen, Tubingen, Germany
[2] Schufa Holding AG, Wiesbaden, Germany
来源
WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020) | 2020年
关键词
Transparency; Counterfactual explanations; Interpretability;
D O I
10.1145/3366423.3380087
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Counterfactual explanations can be obtained by identifying the smallest change made to an input vector to influence a prediction in a positive way from a user's viewpoint; for example, from 'loan rejected' to 'awarded' or from 'high risk of cardiovascular disease' to 'low risk'. Previous approaches would not ensure that the produced counterfactuals be proximate (i.e., not local outliers) and connected to regions with substantial data density (i.e., close to correctly classified observations), two requirements known as counterfactual faithfulness. Our contribution is twofold. First, drawing ideas from the manifold learning literature, we develop a framework, called C-CHVAE, that generates faithful counter-factuals. Second, we suggest to complement the catalog of counterfactual quality measures using a criterion to quantify the degree of difficulty for a certain counterfactual suggestion. Our real world experiments suggest that faithful counterfactuals come at the cost of higher degrees of difficulty.
引用
收藏
页码:3126 / 3132
页数:7
相关论文
共 22 条
[1]  
Agarwal A., 2019, ICML
[2]   Threat of Adversarial Attacks on Deep Learning in Computer Vision: A Survey [J].
Akhtar, Naveed ;
Mian, Ajmal .
IEEE ACCESS, 2018, 6 :14410-14430
[3]  
[Anonymous], 2015, CoRR abs/1511.05644, Patent No. [ArXiv151105644Cs, 151105644]
[4]  
Brown T.B., 2017, arXiv preprint arXiv:1712.09665.
[5]  
Grath Rory Mc, 2018, NEURIPS WORKSH CHALL
[6]   Human Perceptions of Fairness in Algorithmic Decision Making: A Case Study of Criminal Risk Prediction [J].
Grgic-Hlaca, Nina ;
Redmiles, Elissa M. ;
Gummadi, Krishna P. ;
Weller, Adrian .
WEB CONFERENCE 2018: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW2018), 2018, :903-912
[7]   On decompositional algorithms for uniform sampling from n-spheres and n-balls [J].
Harman, Radoslav ;
Lacko, Vladimir .
JOURNAL OF MULTIVARIATE ANALYSIS, 2010, 101 (10) :2297-2304
[8]  
Ivanov O., 2018, ARXIV PREPRINT ARXIV
[9]  
Kingma D.P., 2014, P 2 INT C LEARN REPR
[10]  
Lash MT, 2017, P 2017 SIAM INT C DA, P162, DOI [DOI 10.1137/1.9781611974973.19, 10.1137/1.9781611974973.19]