Literature Database Entry

ehyaei2023robustness

Ahmad-Reza Ehyaei, Amir-Hossein Karimi, Bernhard Schoelkopf and Setareh Maghsudi, "Robustness Implies Fairness in Causal Algorithmic Recourse," Proceedings of ACM Conference on Fairness, Accountability, and Transparency (FAccT 2023), Chicago, IL, June 2023, pp. 984–1001.

Abstract

Algorithmic recourse discloses the internal procedures of a black-box decision process where decisions have significant consequences by providing recommendations to empower beneficiaries to achieve a more favorable outcome. To ensure an effective remedy, suggested interventions must not only be cost-effective but also robust and fair. To that end, it is essential to provide similar explanations to similar individuals. This study explores the concept of individual fairness and adversarial robustness in causal algorithmic recourse and addresses the challenge of achieving both. To resolve the challenges, we propose a new framework for defining adversarially robust recourse. That setting observes the protected feature as a pseudometric and demonstrates that individual fairness is a special case of adversarial robustness. Finally, we introduce the fair robust recourse problem and establish solutions to achieve both desirable properties both theoretically and empirically.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Ahmad-Reza Ehyaei
Amir-Hossein Karimi
Bernhard Schoelkopf
Setareh Maghsudi

BibTeX reference

@inproceedings{ehyaei2023robustness,
    author = {Ehyaei, Ahmad-Reza and Karimi, Amir-Hossein and Schoelkopf, Bernhard and Maghsudi, Setareh},
    doi = {10.1145/3593013.3594057},
    title = {{Robustness Implies Fairness in Causal Algorithmic Recourse}},
    pages = {984--1001},
    address = {Chicago, IL},
    booktitle = {ACM Conference on Fairness, Accountability, and Transparency (FAccT 2023)},
    month = {6},
    year = {2023},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.

Last modified: 2026-04-30