Information Theoretic Constraints for Fair Machine Learning

You are reading version 1 of this direction, frozen 2026-10-04. The latest version is version 2.

Version 1 of 2119 papers172 conceptsfrozen 2026-10-04

Machine learning models are notorious "cheaters." When tasked with predicting a target outcome $Y$ (like creditworthiness) from input data $X$, they will exploit any statistical correlation available. Often, this includes "sensitive attributes" $S$—such as race, gender, or age—that are embedded in the data through historical bias or proxy variables.

To prevent this, researchers have turned to Information Theory to provide a rigorous, mathematical language for fairness. By treating fairness as a problem of information flow, we can "scrub" discriminatory signals from data representations while preserving the utility of the model.

The Fairness Bottleneck

The core intuition behind this research direction is the creation of an intermediate, compressed representation $Z$. Instead of mapping $X$ directly to a prediction $\hat{Y}$, we map $X$ to a latent space $Z$ that acts as a filter.

As AmirEmad Ghassami, Sajad Khodadadian, and Negar Kiyavash describe in Fairness in Supervised Learning: An Information Theoretic Approach, this $Z$ serves as a bottleneck. The goal is to maximize the information $Z$ carries about the target $Y$ while minimizing the information it carries about the sensitive attribute $S$.

This is typically achieved through a multi-objective Lagrangian function: $$\min \mathcal{L} = \text{Error}(Y, \hat{Y}) + \lambda \cdot I(Z; S)$$ Here, $I(Z; S)$ is the Mutual Information (MI) between the representation and the protected attribute. By minimizing this term, we force the model to become "blind" to $S$.

Why Mutual Information?

Traditional fairness metrics often rely on simple linear correlations, which fail to capture complex, non-linear dependencies. Mutual information is a more powerful tool because it measures the total reduction in uncertainty about one variable given another.

Jiaming Song, Aditya Grover, and colleagues at Stanford developed the L-MIFR framework in Learning Controllable Fair Representations to give users direct control over this trade-off. They demonstrated that many disparate fairness algorithms are actually optimizing the same underlying information-theoretic objective, just with different penalty parameters.

Mapping Information to Fairness Criteria

Different definitions of "fairness" require different information-theoretic constraints:

  1. Statistical Parity: This requires the prediction $\hat{Y}$ to be independent of $S$. In information-theoretic terms, we minimize $I(\hat{Y}; S)$. Daniel McNamara and Cheng Soon Ong show in Provably Fair Representations that by bounding the conditional entropy of $S$ within $Z$, we can provide a theoretical upper limit on how much any downstream model can discriminate.
  2. Equalized Odds: This requires that for a given ground truth $Y$, the prediction $\hat{Y}$ is independent of $S$. This is enforced by minimizing the Conditional Mutual Information (CMI), $I(\hat{Y}; S | Y)$. Jianfeng Chi and Han Zhao apply this in Conditional Supervised Contrastive Learning for Fair Text Classification to ensure toxicity detectors perform equitably across demographic groups.

Scaling to Complex Scenarios

Recent work has moved beyond simple binary classification into more complex domains:

The Stability Advantage

A recurring theme across these papers is that direct MI optimization is often more stable than adversarial methods. As noted by Mattia Cerrato in Invariant Representations with Stochastically Quantized Neural Networks, information-theoretic penalties yield a more predictable, linear relationship between fairness constraints and performance compared to the "cat-and-mouse" instability of adversarial training. By treating fairness as a measurable quantity of information leakage, we move from heuristic "debiasing" to principled, provable equity.

Papers in this version

Showing 60 of 119 papers.

History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 70 papers
  2. Version 1 · 2026-10-04 · 119 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_information_theoretic_fairness_7baaaab1,
  title = {information-theoretic fairness},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/information-theoretic-fairness/rdr_7baaaab15ef9458894f367a81ca0afe4},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}

This exact version (version 1, frozen text):

@misc{lacuna_information_theoretic_constraints_for_fa_7baaaab1_v1,
  title = {Information Theoretic Constraints for Fair Machine Learning},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/information-theoretic-constraints-for-fair-machine-learning/rdr_7baaaab15ef9458894f367a81ca0afe4/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}