mlsanityData to 14 Oct 2026

Understanding Fixed Predictions via Confined Regions

arXiv 2502.16380 ↗First posted 22 Feb 2025cs.LG cs.AI math.OCcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 27 of its 60 references that are in the map. First posted on arXiv 22 Feb 2025.

Builds on

27 of 60 references.

References · 27

  1. 2020Concept Bottleneck Modelscited by 1,032
  2. 2019Explaining Machine Learning Classifiers through Diverse Counterfactual Explanationscited by 614
  3. 2018Actionable Recourse in Linear Classificationcited by 328
  4. 2020Algorithmic Recourse: from Counterfactual Explanations to Interventionscited by 250
  5. 2019Model-Agnostic Counterfactual Explanations for Consequential Decisionscited by 204
  6. 2019Preserving Causal Constraints in Counterfactual Explanations for Machine Learning Classifierscited by 144
  7. 2020Algorithmic recourse under imperfect causal knowledge: a probabilistic approachcited by 140
  8. 2020A survey of algorithmic recourse: definitions, formulations, solutions, and prospectscited by 118
  9. 2019Efficient Search for Diverse Coherent Explanationscited by 111
  10. 2021Towards Robust and Reliable Algorithmic Recoursecited by 102
  11. 2018How Do Classifiers Induce Agents To Invest Effort Strategically?cited by 83
  12. 2021On the Adversarial Robustness of Causal Algorithmic Recoursecited by 56
15 more
  1. 2024Concept Bottleneck Large Language Modelscited by 43
  2. 2020Algorithmic Recourse in the Wild: Understanding the Impact of Data and Model Shiftscited by 36
  3. 2022On the Robustness of Sparse Counterfactual Explanations to Adverse Perturbationscited by 32
  4. 2023Algorithmic Collective Action in Machine Learningcited by 31
  5. 2023GLOBE-CE: A Translation-Based Approach for Global Counterfactual Explanationscited by 27
  6. 2023Finding Regions of Counterfactual Explanations via Robust Optimizationcited by 19
  7. 2021Interpretable Clustering via Multi-Polytope Machinescited by 11
  8. 2021Interpretable and Fair Boolean Rule Sets via Column Generationcited by 10
  9. 2023Endogenous Macrodynamics in Algorithmic Recoursecited by 9
  10. 2023On the Actionability of Outcome Predictioncited by 9
  11. 2023Generating collective counterfactual explanations in score-based classification via mathematical optimizationcited by 9
  12. 2022Cluster Explanation via Polyhedral Descriptionscited by 6
  13. 2023Prediction without Preclusion: Recourse Verification with Reachable Setscited by 4
  14. 2022Don't Explain Noise: Robust Counterfactuals for Randomized Ensemblescited by 2
  15. 2024One-for-many Counterfactual Explanations by Column Generationcited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.