Causality-based counterfactual explanation for classification models

被引:1
作者
Duong, Tri Dung [1 ]
Li, Qian [2 ]
Xu, Guandong [3 ]
机构
[1] Univ Technol Sydney, Fac Engn & Informat Technol, Sydney, NSW, Australia
[2] Curtin Univ, Sch Elect Engn Comp & Math Sci, Perth, WA, Australia
[3] Educ Univ Hong Kong, Ctr Learning Teaching & Technol, Hong Kong, HK, Peoples R China
基金
澳大利亚研究理事会; 美国国家科学基金会;
关键词
Counterfactual explanation; Interpretable machine learning; Structural causal model; GENETIC ALGORITHM;
D O I
10.1016/j.knosys.2024.112200
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Counterfactual explanation is one branch of interpretable machine learning that produces a perturbation sample to change the model's original decision. The generated samples can act as a recommendation for end-users to achieve their desired outputs. Most of the current counterfactual explanation approaches are the gradient-based method, which can only optimize the differentiable loss functions with continuous variables. Accordingly, the gradient-free methods are proposed to handle the categorical variables, which however have several major limitations: (1) causal relationships among features are typically ignored when generating the counterfactuals, possibly resulting in impractical guidelines for decision-makers; (2) the counterfactual explanation algorithm requires a great deal of effort into parameter tuning for determining the optimal weight for each loss functions which must be conducted repeatedly for different datasets and settings. In this work, to address the above limitations, we propose a prototype-based counterfactual explanation framework (ProCE). ProCE is capable of preserving the causal relationship underlying the features of the counterfactual data. In addition, we design a novel gradient-free optimization based on the multi-objective genetic algorithm that generates the counterfactual explanations for the mixed-type of continuous and categorical features. Numerical experiments demonstrate that our method compares favorably with state-of-the-art methods and therefore is applicable to existing prediction models. All the source codes and data are available at https: //github.com/tridungduong16/multiobj-scm-cf.
引用
收藏
页数:12
相关论文
共 49 条
[1]  
Artelt A, 2020, Arxiv, DOI arXiv:2002.04862
[2]   Pymoo: Multi-Objective Optimization in Python']Python [J].
Blank, Julian ;
Deb, Kalyanmoy .
IEEE ACCESS, 2020, 8 :89497-89509
[3]  
Bliek1u C., 2014, P 26 RAMP S, P16
[4]   Optimal Action Extraction for Random Forests and Boosted Trees [J].
Cui, Zhicheng ;
Chen, Wenlin ;
He, Yujie ;
Chen, Yixin .
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, :179-188
[5]  
Dandl S, 2020, Arxiv, DOI arXiv:2004.11165
[6]  
Deb K., 2000, Parallel Problem Solving from Nature PPSN VI. 6th International Conference. Proceedings (Lecture Notes in Computer Science Vol.1917), P849
[7]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[8]  
Dhurandhar A, 2019, Arxiv, DOI arXiv:1906.00117
[9]  
Dhurandhar Amit, 2018, arXiv
[10]  
Dong G., 2018, Feature engineering for machine learning and data analytics, VFirst ed