Adversarial Reweighting Guided by Wasserstein Distance for Bias Mitigation
Not on the map. Why?
Abstract (arXiv)
The unequal representation of different groups in a sample population can lead to discrimination of minority groups when machine learning models make automated decisions. To address these issues, fairness-aware machine learning jointly optimizes two (or more) metrics aiming at predictive effectiveness and low unfairness. However, the inherent under-representation of minorities in the data makes the disparate treatment of subpopulations less noticeable and difficult to deal with during learning. In this paper, we propose a novel adversarial reweighting method to address such representation bias. To balance the data distribution between the majority and the minority groups, our approach deemphasizes samples from the majority group. To minimize empirical risk, our method prefers samples from the majority group that are close to the minority group as evaluated by the Wasserstein distance. Our theoretical analysis shows the effectiveness of our adversarial reweighting approach. Experiments demonstrate that our approach mitigates bias without sacrificing classification accuracy, outperforming related state-of-the-art methods on image and tabular benchmark datasets.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 21 of its 30 references that are in the map. First posted on arXiv 21 Nov 2023.
Builds on
21 of 30 references.
References · 21
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2014Deep Learning Face Attributes in the Wildcited by 3,679
- 2017Improved Training of Wasserstein GANscited by 2,223
- 2016Fair prediction with disparate impact: A study of bias in recidivism prediction instrumentscited by 671
- 2017Wasserstein GANcited by 635
- 2021Deep Neural Networks and Tabular Data: A Surveycited by 489
- 2018Learning Adversarially Fair and Transferable Representationscited by 353
- 2018Learning Not to Learn: Training Deep Neural Networks with Biased Datacited by 255
- 2019Flexibly Fair Representation Learning by Disentanglementcited by 196
- 2017A Convex Framework for Fair Regressioncited by 147
9 more
- 2019Identifying and Correcting Label Bias in Machine Learningcited by 146
- 2019Wasserstein Fair Classificationcited by 131
- 2019Why Can't I Dance in the Mall? Learning to Mitigate Scene Bias in Action Recognitioncited by 117
- 2018Deep Imbalanced Learning for Face Recognition and Attribute Predictioncited by 90
- 2018Achieving Fairness through Adversarial Learning: an Application to Recidivism Predictioncited by 77
- 2019Learning Optimal and Fair Decision Trees for Non-Discriminative Decision-Makingcited by 75
- 2021Wasserstein GANs Work Because They Fail (to Approximate the Wasserstein Distance)cited by 33
- 2019How Well Do WGANs Estimate the Wasserstein Metric?cited by 15
- 2021Fairness with Continuous Optimal Transportcited by 9
Built on by
Citing papers per year: 2024: 1.
1 paper.