Towards Robust and Reliable Algorithmic Recourse
Sohini Upadhyay, Shalmali Joshi, Himabindu Lakkaraju
Abstract
As predictive models are increasingly being deployed in high-stakes decision making (e.g., loan approvals), there has been growing interest in post-hoc techniques which provide recourse to affected individuals. These techniques generate recourses under the assumption that the underlying predictive model does not change. However, in practice, models are often regularly updated for a variety of reasons (e.g., dataset shifts), thereby rendering previously prescribed recourses ineffective. To address this problem, we propose a novel framework, RObust Algorithmic Recourse (ROAR), that leverages adversarial training for finding recourses that are robust to model shifts. To the best of our knowledge, this work proposes the first ever solution to this critical problem. We also carry out detailed theoretical analysis which underscores the importance of constructing recourses that are robust to model shifts: 1) we derive a lower bound on the probability of invalidation of recourses generated by existing approaches which are not robust to model shifts. 2) we prove that the additional cost incurred due to the robust recourses output by our framework is bounded. Experimental evaluation on multiple synthetic and real-world datasets demonstrates the efficacy of the proposed framework and supports our theoretical findings.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 98902f53-53d0-473f-a2f2-94c91842016bCited by top-tier papers27
- Robust Counterfactual Explanations for Tree-Based EnsemblesSanghamitra Dutta, Jason Long, Saumitra Mishra, Cecilia Tilli et al.ICML 2022 · 73 citations
- Robust Counterfactual Explanations for Neural Networks With Probabilistic GuaranteesFaisal Hamman, Erfaun Noorani, Saumitra Mishra, Daniele Magazzeni et al.ICML 2023 · 54 citations
- GLOBE-CE: A Translation Based Approach for Global Counterfactual ExplanationsDan Ley, Saumitra Mishra, Daniele MagazzeniICML 2023 · 30 citations
- Counterfactual Plans under Distributional AmbiguityNgoc Bui, Duy Nguyen, Viet Anh NguyenICLR 2022 · 26 citations
- Improvement-Focused Causal Recourse (ICR)Gunnar König, Timo Freiesleben, Moritz Grosse-WentrupAAAI 2023 · 21 citations
Builds on3
- Algorithmic recourse under imperfect causal knowledge: a probabilistic approachAmir-Hossein Karimi, Bodo Julius von Kügelgen, Bernhard Schölkopf, Isabel ValeraNeurIPS 2020 · 224 citations
- Beyond Individualized Recourse: Interpretable and Interactive Summaries of Actionable RecoursesKaivalya Rawal, Himabindu LakkarajuNeurIPS 2020 · 113 citations
- Robust and Stable Black Box ExplanationsHimabindu Lakkaraju, Nino Arsov, Osbert BastaniICML 2020 · 93 citations
Related papers
- Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic RecourseMartin Pawelczyk, Teresa Datta, Johannes van den Heuvel, Gjergji Kasneci et al.ICLR 2023 · 13 citations
- Learning Models for Actionable RecourseAlexis Ross, Himabindu Lakkaraju, Osbert BastaniNeurIPS 2021 · 25 citations
- Distributionally Robust Recourse ActionDuy Nguyen, Ngoc Bui, Viet Anh NguyenICLR 2023 · 1 citation
- On the Adversarial Robustness of Causal Algorithmic RecourseRicardo Dominguez-Olmedo, Amir-Hossein Karimi, Bernhard SchölkopfICML 2022 · 80 citations
- From Search to Sampling: Generative Models for Robust Algorithmic RecoursePrateek Garg, Lokesh Nagalapatti, Sunita SarawagiICLR 2025
