Providing Fair Recourse over Plausible Groups

Authors

  • Jayanth Yetukuri University of California, Santa Cruz
  • Ian Hardy University of California, Santa Cruz
  • Yevgeniy Vorobeychik Washington University in St. Louis
  • Berk Ustun University of California, San Diego
  • Yang Liu University of California, Santa Cruz

DOI:

https://doi.org/10.1609/aaai.v38i19.30175

Keywords:

General

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.

Published

2024-03-24

How to Cite

Yetukuri, J., Hardy, I., Vorobeychik, Y., Ustun, B., & Liu, Y. (2024). Providing Fair Recourse over Plausible Groups. Proceedings of the AAAI Conference on Artificial Intelligence, 38(19), 21753-21760. https://doi.org/10.1609/aaai.v38i19.30175

Issue

Section

AAAI Technical Track on Safe, Robust and Responsible AI Track