Understanding Fixed Predictions via Confined Regions
Connor Lawless, Tsui-Wei Weng, Berk Ustun, Madeleine Udell
Abstract
Machine learning models can assign fixed predictions that preclude individuals from changing their outcome. Existing approaches to audit fixed predictions do so on a pointwise basis, which requires access to an existing dataset of individuals and may fail to anticipate fixed predictions in out-of-sample data. This work presents a new paradigm to identify fixed predictions by finding confined regions of the feature space in which all individuals receive fixed predictions. This paradigm enables the certification of recourse for out-of-sample data, works in settings without representative datasets, and provides interpretable descriptions of individuals with fixed predictions. We develop a fast method to discover confined regions for linear classifiers using mixed-integer quadratically constrained programming. We conduct a comprehensive empirical study of confined regions across diverse applications. Our results highlight that existing pointwise verification methods fail to anticipate future individuals with fixed predictions, while our method both identifies them and provides an interpretable description.
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 f2ff2b99-35dc-45b1-a96f-fee6a72607ffBuilds on12
- Concept Bottleneck ModelsPang Wei Koh, Thao Nguyen, Yew Siang Tang, Stephen Mussmann et al.ICML 2020 · 1,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
- Towards Robust and Reliable Algorithmic RecourseSohini Upadhyay, Shalmali Joshi, Himabindu LakkarajuNeurIPS 2021 · 145 citations
- Ordered Counterfactual Explanation by Mixed-Integer Linear OptimizationKentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike et al.AAAI 2021 · 135 citations
- Beyond Individualized Recourse: Interpretable and Interactive Summaries of Actionable RecoursesKaivalya Rawal, Himabindu LakkarajuNeurIPS 2020 · 113 citations
Related papers
- Prediction without Preclusion: Recourse Verification with Reachable SetsAvni Kothari, Bogdan Kulynych, Tsui-Wei Weng, Berk UstunICLR 2024 · 7 citations
- Learning from Uncertain Data: From Possible Worlds to Possible ModelsJiongli Zhu, Su Feng, Boris Glavic, Babak SalimiNeurIPS 2024 · 4 citations
- Data-SUITE: Data-centric identification of in-distribution incongruous examplesNabeel Seedat, Jonathan Crabbé, Mihaela van der SchaarICML 2022 · 16 citations
- Shh, don't say that! Domain Certification in LLMsCornelius Emde, Alasdair Paren, Preetham Arvind, Maxime Guillaume Kayser et al.ICLR 2025
- Personal Insights for Altering Decisions of Tree-based Ensembles over TimeNave Frost, Naama Boer, Daniel Deutch, Tova MiloVLDB 2020 · 7 citations
