Providing Fair Recourse over Plausible Groups

Abstract

Machine learning models now automate decisions in applications where we may wish to provide recourse to adversely affected individuals. In practice, existing methods to provide recourse return actions that fail to account for latent characteristics that are not captured in the model (e.g., age, sex, marital status). In this paper, we study how the cost and feasibility of recourse can change across these latent groups. We introduce a notion of group-level plausibility to identify groups of individuals with a shared set of latent characteristics. We develop a general-purpose clustering procedure to identify groups from samples. Further, we propose a constrained optimization approach to learn models that equalize the cost of recourse over latent groups. We evaluate our approach through an empirical study on simulated and real-world datasets, showing that it can produce models that have better performance in terms of overall costs and feasibility at a group level.

Cite

Text

Yetukuri et al. "Providing Fair Recourse over Plausible Groups." AAAI Conference on Artificial Intelligence, 2024. doi:10.1609/AAAI.V38I19.30175

Markdown

[Yetukuri et al. "Providing Fair Recourse over Plausible Groups." AAAI Conference on Artificial Intelligence, 2024.](https://mlanthology.org/aaai/2024/yetukuri2024aaai-providing/) doi:10.1609/AAAI.V38I19.30175

BibTeX

@inproceedings{yetukuri2024aaai-providing,
  title     = {{Providing Fair Recourse over Plausible Groups}},
  author    = {Yetukuri, Jayanth and Hardy, Ian and Vorobeychik, Yevgeniy and Ustun, Berk and Liu, Yang},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2024},
  pages     = {21753-21760},
  doi       = {10.1609/AAAI.V38I19.30175},
  url       = {https://mlanthology.org/aaai/2024/yetukuri2024aaai-providing/}
}