The Robustness of Counterfactual Explanations Over Time

被引:22
作者
Ferrario, Andrea [1 ]
Loi, Michele [2 ]
机构
[1] ETH, Mobiliar Lab Analyt, CH-8092 Zurich, Switzerland
[2] Politecn Milan, Dept Math, I-20133 Milan, Italy
来源
IEEE ACCESS | 2022年 / 10卷
关键词
Machine learning; Machine learning algorithms; Computational modeling; Robustness; Data models; Systematics; Law; explainable artificial intelligence; counterfactual explanations; robustness; algorithmic recourse; counterfactual data augmentation;
D O I
10.1109/ACCESS.2022.3196917
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Counterfactual explanations are a prominent example of post-hoc interpretability methods in the explainable Artificial Intelligence (AI) research domain. Differently from other explanation methods, they offer the possibility to have recourse against unfavourable outcomes computed by machine learning models. However, in this paper we show that retraining machine learning models over time may invalidate the counterfactual explanations of their outcomes. We provide a formal definition of this phenomenon and we introduce a method, namely counterfactual data augmentation, to help improving the robustness of counterfactual explanations over time. We test our method in an empirical study where we simulate different model retraining scenarios. Our results show that counterfactual data augmentation improves the robustness of counterfactual explanations over time, therefore contributing to their use in real-world machine learning applications.
引用
收藏
页码:82736 / 82750
页数:15
相关论文
共 59 条
[1]   THE NORMS OF ALGORITHMIC CREDIT SCORING [J].
Aggarwal, Nikita .
CAMBRIDGE LAW JOURNAL, 2021, 80 (01) :42-73
[2]  
[Anonymous], 2009, CAUSALITY
[3]  
Artelt A., 2021, 2021 IEEE S SER COMP, P01
[4]   The Hidden Assumptions Behind Counterfactual Explanations and Principal Reasons [J].
Barocas, Solon ;
Selbst, Andrew D. ;
Raghavan, Manish .
FAT* '20: PROCEEDINGS OF THE 2020 CONFERENCE ON FAIRNESS, ACCOUNTABILITY, AND TRANSPARENCY, 2020, :80-89
[5]  
Benk M., 2020, EXPLAINING INTERPRET
[6]   SMOTE: Synthetic minority over-sampling technique [J].
Chawla, Nitesh V. ;
Bowyer, Kevin W. ;
Hall, Lawrence O. ;
Kegelmeyer, W. Philip .
2002, American Association for Artificial Intelligence (16)
[7]  
Doshi-Velez F, 2017, Arxiv, DOI [arXiv:1702.08608, 10.48550/arXiv.1702.08608, DOI 10.48550/ARXIV.1702.08608]
[8]  
Fernndez A., 2018, Learning from imbalanced data sets, P197, DOI DOI 10.1007/978-3-319-98074-4
[9]  
Ferrario Andrea, 2022, FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency, P1457, DOI 10.1145/3531146.3533202
[10]  
Ferrario A, 2021, Arxiv, DOI [arXiv:2010.04687, DOI 10.48550/ARXIV.2010.04687]