We view fairness as a property of distributional stability. Rather than assessing a predictor under a fixed data distribution, we study how its predictions change under perturbations that modify the composition of protected groups. A predictor is fair if it remains stable under such shifts. Under this perspective, several classical notions of fairness arise as stability with respect to specific perturbations, with the associated unfairness gap given by a Lipschitz constant of a prediction-rate functional. This formulation also yields guarantees that hold uniformly over a range of demographic compositions at test time, without requiring knowledge of the deployment distribution. It leads to a learning procedure based on convex combinations of reweighted predictors, formulated as a second-order cone program, for which we establish generalization bounds. Experiments on standard benchmarks illustrate the approach.
We study the problem of fair ranking in recommender systems. We provide a formal probabilistic framework in which ranking policies are distributions over permutations, and the utility of a user is the exposure given to the items they interact with, relative to that of an ideal ranking. We consider utility parity across...
Gayane Taturyan, Charlotte Laclau, Stéphan Clémençon· 0 citations
Modern learning to rank systems have achieved remarkable performance across a wide range of applications. However, they may also exhibit disparities in exposure, raising concerns about fairness, especially in sensitive domains such as healthcare, judicial decision-making, and recruitment, where biased rankings may have...
Tristan Cladière, Antoine Gourru, Bissan Audeh et al.· Proceedings of the 20th ACM...· 0 citations
In the presence of feedback loops, algorithmic decisions at one time step can influence observed data in subsequent steps, potentially introducing selection bias or shifts in data distribution. Research has demonstrated that ignoring these effects can lead to unfairness, which may worsen over time as the model remains...
Individual fairness in machine learning requires that similar individuals receive similar predictions. Most existing definitions are pairwise in nature, imposing a Lipschitz constraint that must hold either globally across all pairs of data instances or locally within specified neighborhoods. In practice, however, such...
Mitigating unfair disparities in sequential decision-making is a growing concern in machine learning. We study contextual bandits under a global covariate-based Lipschitz fairness constraint, pioneered by \cite{dwork2012fairness}, requiring individuals with similar contexts to receive similar action distributions. We s...
Geng-Yu Xue, Fan Wang, Fei-Yu Jiang et al.· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
MIT News · Artificial Intelligence· news.mit.eduSep 29, 2026
Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.