Bias-inducing geometries: an exactly solvable data model with fairness implications
Stefano Sarao Mannelli, Federica Gerace, Negar Rostamzadeh, Luca Saglietti
TL;DR
The paper addresses how data geometry can induce bias in ML by introducing the Teacher-Mixture (T-M) model, an exactly solvable high-dimensional data framework with coexisting sub-populations. Using replica analysis in the limit $n,d\to\infty$ with $\alpha=n/d$, it derives fixed-point equations for scalar order parameters $\Theta$ that yield exact predictions for classification performance and fairness metrics, including the Disparate Impact $DI$. It identifies bias arising from group-label correlations $m_T^\pm$, group overlap $q_T$, and representation imbalance $\rho$, showing that bias can persist even when the task is learnable ($q_T=1$) and illustrating a positive transfer when subpopulations share similar rules. The paper then proposes two mitigation strategies—loss reweighing and coupled networks—and analytically characterizes their impact on fairness metrics and accuracy, with validation on real data (CelebA, MEPS) that supports the theoretical insights and highlights practical considerations for bias mitigation.
Abstract
Machine learning (ML) may be oblivious to human bias but it is not immune to its perpetuation. Marginalisation and iniquitous group representation are often traceable in the very data used for training, and may be reflected or even enhanced by the learning models. In the present work, we aim at clarifying the role played by data geometry in the emergence of ML bias. We introduce an exactly solvable high-dimensional model of data imbalance, where parametric control over the many bias-inducing factors allows for an extensive exploration of the bias inheritance mechanism. Through the tools of statistical physics, we analytically characterise the typical properties of learning models trained in this synthetic framework and obtain exact predictions for the observables that are commonly employed for fairness assessment. Despite the simplicity of the data model, we retrace and unpack typical unfairness behaviour observed on real-world datasets. We also obtain a detailed analytical characterisation of a class of bias mitigation strategies. We first consider a basic loss-reweighing scheme, which allows for an implicit minimisation of different unfairness metrics, and quantify the incompatibilities between some existing fairness criteria. Then, we consider a novel mitigation strategy based on a matched inference approach, consisting in the introduction of coupled learning models. Our theoretical analysis of this approach shows that the coupled strategy can strike superior fairness-accuracy trade-offs.
