Endogenous Macrodynamics in Algorithmic Recourse
Not on the map. Why?
Abstract (arXiv)
Existing work on Counterfactual Explanations (CE) and Algorithmic Recourse (AR) has largely focused on single individuals in a static environment: given some estimated model, the goal is to find valid counterfactuals for an individual instance that fulfill various desiderata. The ability of such counterfactuals to handle dynamics like data and model drift remains a largely unexplored research challenge. There has also been surprisingly little work on the related question of how the actual implementation of recourse by one individual may affect other individuals. Through this work, we aim to close that gap. We first show that many of the existing methodologies can be collectively described by a generalized framework. We then argue that the existing framework does not account for a hidden external cost of recourse, that only reveals itself when studying the endogenous dynamics of recourse at the group level. Through simulation experiments involving various state-of the-art counterfactual generators and several benchmark datasets, we generate large numbers of counterfactuals and study the resulting domain and model shifts. We find that the induced shifts are substantial enough to likely impede the applicability of Algorithmic Recourse in some situations. Fortunately, we find various strategies to mitigate these concerns. Our simulation framework for studying recourse dynamics is fast and opensourced.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 19 of its 41 references that are in the map. First posted on arXiv 16 Aug 2023.
Builds on
19 of 41 references.
References · 19
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,086
- 2019Explaining Machine Learning Classifiers through Diverse Counterfactual Explanationscited by 612
- 2021Deep Neural Networks and Tabular Data: A Surveycited by 489
- 2018Actionable Recourse in Linear Classificationcited by 327
- 2020Algorithmic Recourse: from Counterfactual Explanations to Interventionscited by 250
- 2018Failing Loudly: An Empirical Study of Methods for Detecting Dataset Shiftcited by 240
- 2022Why do tree-based models still outperform deep learning on tabular data?cited by 198
- 2020Fairness in Machine Learningcited by 194
- 2019Towards Realistic Individual Recourse and Actionable Explanations in Black-Box Decision Making Systemscited by 128
- 2020A survey of algorithmic recourse: definitions, formulations, solutions, and prospectscited by 118
- 2021Towards Robust and Reliable Algorithmic Recoursecited by 101
7 more
- 2019Strategic Classification is Causal Modeling in Disguisecited by 92
- 2020Getting a CLUE: A Method for Explaining Uncertainty Estimatescited by 92
- 2021CARLA: A Python Library to Benchmark Algorithmic Recourse and Counterfactual Explanation Algorithmscited by 85
- 2018Fashionable Modelling with Fluxcited by 53
- 2021Generating Interpretable Counterfactual Explanations By Implicit Minimisation of Epistemic and Aleatoric Uncertaintiescited by 41
- 2021A Framework and Benchmarking Study for Counterfactual Generating Methods on Tabular Datacited by 19
- 2021Machine Learning Model Drift Detection Via Weak Data Slicescited by 6
Built on by
Citing papers per year: 2023: 2; 2024: 3; 2025: 2; 2026: 2.
9 papers.
- 2023Setting the Right Expectations: Algorithmic Recourse Over Timecited by 13
- 2024Fairness in Algorithmic Recourse Through the Lens of Substantive Equality of Opportunitycited by 9
- 2024Time Can Invalidate Algorithmic Recoursecited by 8
- 2023Prediction without Preclusion: Recourse Verification with Reachable Setscited by 4
- 2025Reinforcement Learning for Durable Algorithmic Recoursecited by 3
- 2024Collective Counterfactual Explanations: Balancing Individual Goals and Collective Dynamicscited by 1
- 2025Understanding Fixed Predictions via Confined Regionscited by 1
- 2026RecourseBench: A Modular Framework for Reproducible Algorithmic Recourse Evaluationcited by 0
- 2026Algorithmic Recourse Under Competitioncited by 0
- 2026Algorithmic Recourse Under Competition30 Sep 2026
- 2026RecourseBench: A Modular Framework for Reproducible Algorithmic Recourse Evaluation15 Jun 2026
- 2025Reinforcement Learning for Durable Algorithmic Recourse26 Sep 2025
- 2025Understanding Fixed Predictions via Confined Regions22 Feb 2025
- 2024Time Can Invalidate Algorithmic Recourse10 Oct 2024
- 2024Collective Counterfactual Explanations: Balancing Individual Goals and Collective Dynamics7 Feb 2024
- 2024Fairness in Algorithmic Recourse Through the Lens of Substantive Equality of Opportunity29 Jan 2024
- 2023Setting the Right Expectations: Algorithmic Recourse Over Time13 Sep 2023
- 2023Prediction without Preclusion: Recourse Verification with Reachable Sets24 Aug 2023