RoCourseNet: Distributionally Robust Training of a Prediction Aware Recourse Model
Not on the map. Why?
Abstract (arXiv)
Counterfactual (CF) explanations for machine learning (ML) models are preferred by end-users, as they explain the predictions of ML models by providing a recourse (or contrastive) case to individuals who are adversely impacted by predicted outcomes. Existing CF explanation methods generate recourses under the assumption that the underlying target ML model remains stationary over time. However, due to commonly occurring distributional shifts in training data, ML models constantly get updated in practice, which might render previously generated recourses invalid and diminish end-users trust in our algorithmic framework. To address this problem, we propose RoCourseNet, a training framework that jointly optimizes predictions and recourses that are robust to future data shifts. This work contains four key contributions: (1) We formulate the robust recourse generation problem as a tri-level optimization problem which consists of two sub-problems: (i) a bi-level problem that finds the worst-case adversarial shift in the training data, and (ii) an outer minimization problem to generate robust recourses against this worst-case shift. (2) We leverage adversarial training to solve this tri-level optimization problem by: (i) proposing a novel virtual data shift (VDS) algorithm to find worst-case shifted ML models via explicitly considering the worst-case data shift in the training dataset, and (ii) a block-wise coordinate descent procedure to optimize for prediction and corresponding robust recourses. (3) We evaluate RoCourseNet's performance on three real-world datasets, and show that RoCourseNet consistently achieves more than 96% robust validity and outperforms state-of-the-art baselines by at least 10% in generating robust CF explanations. (4) Finally, we generalize the RoCourseNet framework to accommodate any parametric post-hoc methods for improving robust validity.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 43 of its 58 references that are in the map. First posted on arXiv 1 Jun 2022.
Builds on
43 of 58 references.
References · 43
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2017Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)cited by 1,309
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,086
- 2020Fast is better than free: Revisiting adversarial trainingcited by 723
- 2019Adversarial Training for Free!cited by 638
- 2019Explaining Machine Learning Classifiers through Diverse Counterfactual Explanationscited by 612
- 2019Fooling LIME and SHAP: Adversarial Attacks on Post hoc Explanation Methodscited by 440
31 more
- 2019Hidden Trigger Backdoor Attackscited by 359
- 2015Gradient-based Hyperparameter Optimization through Reversible Learningcited by 357
- 2018Actionable Recourse in Linear Classificationcited by 327
- 2018Adversarially Robust Generalization Requires More Datacited by 318
- 2018On the Robustness of Interpretability Methodscited by 310
- 2020Algorithmic Recourse: from Counterfactual Explanations to Interventionscited by 250
- 2019Interpretable Counterfactual Explanations Guided by Prototypescited by 223
- 2018Truncated Back-propagation for Bilevel Optimizationcited by 187
- 2019Learning Model-Agnostic Counterfactual Explanations for Tabular Datacited by 146
- 2019Preserving Causal Constraints in Counterfactual Explanations for Machine Learning Classifierscited by 143
- 2021On the Convergence and Robustness of Adversarial Trainingcited by 127
- 2020A survey of algorithmic recourse: definitions, formulations, solutions, and prospectscited by 118
- 2019The Hidden Assumptions Behind Counterfactual Explanations and Principal Reasonscited by 115
- 2020MetaPoison: Practical General-purpose Clean-label Data Poisoningcited by 114
- 2021Towards Robust and Reliable Algorithmic Recoursecited by 101
- 2018Curriculum Adversarial Trainingcited by 89
- 2018How Important Is a Neuron?cited by 73
- 2020On Counterfactual Explanations under Predictive Multiplicitycited by 73
- 2021On the Adversarial Robustness of Causal Algorithmic Recoursecited by 56
- 2021A Survey on the Robustness of Feature Importance and Counterfactual Explanationscited by 38
- 2021Consistent Counterfactuals for Deep Modelscited by 37
- 2020Algorithmic Recourse in the Wild: Understanding the Impact of Data and Model Shiftscited by 34
- 2018Defining Locality for Surrogates in Post-hoc Interpretablitycited by 33
- 2018Influence-Directed Explanations for Deep Convolutional Networkscited by 31
- 2020Efficient Robust Training via Backward Smoothingcited by 29
- 2022Attribution-based Explanations that Provide Recourse Cannot be Robustcited by 20
- 2015Evading the curse of dimensionality in nonparametric density estimation with simplified vine copulascited by 18
- 2021CounterNet: End-to-End Training of Prediction Aware Counterfactual Explanationscited by 17
- 2022On the Effectiveness of Adversarial Training against Backdoor Attackscited by 15
- 2021Model-Based Counterfactual Synthesizer for Interpretationcited by 14
- 2022Min-Max Bilevel Multi-objective Optimization with Applications in Machine Learningcited by 9
Built on by
Citing papers per year: 2024: 4; 2025: 5; 2026: 2.
11 papers.
- 2024Robust Counterfactual Explanations in Machine Learning: A Surveycited by 29
- 2024Interval Abstractions for Robust Counterfactual Explanationscited by 7
- 2024Learning-Augmented Robust Algorithmic Recoursecited by 4
- 2025Optimal Robust Recourse with Lp-Bounded Model Changecited by 3
- 2025Understanding Endogenous Data Drift in Adaptive Models with Recourse-Seeking Userscited by 1
- 2026The Role of Causality in Algorithmic Recoursecited by 1
- 2024Watermarking Counterfactual Explanationscited by 0
- 2025DiCE-Extended: A Robust Approach to Counterfactual Explanations in Machine Learningcited by 0
- 2025Tabular Diffusion Counterfactual Explanationscited by 0
- 2025An Explainable Gaussian Process Auto-encoder for Tabular Datacited by 0
- 2026Algorithmic Recourse Under Competitioncited by 0
- 2026Algorithmic Recourse Under Competition30 Sep 2026
- 2026The Role of Causality in Algorithmic Recourse30 Jul 2026
- 2025Optimal Robust Recourse with Lp-Bounded Model Change25 Sep 2025
- 2025An Explainable Gaussian Process Auto-encoder for Tabular Data31 Aug 2025
- 2025Tabular Diffusion Counterfactual Explanations31 Aug 2025
- 2025DiCE-Extended: A Robust Approach to Counterfactual Explanations in Machine Learning26 Apr 2025
- 2025Understanding Endogenous Data Drift in Adaptive Models with Recourse-Seeking Users12 Mar 2025
- 2024Learning-Augmented Robust Algorithmic Recourse2 Oct 2024
- 2024Watermarking Counterfactual Explanations29 May 2024
- 2024Interval Abstractions for Robust Counterfactual Explanations21 Apr 2024
- 2024Robust Counterfactual Explanations in Machine Learning: A Survey2 Feb 2024