Counterfactual Explanations with Probabilistic Guarantees on their Robustness to Model Change
Ignacy Stepka, Jerzy Stefanowski, Mateusz Lango
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper4
- Towards Robust and Reliable Algorithmic RecourseSohini Upadhyay, Shalmali Joshi, Himabindu LakkarajuNeurIPS 2021 · 被引用 145 次
- Robust Counterfactual Explanations for Tree-Based EnsemblesSanghamitra Dutta, Jason Long, Saumitra Mishra, Cecilia Tilli 等ICML 2022 · 被引用 73 次
- Robust Counterfactual Explanations for Neural Networks With Probabilistic GuaranteesFaisal Hamman, Erfaun Noorani, Saumitra Mishra, Daniele Magazzeni 等ICML 2023 · 被引用 54 次
- Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic RecourseMartin Pawelczyk, Teresa Datta, Johannes van den Heuvel, Gjergji Kasneci 等ICLR 2023 · 被引用 13 次
相关 Paper
- Counterfactual Plans under Distributional AmbiguityNgoc Bui, Duy Nguyen, Viet Anh NguyenICLR 2022 · 被引用 26 次
- Synthesising Counterfactual Explanations via Label-Conditional Gaussian Mixture Variational AutoencodersJunqi Jiang, Francesco Leofante, Antonio Rago, Francesca ToniICLR 2026 · 被引用 2 次
- Learning Models for Actionable RecourseAlexis Ross, Himabindu Lakkaraju, Osbert BastaniNeurIPS 2021 · 被引用 25 次
- FACET: Robust Counterfactual Explanation AnalyticsPeter M. VanNostrand, Huayi Zhang, Dennis M. Hofmann, Elke A. RundensteinerSIGMOD 2024 · 被引用 14 次
- Diffusion Visual Counterfactual ExplanationsMaximilian Augustin, Valentyn Boreiko, Francesco Croce, Matthias HeinNeurIPS 2022 · 被引用 124 次
