An Effective Theory of Bias Amplification
Arjun Subramonian, Samuel J. Bell, Levent Sagun, Elvis Dohmatob
Abstract
Machine learning models can capture and amplify biases present in data, leading to disparate test performance across social groups. To better understand, evaluate, and mitigate these biases, a deeper theoretical understanding of how model design choices and data distribution properties contribute to bias is needed. In this work, we contribute a precise analytical theory in the context of ridge regression, both with and without random projections, where the former models feedforward neural networks in a simplified regime. Our theory offers a unified and rigorous explanation of machine learning bias, providing insights into phenomena such as bias amplification and minority-group bias in various feature and parameter regimes. For example, we observe that there may be an optimal regularization penalty or training time to avoid bias amplification, and there can be differences in test error between groups that are not alleviated with increased parameterization. Importantly, our theoretical predictions align with empirical observations reported in the literature on machine learning bias. We extensively empirically validate our theory on synthetic and semi-synthetic datasets.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ef77cc47-baee-4860-be3c-e13f5a758872Cited by top-tier papers3
- When majority rules, minority loses: bias amplification of gradient descentFrançois Bachoc, Jérôme Bolte, Ryan Boustany, Jean-Michel LoubesNeurIPS 2025 · 3 citations
- DPA: A one-stop metric to measure bias amplification in classification datasetsBhanu Tokas, Rahul Nair, Hannah KernerNeurIPS 2025 · 1 citation
- Correcting Overparameterization Effects in Fair Empirical Risk MinimizationXiaoyi MAI, Jean-Michel LoubesICML 2026
Builds on13
- An Investigation of Why Overparameterization Exacerbates Spurious CorrelationsShiori Sagawa, Aditi Raghunathan, Pang Wei Koh, Percy LiangICML 2020 · 436 citations
- Double Trouble in Double Descent: Bias and Variance(s) in the Lazy RegimeStéphane d'Ascoli, Maria Refinetti, Giulio Biroli, Florent KrzakalaICML 2020 · 163 citations
- The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of GeneralizationBen Adlam, Jeffrey PenningtonICML 2020 · 133 citations
- Understanding Double Descent Requires A Fine-Grained Bias-Variance DecompositionBen Adlam, Jeffrey PenningtonNeurIPS 2020 · 111 citations
- Generalization Error Rates in Kernel Regression: The Crossover from the Noiseless to Noisy RegimeHugo Cui, Bruno Loureiro, Florent Krzakala, Lenka ZdeborováNeurIPS 2021 · 109 citations
Related papers
- No Free Lunch from Random Feature Ensembles: Scaling Laws and Near-Optimality ConditionsBenjamin S. Ruben, William Lingxiao Tong, Hamza Tahir Chaudhry, Cengiz PehlevanICML 2025
- Spurious Correlations in High Dimensional Regression: The Roles of Regularization, Simplicity Bias and Over-ParameterizationSimone Bombari, Marco MondelliICML 2025
- More is Better: when Infinite Overparameterization is Optimal and Overfitting is ObligatoryJames B. Simon, Dhruva Karkada, Nikhil Ghosh, Mikhail BelkinICLR 2024 · 7 citations
- Theoretical Limitations of Ensembles in the Age of OverparameterizationNiclas Dern, John Patrick Cunningham, Geoff PleissICML 2025
- FairWire: Fair Graph GenerationOyku Deniz Kose, Yanning ShenNeurIPS 2024 · 14 citations
