ExplainabilityBiasTransparencycs.LG
Benchmarking Instance-Centric Counterfactual Algorithms for XAI: From White Box to Black Box
Catarina Moreira, Yu-Liang Chou, Chihcheng Hsieh, Chun Ouyang, João Madeiras Pereira, Joaquim Jorge
March 4, 2022
ACM Computing Surveys
20 citations
Key Takeaways
-
Model transparency doesn't guarantee better explanations: The study found that counterfactual explanations—which show how to change inputs to alter a model's decision—were generated similarly across decision trees, random forests, and neural networks, suggesting that whether a model is transparent or opaque has "little impact" on this type of explanation quality.
-
Simple proximity-based algorithms fail to provide actionable insights: Counterfactual algorithms that rely solely on finding nearby alternative inputs produce explanations that are "not actionable and will not provide meaningful explanations," meaning they don't help users understand realistic ways to change outcomes.
-
Plausibility is critical but often overlooked: The researchers found that current evaluation methods are flawed because algorithms that don't build plausibility checks into their design produce "biased and unreliable conclusions," highlighting a significant gap between how counterfactual explanations are currently assessed and how they should be.
-
Manual inspection is essential for trustworthy AI explanations: The authors "strongly recommend" that counterfactual explanations undergo detailed inspection analysis to identify potential biases and ensure robustness, suggesting that automated evaluation alone is insufficient for responsible AI deployment.
-
Benchmark testing across 25 datasets reveals systematic issues: Testing four different algorithms across numerous datasets uncovered fundamental problems with how counterfactual explanations are currently generated and evaluated, indicating these issues are widespread rather than isolated to specific tools.
Abstract
This study investigates the impact of machine learning models on the generation of counterfactual explanations by conducting a benchmark evaluation over three different types of models: a decision tree (fully transparent, interpretable, white-box model), a random forest (semi-interpretable, grey-box model), and a neural network (fully opaque, black-box model). We tested the counterfactual generation process using four algorithms (DiCE, WatcherCF, prototype, and GrowingSpheresCF) in the literature in 25 different datasets. Our findings indicate that: (1) Different machine learning models have little impact on the generation of counterfactual explanations; (2) Counterfactual algorithms based uniquely on proximity loss functions are not actionable and will not provide meaningful explanations; (3) One cannot have meaningful evaluation results without guaranteeing plausibility in the counterfactual generation. Algorithms that do not consider plausibility in their internal mechanisms will lead to biased and unreliable conclusions if evaluated with the current state-of-the-art metrics; (4) A counterfactual inspection analysis is strongly recommended to ensure a robust examination of counterfactual explanations and the potential identification of biases.
Paper Info
arXiv ID2203.02399
PublishedMarch 4, 2022
RevisedJune 11, 2024
Citations
20
Relevance82%
VenueACM Computing Surveys
TypeJournalArticle
Categorycs.LG
Responsible AI Topics
ExplainabilityBiasTransparency
Links
Citation data from Semantic Scholar