From Search to Sampling: Generative Models for Robust Algorithmic Recourse
Prateek Garg, Lokesh Nagalapatti, Sunita Sarawagi
Abstract
Algorithmic Recourse provides recommendations to individuals who are adversely impacted by automated model decisions, on how to alter their profiles to achieve a favorable outcome. Effective recourse methods must balance three conflicting goals: proximity to the original profile to minimize cost, plausibility for realistic recourse, and validity to ensure the desired outcome. We show that existing methods train for these objectives separately and then search for recourse through a joint optimization over the recourse goals during inference, leading to poor recourse recommendations. We introduce GenRe, a generative recourse model designed to train the three recourse objectives jointly. Training such generative models is non-trivial due to lack of direct recourse supervision. We propose efficient ways to synthesize such supervision and further show that GenRe's training leads to a consistent estimator. Unlike most prior methods, that employ non-robust gradient descent based search during inference, GenRe simply performs a forward sampling over the generative model to produce minimum cost recourse, leading to superior performance across multiple metrics. We also demonstrate GenRe provides the best trade-off between cost, plausibility and validity, compared to state-of-art baselines. Our code is available at: https://github.com/prateekgargx/genre .
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.
Cited by top-tier papers1
Ask how each one uses itBuilds on13
- Mixed-Type Tabular Data Synthesis with Score-based Diffusion in Latent SpaceHengrui Zhang, Jiani Zhang, Zhengyuan Shen, Balasubramaniam Srinivasan et al.ICLR 2024 · 233 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
- Derivative-Free Guidance in Continuous and Discrete Diffusion Models with Soft Value-based DecodingXiner Li, Yulai Zhao, Chenyu Wang, Gabriele Scalia et al.NeurIPS 2025 · 147 citations
- Towards Robust and Reliable Algorithmic RecourseSohini Upadhyay, Shalmali Joshi, Himabindu LakkarajuNeurIPS 2021 · 145 citations
- On the Adversarial Robustness of Causal Algorithmic RecourseRicardo Dominguez-Olmedo, Amir-Hossein Karimi, Bernhard SchölkopfICML 2022 · 80 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
- Distributionally Robust Recourse ActionDuy Nguyen, Ngoc Bui, Viet Anh NguyenICLR 2023 · 1 citation
- SafeAR: Safe Algorithmic Recourse by Risk-Aware PoliciesHaochen Wu, Shubham Sharma, Sunandita Patra, Sriram GopalakrishnanAAAI 2024 · 1 citation
- Performative Validity of Recourse ExplanationsGunnar König, Hidde Fokkema, Timo Freiesleben, Celestine Mendler-Dünner et al.NeurIPS 2025 · 12 citations
- On the Impact of Algorithmic Recourse on Social SegregationRuijiang Gao, Himabindu LakkarajuICML 2023 · 8 citations
