Generally-Occurring Model Change for Robust Counterfactual Explanations
Ao Xu, Tieru Wu
TL;DR
This work addresses the robustness of counterfactual explanations under changing decision models. It generalizes the prior Naturally-Occurring Model Change concept to Generally-Occurring Model Change (GOMC) and provides probabilistic guarantees that quantify how counterfactuals behave when the underlying model shifts, even beyond Gaussian neighborhood assumptions. A key theoretical result bounds the discrepancy between original and updated predictions in terms of neighborhood data and distributional changes, with a clear link to Lipschitz continuity and subgaussian variability. The paper further applies the framework to a dataset perturbation case study, deriving concrete bounds under gradient-based learning and positioning GOMC as a wider, optimization-theory-backed tool for ensuring robust recourse. Overall, this work enhances reliability and interpretability of counterfactual explanations in dynamic settings with practical implications for robust decision-support systems.
Abstract
With the increasing impact of algorithmic decision-making on human lives, the interpretability of models has become a critical issue in machine learning. Counterfactual explanation is an important method in the field of interpretable machine learning, which can not only help users understand why machine learning models make specific decisions, but also help users understand how to change these decisions. Naturally, it is an important task to study the robustness of counterfactual explanation generation algorithms to model changes. Previous literature has proposed the concept of Naturally-Occurring Model Change, which has given us a deeper understanding of robustness to model change. In this paper, we first further generalize the concept of Naturally-Occurring Model Change, proposing a more general concept of model parameter changes, Generally-Occurring Model Change, which has a wider range of applicability. We also prove the corresponding probabilistic guarantees. In addition, we consider a more specific problem, data set perturbation, and give relevant theoretical results by combining optimization theory.
