Synthesising Counterfactual Explanations via Label-Conditional Gaussian Mixture Variational Autoencoders
Junqi Jiang, Francesco Leofante, Antonio Rago, Francesca Toni
Abstract
Counterfactual explanations (CEs) provide recourse recommendations for individuals affected by algorithmic decisions. A key challenge is generating CEs that are robust against various perturbation types (e.g. input and model perturbations) while simultaneously satisfying other desirable properties. These include plausibility, ensuring CEs reside on the data manifold, and diversity, providing multiple distinct recourse options for single inputs. Existing methods, however, mostly struggle to address these multifaceted requirements in a unified, model-agnostic manner. We address these limitations by proposing a novel generative framework. First, we introduce the Label-conditional Gaussian Mixture Variational Autoencoder (L-GMVAE), a model trained to learn a structured latent space where each class label is represented by a set of Gaussian components with diverse, prototypical centroids. Building on this, we present LAPACE (LAtent PAth Counterfactual Explanations), a model-agnostic algorithm that synthesises entire paths of CE points by interpolating from inputs' latent representations to those learned latent centroids. This approach inherently ensures robustness to input changes, as all paths for a given target class converge to the same fixed centroids. Furthermore, the generated paths provide a spectrum of recourse options, allowing users to navigate the trade-off between proximity and plausibility while also encouraging robustness against model changes. In addition, user-specified actionability constraints can also be easily incorporated via lightweight gradient optimisation through the L-GMVAE's decoder. Comprehensive experiments show that LAPACE is computationally efficient and achieves competitive performance across eight quantitative metrics.
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.
Builds on12
- Deep Structural Causal Models for Tractable Counterfactual InferenceNick Pawlowski, Daniel Coelho de Castro, Ben GlockerNeurIPS 2020 · 353 citations
- Algorithmic recourse under imperfect causal knowledge: a probabilistic approachAmir-Hossein Karimi, Bodo Julius von Kügelgen, Bernhard Schölkopf, Isabel ValeraNeurIPS 2020 · 224 citations
- Towards Robust and Reliable Algorithmic RecourseSohini Upadhyay, Shalmali Joshi, Himabindu LakkarajuNeurIPS 2021 · 145 citations
- Beyond Individualized Recourse: Interpretable and Interactive Summaries of Actionable RecoursesKaivalya Rawal, Himabindu LakkarajuNeurIPS 2020 · 113 citations
- On the Adversarial Robustness of Causal Algorithmic RecourseRicardo Dominguez-Olmedo, Amir-Hossein Karimi, Bernhard SchölkopfICML 2022 · 80 citations
Related papers
- DiCoFlex: Model-Agnostic Diverse Counterfactuals with Flexible ControlOleksii Furman, Ulvi Movsum-zada, Patryk Marszalek, Maciej Zieba et al.NeurIPS 2025 · 3 citations
- Counterfactual Explanations with Probabilistic Guarantees on their Robustness to Model ChangeIgnacy Stepka, Jerzy Stefanowski, Mateusz LangoKDD 2025 · 1 citation
- Counterfactual Metarules for Local and Global RecourseTom Bewley, Salim I. Amoukou, Saumitra Mishra, Daniele Magazzeni et al.ICML 2024 · 4 citations
- Learning Feasible Causal Algorithmic Recourse: A Prior Structural Knowledge Free ApproachHaotian Wang, Hao Zou, Xueguang Zhou, Shangwen Wang et al.WWW 2025 · 1 citation
- LeapFactual: Reliable Visual Counterfactual Explanation Using Conditional Flow MatchingZhuo Cao, Xuan Zhao, Lena Krieger, Hanno Scharr et al.NeurIPS 2025 · 5 citations
