mlsanityData to 7 Oct 2026

Algorithmic Recourse in the Wild: Understanding the Impact of Data and Model Shifts

arXiv 2012.11788 ↗First posted 22 Dec 2020cs.LG cs.AIcited by 34

Not on the map. Why?

Abstract (arXiv)

As predictive models are increasingly being deployed to make a variety of consequential decisions, there is a growing emphasis on designing algorithms that can provide recourse to affected individuals. Existing recourse algorithms function under the assumption that the underlying predictive model does not change. However, models are regularly updated in practice for several reasons including data distribution shifts. In this work, we make the first attempt at understanding how model updates resulting from data distribution shifts impact the algorithmic recourses generated by state-of-the-art algorithms. We carry out a rigorous theoretical and empirical analysis to address the above question. Our theoretical results establish a lower bound on the probability of recourse invalidation due to model shifts, and show the existence of a tradeoff between this invalidation probability and typical notions of "cost" minimized by modern recourse generation algorithms. We experiment with multiple synthetic and real world datasets, capturing different kinds of distribution shifts including temporal shifts, geospatial shifts, and shifts due to data correction. These experiments demonstrate that model updation due to all the aforementioned distribution shifts can potentially invalidate recourses generated by state-of-the-art algorithms. Our findings thus not only expose previously unknown flaws in the current recourse generation paradigm, but also pave the way for fundamentally rethinking the design and development of recourse generation algorithms.

Key facts. Cited by 34 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Dec 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 7; 2023: 12; 2024: 6; 2025: 6; 2026: 2.

34 papers.

Sort:

By area:

  1. 2021On the Adversarial Robustness of Causal Algorithmic Recoursecited by 56
  2. 2022Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic Recoursecited by 40
  3. 2022On the Robustness of Sparse Counterfactual Explanations to Adverse Perturbationscited by 32
  4. 2022On the Privacy Risks of Algorithmic Recoursecited by 32
  5. 2024Robust Counterfactual Explanations in Machine Learning: A Surveycited by 29
  6. 2022On the Trade-Off between Actionable Explanations and the Right to be Forgottencited by 20
  7. 2022Improvement-Focused Causal Recourse (ICR)cited by 20
  8. 2023Provably Robust and Plausible Counterfactual Explanations for Neural Networks via Robust Optimisationcited by 20
  9. 2023Finding Regions of Counterfactual Explanations via Robust Optimizationcited by 19
  10. 2022Robust Bayesian Recoursecited by 18
  11. 2025Systemizing Multiplicity: The Curious Case of Arbitrariness in Machine Learningcited by 17
  12. 2023Generating robust counterfactual explanationscited by 13
22 more
  1. 2023Setting the Right Expectations: Algorithmic Recourse Over Timecited by 13
  2. 2023Distributionally Robust Recourse Actioncited by 12
  3. 2022RoCourseNet: Distributionally Robust Training of a Prediction Aware Recourse Modelcited by 11
  4. 2023Towards Bridging the Gaps between the Right to Explanation and the Right to be Forgottencited by 10
  5. 2023The Risks of Recourse in Binary Classificationcited by 8
  6. 2025Performative Validity of Recourse Explanationscited by 8
  7. 2024Interval Abstractions for Robust Counterfactual Explanationscited by 7
  8. 2025From Search To Sampling: Generative Models For Robust Algorithmic Recoursecited by 5
  9. 2023Prediction without Preclusion: Recourse Verification with Reachable Setscited by 4
  10. 2024The Cost of Arbitrariness for Individuals: Examining the Legal and Technical Challenges of Model Multiplicitycited by 4
  11. 2023On Minimizing the Impact of Dataset Shifts on Actionable Explanationscited by 3
  12. 2025Reinforcement Learning for Durable Algorithmic Recoursecited by 3
  13. 2024Generally-Occurring Model Change for Robust Counterfactual Explanationscited by 2
  14. 2024Perfect Counterfactuals in Imperfect Worlds: Modelling Noisy Implementation of Actions in Sequential Algorithmic Recoursecited by 2
  15. 2024HR-Bandit: Human-AI Collaborated Linear Recourse Banditcited by 2
  16. 2023Iterative Partial Fulfillment of Counterfactual Explanations: Benefits and Riskscited by 1
  17. 2025Understanding Fixed Predictions via Confined Regionscited by 1
  18. 2025Understanding Endogenous Data Drift in Adaptive Models with Recourse-Seeking Userscited by 1
  19. 2023Counterfactual Explanations and Predictive Models to Enhance Clinical Decision-Making in Schizophrenia using Digital Phenotypingcited by 0
  20. 2023On the Trade-offs between Adversarial Robustness and Actionable Explanationscited by 0
  21. 2026LIBRA: Language Model Informed Bandit Recourse Algorithm for Personalized Treatment Planningcited by 0
  22. 2026The Impact of Machine Learning Uncertainty on the Robustness of Counterfactual Explanationscited by 0