Matching Code and Law: Achieving Algorithmic Fairness with Optimal Transport
Meike Zehlike, Philipp Hacker, Emil Wiedemann

TL;DR
This paper introduces the Continuous Fairness Algorithm (CFAθ), which uses optimal transport theory to interpolate between individual and group fairness, handling intersectionality and enabling nuanced fairness trade-offs in algorithmic decision-making.
Contribution
The paper presents a novel fairness algorithm that allows continuous adjustment between fairness concepts using optimal transport, addressing intersectionality and legal considerations.
Findings
The CFAθ algorithm effectively interpolates between fairness notions.
It handles multi-dimensional discrimination cases.
Experimental results validate its practical utility.
Abstract
Increasingly, discrimination by algorithms is perceived as a societal and legal problem. As a response, a number of criteria for implementing algorithmic fairness in machine learning have been developed in the literature. This paper proposes the Continuous Fairness Algorithm (CFA) which enables a continuous interpolation between different fairness definitions. More specifically, we make three main contributions to the existing literature. First, our approach allows the decision maker to continuously vary between specific concepts of individual and group fairness. As a consequence, the algorithm enables the decision maker to adopt intermediate ``worldviews'' on the degree of discrimination encoded in algorithmic processes, adding nuance to the extreme cases of ``we're all equal'' (WAE) and ``what you see is what you get'' (WYSIWYG) proposed so far in the literature. Second, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
