Group-blind optimal transport to group parity and its constrained variants

Quan Zhou, Jakub Marecek
10/17/2023
cs.LGmath.OC

No confident code implementation found for this paper.

Abstract

Fairness holds a pivotal role in the realm of machine learning, particularly when it comes to addressing groups categorised by protected attributes, e.g., gender, race. Prevailing algorithms in fair learning predominantly hinge on accessibility or estimations of these protected attributes, at least in the training process. We design a single group-blind projection map that aligns the feature distributions of both groups in the source data, achieving (demographic) group parity, without requiring values of the protected attribute for individual samples in the computation of the map, as well as its use. Instead, our approach utilises the feature distributions of the privileged and unprivileged groups in a boarder population and the essential assumption that the source data are unbiased representation of the population. We present numerical results on synthetic data and real data.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zhou2023groupblind,
  title  = {Group-blind optimal transport to group parity and its constrained variants},
  author = {Quan Zhou and Jakub Marecek},
  year   = {2023},
  eprint = {2310.11407},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.11407v2}
}

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/2310.11407.svg)](https://codeofpaper.com/paper/2310.11407)

Discussion