Counterfactual Explanations with Probabilistic Guarantees on their Robustness to Model Change
Ignacy Stepka, Jerzy Stefanowski, Mateusz Lango
Abstract
Counterfactual explanations (CFEs) guide users on how to adjust inputs to machine learning models to achieve desired outputs. While existing research primarily addresses static scenarios, real-world applications often involve data or model changes, potentially invalidating previously generated CFEs and rendering user-induced input changes ineffective. Current methods addressing this issue often support only specific models or change types, require extensive hyperparameter tuning, or fail to provide probabilistic guarantees on CFE robustness to model changes. This paper proposes a novel approach for generating CFEs that provides probabilistic guarantees for any model and change type, while offering interpretable and easy-to-select hyperparameters. We establish a theoretical framework for probabilistically defining robustness to model change and demonstrate how our BetaRCE method directly stems from it. BetaRCE is a post-hoc method applied alongside a chosen base CFE generation method to enhance the quality of the explanation beyond robustness. It facilitates a transition from the base explanation to a more robust one with user-adjusted probability bounds. Through experimental comparisons with baselines, we show that BetaRCE yields robust, most plausible, and closest to baseline counterfactual explanations.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3b27e883-b6f5-4631-a5bb-0795a0ad40bdBuilds on4
- Towards Robust and Reliable Algorithmic RecourseSohini Upadhyay, Shalmali Joshi, Himabindu LakkarajuNeurIPS 2021 · 145 citations
- Robust Counterfactual Explanations for Tree-Based EnsemblesSanghamitra Dutta, Jason Long, Saumitra Mishra, Cecilia Tilli et al.ICML 2022 · 73 citations
- Robust Counterfactual Explanations for Neural Networks With Probabilistic GuaranteesFaisal Hamman, Erfaun Noorani, Saumitra Mishra, Daniele Magazzeni et al.ICML 2023 · 54 citations
- Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic RecourseMartin Pawelczyk, Teresa Datta, Johannes van den Heuvel, Gjergji Kasneci et al.ICLR 2023 · 13 citations
Related papers
- Counterfactual Plans under Distributional AmbiguityNgoc Bui, Duy Nguyen, Viet Anh NguyenICLR 2022 · 26 citations
- Synthesising Counterfactual Explanations via Label-Conditional Gaussian Mixture Variational AutoencodersJunqi Jiang, Francesco Leofante, Antonio Rago, Francesca ToniICLR 2026 · 2 citations
- Learning Models for Actionable RecourseAlexis Ross, Himabindu Lakkaraju, Osbert BastaniNeurIPS 2021 · 25 citations
- FACET: Robust Counterfactual Explanation AnalyticsPeter M. VanNostrand, Huayi Zhang, Dennis M. Hofmann, Elke A. RundensteinerSIGMOD 2024 · 14 citations
- Diffusion Visual Counterfactual ExplanationsMaximilian Augustin, Valentyn Boreiko, Francesco Croce, Matthias HeinNeurIPS 2022 · 124 citations
