Prediction without Preclusion: Recourse Verification with Reachable Sets
Avni Kothari, Bogdan Kulynych, Tsui-Wei Weng, Berk Ustun
Abstract
Machine learning models are often used to decide who receives a loan, a job interview, or a public benefit. Models in such settings use features without considering their actionability. As a result, they can assign predictions that are fixed meaning that individuals who are denied loans and interviews are, in fact, precluded from access to credit and employment. In this work, we introduce a procedure called recourse verification to test if a model assigns fixed predictions to its decision subjects. We propose a model-agnostic approach for recourse verification with reachable sets i.e., the set of all points that a person can reach through their actions in feature space. We develop methods to construct reachable sets for discrete feature spaces, which can certify the responsiveness of any model by simply querying its predictions. We conduct a comprehensive empirical study on the infeasibility of recourse on datasets from consumer finance. Our results highlight how models can inadvertently preclude access by assigning fixed predictions and underscore the need to account for actionability in model development.
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 60ad8d6e-afa0-489e-ba9c-279da53c161dCited by top-tier papers4
- Learning Gradient Boosted Decision Trees with Algorithmic RecourseKentaro Kanamori, Ken Kobayashi, Takuya TakagiNeurIPS 2025 · 2 citations
- Feature Responsiveness Scores: Model-Agnostic Explanations for RecourseSeung Hyun Cheon, Anneke Wernerfelt, Sorelle A. Friedler, Berk UstunICLR 2025
- Regretful Decisions under Label NoiseSujay Nagaraj, Yang Liu, Flávio P. Calmon, Berk UstunICLR 2025
- Understanding Fixed Predictions via Confined RegionsConnor Lawless, Tsui-Wei Weng, Berk Ustun, Madeleine UdellICML 2025
Builds on18
- Algorithmic recourse under imperfect causal knowledge: a probabilistic approachAmir-Hossein Karimi, Bodo Julius von Kügelgen, Bernhard Schölkopf, Isabel ValeraNeurIPS 2020 · 224 citations
- Towards Robust and Reliable Algorithmic RecourseSohini Upadhyay, Shalmali Joshi, Himabindu LakkarajuNeurIPS 2021 · 145 citations
- Strategic Classification is Causal Modeling in DisguiseJohn Miller, Smitha Milli, Moritz HardtICML 2020 · 127 citations
- On the Fairness of Causal Algorithmic RecourseJulius von Kügelgen, Amir-Hossein Karimi, Umang Bhatt, Isabel Valera et al.AAAI 2022 · 99 citations
- Causal Strategic Linear RegressionYonadav Shavit, Benjamin L. Edelman, Brian AxelrodICML 2020 · 91 citations
Related papers
- Learning Models for Actionable RecourseAlexis Ross, Himabindu Lakkaraju, Osbert BastaniNeurIPS 2021 · 25 citations
- 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
- Beyond Individualized Recourse: Interpretable and Interactive Summaries of Actionable RecoursesKaivalya Rawal, Himabindu LakkarajuNeurIPS 2020 · 113 citations
- SafeAR: Safe Algorithmic Recourse by Risk-Aware PoliciesHaochen Wu, Shubham Sharma, Sunandita Patra, Sriram GopalakrishnanAAAI 2024 · 1 citation
- Algorithmic Recourse of In-Context Learning for Tabular DataWenshuo Dong, Jiaming Zhang, Shaopeng Fu, Hongbin Lin et al.ICML 2026
