10 Years of Fair Representations: Challenges and Opportunities
Not on the map. Why?
Abstract (arXiv)
Fair Representation Learning (FRL) is a broad set of techniques, mostly based on neural networks, that seeks to learn new representations of data in which sensitive or undesired information has been removed. Methodologically, FRL was pioneered by Richard Zemel et al. about ten years ago. The basic concepts, objectives and evaluation strategies for FRL methodologies remain unchanged to this day. In this paper, we look back at the first ten years of FRL by i) revisiting its theoretical standing in light of recent work in deep learning theory that shows the hardness of removing information in neural network representations and ii) presenting the results of a massive experimentation (225.000 model fits and 110.000 AutoML fits) we conducted with the objective of improving on the common evaluation scenario for FRL. More specifically, we use automated machine learning (AutoML) to adversarially "mine" sensitive information from supposedly fair representations. Our theoretical and experimental analysis suggests that deterministic, unquantized FRL methodologies have serious issues in removing sensitive information, which is especially troubling as they might seem "fair" at first glance.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 30 of its 54 references that are in the map. First posted on arXiv 4 Jul 2024.
Builds on
30 of 54 references.
References · 30
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2016Density estimation using Real NVPcited by 2,042
- 2016Equality of Opportunity in Supervised Learningcited by 2,007
- 2015Deep Learning and the Information Bottleneck Principlecited by 802
- 2014Deep Domain Confusion: Maximizing for Domain Invariancecited by 600
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 503
- 2021Retiring Adult: New Datasets for Fair Machine Learningcited by 449
- 2016Fairness Beyond Disparate Treatment & Disparate Impact: Learning Classification without Disparate Mistreatmentcited by 369
- 2018Learning Adversarially Fair and Transferable Representationscited by 353
- 2015The Variational Fair Autoencodercited by 223
- 2017Emergence of Invariance and Disentanglement in Deep Representationscited by 215
18 more
- 2017Controllable Invariance through Adversarial Feature Learningcited by 127
- 2018Invariant Representations without Adversarial Trainingcited by 112
- 2016Measuring Fairness in Ranked Outputscited by 81
- 2018Learning Representations for Neural Network-Based Classification Using the Information Bottleneck Principlecited by 70
- 2020The Information Bottleneck Problem and Its Applications in Machine Learningcited by 66
- 2019Pairwise Fairness for Ranking and Regressioncited by 58
- 2016Learning to Pivot with Adversarial Networkscited by 55
- 2018The age of secrecy and unfairness in recidivism predictioncited by 53
- 2021Fair Normalizing Flowscited by 38
- 2023Beyond Normal: On the Evaluation of Mutual Information Estimatorscited by 37
- 2018Reducing Disparate Exposure in Ranking: A Learning To Rank Approachcited by 33
- 2019AlignFlow: Cycle Consistent Learning from Multiple Domains via Normalizing Flowscited by 33
- 2017Provably Fair Representationscited by 22
- 2022FARE: Provably Fair Representation Learning with Practical Certificatescited by 21
- 2020FaiR-N: Fair and Robust Neural Networks for Structured Datacited by 16
- 2022Fair Group-Shared Representations with Normalizing Flowscited by 5
- 2022Invariant Representations with Stochastically Quantized Neural Networkscited by 4
- 2022Fair Interpretable Representation Learning with Correction Vectorscited by 3
Built on by
Citing papers per year: 2024: 1; 2025: 4; 2026: 1.
6 papers.
- 2024Rethinking Fair Representation Learning for Performance-Sensitive Taskscited by 8
- 2025On Optimal Steering to Achieve Exact Fairnesscited by 2
- 2025Fairness-aware Anomaly Detection via Fair Projectioncited by 1
- 2025Kernel-based Equalized Odds: A Quantification of Accuracy-Fairness Trade-off in Fair Representation Learningcited by 0
- 2025Happiness as a Measure of Fairnesscited by 0
- 2026Is invariance all you need for algorithmic fairness? Removing demographic information can create new biascited by 0
- 2026Is invariance all you need for algorithmic fairness? Removing demographic information can create new bias25 Sep 2026
- 2025Happiness as a Measure of Fairness2 Nov 2025
- 2025On Optimal Steering to Achieve Exact Fairness19 Sep 2025
- 2025Kernel-based Equalized Odds: A Quantification of Accuracy-Fairness Trade-off in Fair Representation Learning20 Aug 2025
- 2025Fairness-aware Anomaly Detection via Fair Projection16 May 2025
- 2024Rethinking Fair Representation Learning for Performance-Sensitive Tasks5 Oct 2024
Similar, not cited
Close in wording, no citation either way
- 2023Towards Poisoning Fair Representations
- 2025Debiasing Diffusion Model: Enhancing Fairness through Latent Representation Learning in Stable Diffusion Model
- 2026Debias Anything: Fairness with Diversity without Supervision in Diffusion Models
- 2026Benchmarking Bias Mitigation Toward Fairness Without Harm from Vision to LVLMs
- 2024INFELM: In-depth Fairness Evaluation of Large Text-To-Image Models
- 2023FroSSL: Frobenius Norm Minimization for Efficient Multiview Self-Supervised Learning
- 2024Generating Synthetic Fair Syntax-agnostic Data by Learning and Distilling Fair Representation
- 2025AIM-Fair: Advancing Algorithmic Fairness via Selectively Fine-Tuning Biased Models with Contextual Synthetic Data