Data Augmentation via Subgroup Mixup for Improving Fairness
Not on the map. Why?
Abstract (arXiv)
In this work, we propose data augmentation via pairwise mixup across subgroups to improve group fairness. Many real-world applications of machine learning systems exhibit biases across certain groups due to under-representation or training data that reflects societal biases. Inspired by the successes of mixup for improving classification performance, we develop a pairwise mixup scheme to augment training data and encourage fair and accurate decision boundaries for all subgroups. Data augmentation for group fairness allows us to add new samples of underrepresented groups to balance subpopulations. Furthermore, our method allows us to use the generalization ability of mixup to improve both fairness and accuracy. We compare our proposed mixup to existing data augmentation and bias mitigation approaches on both synthetic simulations and real-world benchmark fair classification data, demonstrating that we are able to achieve fair outcomes with robust if not improved accuracy.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 14 of its 22 references that are in the map. First posted on arXiv 13 Sep 2023.
Builds on
14 of 22 references.
References · 14
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
- 2016Equality of Opportunity in Supervised Learningcited by 2,000
- 2014Certifying and removing disparate impactcited by 715
- 2018Empirical Risk Minimization under Fairness Constraintscited by 226
- 2021Fair Mixup: Fairness via Interpolationcited by 109
- 2021When and How Mixup Improves Calibrationcited by 59
- 2022C-Mixup: Improving Generalization in Regressioncited by 57
- 2018Training Well-Generalizing Classifiers for Fairness Metrics and Other Data-Dependent Constraintscited by 53
- 2022UMIX: Improving Importance Weighting for Subpopulation Shift via Uncertainty-Aware Mixupcited by 34
- 2017Theory of Deep Learning III: explaining the non-overfitting puzzlecited by 32
- 2022GraphMAD: Graph Mixup for Data Augmentation using Data-Driven Convex Clusteringcited by 13
Built on by
Citing papers per year: 2024: 6; 2025: 2.
8 papers.
- 2024Fair CoVariance Neural Networkscited by 6
- 2024Exploring Empty Spaces: Human-in-the-Loop Data Augmentationcited by 6
- 2024Uplifting Lower-Income Data: Strategies for Socioeconomic Perspective Shifts in Large Multi-modal Modelscited by 2
- 2024ProxiMix: Enhancing Fairness with Proximity Samples in Subgroupscited by 1
- 2024RevMUX: Data Multiplexing with Reversible Adapters for Efficient LLM Batch Inferencecited by 1
- 2025CO-VADA: A Confidence-Oriented Voice Augmentation Debiasing Approach for Fair Speech Emotion Recognitioncited by 1
- 2024Fair MP-BOOST: Fair and Interpretable Minipatch Boostingcited by 0
- 2025Precision Neural Networks: Joint Graph And Relational Learningcited by 0
- 2025Precision Neural Networks: Joint Graph And Relational Learning18 Sep 2025
- 2025CO-VADA: A Confidence-Oriented Voice Augmentation Debiasing Approach for Fair Speech Emotion Recognition6 Jun 2025
- 2024RevMUX: Data Multiplexing with Reversible Adapters for Efficient LLM Batch Inference6 Oct 2024
- 2024ProxiMix: Enhancing Fairness with Proximity Samples in Subgroups2 Oct 2024
- 2024Exploring Empty Spaces: Human-in-the-Loop Data Augmentation1 Oct 2024
- 2024Fair CoVariance Neural Networks13 Sep 2024
- 2024Uplifting Lower-Income Data: Strategies for Socioeconomic Perspective Shifts in Large Multi-modal Models2 Jul 2024
- 2024Fair MP-BOOST: Fair and Interpretable Minipatch Boosting1 Apr 2024