Robust Counterfactual Explanations under Model Multiplicity Using Multi-Objective Optimization
Not on the map. Why?
Abstract (arXiv)
In recent years, explainability in machine learning has gained importance. In this context, counterfactual explanation (CE), which is an explanation method that uses examples, has attracted attention. However, it has been pointed out that CE is not robust when there are multiple machine-learning models with similar accuracy. These problems are important when using machine learning to make safe decisions. In this paper, we propose robust CEs that introduce a new viewpoint -- Pareto improvement -- and a method that uses multi-objective optimization to generate it. To evaluate the proposed method, we conducted experiments using both simulated and real data. The results demonstrate that the proposed method is both robust and practical. This study highlights the potential of ensuring robustness in decision-making by applying the concept of social welfare. We believe that this research can serve as a valuable foundation for various fields, including explainability in machine learning, decision-making, and action planning based on machine learning.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 15 of its 41 references that are in the map. First posted on arXiv 10 Jan 2025.
Builds on
15 of 41 references.
References · 15
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,086
- 2019Explaining Machine Learning Classifiers through Diverse Counterfactual Explanationscited by 612
- 2020pymoo: Multi-objective Optimization in Pythoncited by 196
- 2020Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Reviewcited by 174
- 2020Multi-Objective Counterfactual Explanationscited by 157
- 2021Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvementcited by 115
- 2021Counterfactual Explanations Can Be Manipulatedcited by 113
- 2021Towards Robust and Reliable Algorithmic Recoursecited by 101
- 2020On Counterfactual Explanations under Predictive Multiplicitycited by 73
- 2021Exploring Counterfactual Explanations Through the Lens of Adversarial Examples: A Theoretical and Empirical Analysiscited by 52
- 2020The Intriguing Relation Between Counterfactual Explanations and Adversarial Examplescited by 44
- 2022Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic Recoursecited by 40
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 2025Counterfactual Explanations for Model Ensembles Using Entropic Risk Measurescited by 4
- 2026ElliCE: Efficient and Provably Robust Algorithmic Recourse via the Rashomon Setscited by 2
- 2026A Generalized-Bayes Perspective on Counterfactual Explanations: Posterior-Based Decision-Making and Evaluationcited by 0
- 2026A Generalized-Bayes Perspective on Counterfactual Explanations: Posterior-Based Decision-Making and Evaluation31 Jul 2026
- 2026ElliCE: Efficient and Provably Robust Algorithmic Recourse via the Rashomon Sets7 Feb 2026
- 2025Counterfactual Explanations for Model Ensembles Using Entropic Risk Measures11 Mar 2025