Prediction without Preclusion: Recourse Verification with Reachable Sets
Avni Kothari, Bogdan Kulynych, Tsui-Wei Weng, Berk Ustun
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper4
- Learning Gradient Boosted Decision Trees with Algorithmic RecourseKentaro Kanamori, Ken Kobayashi, Takuya TakagiNeurIPS 2025 · 被引用 2 次
- 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
它引用的顶会 Paper18
- Algorithmic recourse under imperfect causal knowledge: a probabilistic approachAmir-Hossein Karimi, Bodo Julius von Kügelgen, Bernhard Schölkopf, Isabel ValeraNeurIPS 2020 · 被引用 224 次
- Towards Robust and Reliable Algorithmic RecourseSohini Upadhyay, Shalmali Joshi, Himabindu LakkarajuNeurIPS 2021 · 被引用 145 次
- Strategic Classification is Causal Modeling in DisguiseJohn Miller, Smitha Milli, Moritz HardtICML 2020 · 被引用 127 次
- On the Fairness of Causal Algorithmic RecourseJulius von Kügelgen, Amir-Hossein Karimi, Umang Bhatt, Isabel Valera 等AAAI 2022 · 被引用 99 次
- Causal Strategic Linear RegressionYonadav Shavit, Benjamin L. Edelman, Brian AxelrodICML 2020 · 被引用 91 次
相关 Paper
- Learning Models for Actionable RecourseAlexis Ross, Himabindu Lakkaraju, Osbert BastaniNeurIPS 2021 · 被引用 25 次
- Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic RecourseMartin Pawelczyk, Teresa Datta, Johannes van den Heuvel, Gjergji Kasneci 等ICLR 2023 · 被引用 13 次
- Beyond Individualized Recourse: Interpretable and Interactive Summaries of Actionable RecoursesKaivalya Rawal, Himabindu LakkarajuNeurIPS 2020 · 被引用 113 次
- SafeAR: Safe Algorithmic Recourse by Risk-Aware PoliciesHaochen Wu, Shubham Sharma, Sunandita Patra, Sriram GopalakrishnanAAAI 2024 · 被引用 1 次
- Algorithmic Recourse of In-Context Learning for Tabular DataWenshuo Dong, Jiaming Zhang, Shaopeng Fu, Hongbin Lin 等ICML 2026
