To Pool or Not To Pool: Analyzing the Regularizing Effects of Group-Fair Training on Shared Models
Not on the map. Why?
Abstract (arXiv)
In fair machine learning, one source of performance disparities between groups is over-fitting to groups with relatively few training samples. We derive group-specific bounds on the generalization error of welfare-centric fair machine learning that benefit from the larger sample size of the majority group. We do this by considering group-specific Rademacher averages over a restricted hypothesis class, which contains the family of models likely to perform well with respect to a fair learning objective (e.g., a power-mean). Our simulations demonstrate these bounds improve over a naive method, as expected by theory, with particularly significant improvement for smaller group sizes.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 52 references that are in the map. First posted on arXiv 29 Feb 2024.
Builds on
17 of 52 references.
References · 17
- 2021Convex optimizationcited by 2,479
- 2019A Survey on Bias and Fairness in Machine Learningcited by 1,911
- 2017A Survey on Multi-Task Learningcited by 838
- 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
- 2020Fairness without Demographics through Adversarially Reweighted Learningcited by 251
- 2017A Rewriting System for Convex Optimization Problemscited by 178
- 2020Minimax Pareto Fairness: A Multi Objective Perspectivecited by 152
- 2018Why Is My Classifier Discriminatory?cited by 143
- 2019Distributionally Robust Language Modelingcited by 142
- 2019Accuracy comparison across face recognition algorithms: Where are we on measuring race bias?cited by 56
- 2020Active Sampling for Min-Max Fairnesscited by 33
- 2021Adaptive Sampling for Minimax Fair Classificationcited by 24
5 more
- 2021An Axiomatic Theory of Provably-Fair Welfare-Centric Machine Learningcited by 18
- 2020To Split or Not to Split: The Impact of Disparate Treatment in Classificationcited by 14
- 2020Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuationscited by 8
- 2022A General Framework for Fair Allocation under Matroid Rank Valuationscited by 4
- 2023The Good, the Bad and the Submodular: Fairly Allocating Mixed Manna Under Order-Neutral Submodular Preferencescited by 2
Built on by
Not cited yet.