FairICP: Encouraging Equalized Odds via Inverse Conditional Permutation

Yuheng Lai, Leying Guan
2/12/2026

No official code found. Best implementation: yuhenglai/FairICP (3 stars, MIT, last commit 2025-07-16).

Abstract

$\textit{Equalized odds}$, an important notion of algorithmic fairness, aims to ensure that sensitive variables, such as race and gender, do not unfairly influence the algorithm's prediction when conditioning on the true outcome. Despite rapid advancements, current research primarily focuses on equalized odds violations caused by a single sensitive attribute, leaving the challenge of simultaneously accounting for multiple attributes under-addressed. We bridge this gap by introducing an in-processing fairness-aware learning approach, FairICP, which integrates adversarial learning with a novel inverse conditional permutation scheme. FairICP offers a flexible and efficient scheme to promote equalized odds under fairness conditions described by complex and multi-dimensional sensitive attributes. The efficacy and adaptability of our method are demonstrated through both simulation studies and empirical analyses of real-world datasets.

View on arXivView PDF

Code Implementations(1)

yuhenglai/FairICPCommunity100%
MIT

Code implementation for paper FairICP: Flexible Fairness-Aware Learning via Inverse Conditional Permutation

31R, PythonMar 5, 20241 years agoMIT

Similar Papers

Cite this paper

@article{lai2026fairicp,
  title  = {FairICP: Encouraging Equalized Odds via Inverse Conditional Permutation},
  author = {Yuheng Lai and Leying Guan},
  year   = {2026},
  eprint = {2404.05678},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2404.05678},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.05678.svg)](https://codeofpaper.com/paper/2404.05678)

Discussion