Fair-CDA: Continuous and Directional Augmentation for Group Fairness
Not on the map. Why?
Abstract (arXiv)
In this work, we propose it Fair-CDA, a fine-grained data augmentation strategy for imposing fairness constraints. We use a feature disentanglement method to extract the features highly related to the sensitive attributes. Then we show that group fairness can be achieved by regularizing the models on transition paths of sensitive features between groups. By adjusting the perturbation strength in the direction of the paths, our proposed augmentation is controllable and auditable. To alleviate the accuracy degradation caused by fairness constraints, we further introduce a calibrated model to impute labels for the augmented data. Our proposed method does not assume any data generative model and ensures good generalization for both accuracy and fairness. Experimental results show that Fair-CDA consistently outperforms state-of-the-art methods on widely-used benchmarks, e.g., Adult, CelebA and MovieLens. Especially, Fair-CDA obtains an 86.3% relative improvement for fairness while maintaining the accuracy on the Adult dataset. Moreover, we evaluate Fair-CDA in an online recommendation system to demonstrate the effectiveness of our method in terms of accuracy and fairness.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 37 of its 55 references that are in the map. First posted on arXiv 1 Apr 2023.
Builds on
37 of 55 references.
References · 37
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2013Visualizing and Understanding Convolutional Networkscited by 2,278
- 2016Equality of Opportunity in Supervised Learningcited by 2,000
- 2019Invariant Risk Minimizationcited by 1,832
- 2018Sanity Checks for Saliency Mapscited by 1,149
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2017Counterfactual Fairnesscited by 802
- 2014Certifying and removing disparate impactcited by 715
- 2018Mitigating Unwanted Biases with Adversarial Learningcited by 663
- 2018A Reductions Approach to Fair Classificationcited by 585
- 2019Domain Generalization via Model-Agnostic Learning of Semantic Featurescited by 405
25 more
- 2017Deep & Cross Network for Ad Click Predictionscited by 392
- 2018Learning Adversarially Fair and Transferable Representationscited by 353
- 2015The Variational Fair Autoencodercited by 223
- 2019Flexibly Fair Representation Learning by Disentanglementcited by 196
- 2020How Does Mixup Help With Robustness and Generalization?cited by 193
- 2015Censoring Representations with an Adversarycited by 191
- 2018Fairness of Exposure in Rankingscited by 189
- 2018FairGAN: Fairness-aware Generative Adversarial Networkscited by 164
- 2019On the Fairness of Disentangled Representationscited by 144
- 2019Fairness in Recommendation Ranking through Pairwise Comparisonscited by 127
- 2019Compositional Fairness Constraints for Graph Embeddingscited by 126
- 2021Fair Mixup: Fairness via Interpolationcited by 109
- 2018Learning Controllable Fair Representationscited by 83
- 2020Fairness by Learning Orthogonal Disentangled Representationscited by 76
- 2020Controlling Fairness and Bias in Dynamic Learning-to-Rankcited by 67
- 2018iFair: Learning Individually Fair Data Representations for Algorithmic Decision Makingcited by 64
- 2018Stable Prediction across Unknown Environmentscited by 55
- 2018Training Well-Generalizing Classifiers for Fairness Metrics and Other Data-Dependent Constraintscited by 53
- 2019FlipTest: Fairness Testing via Optimal Transportcited by 51
- 2020DecAug: Out-of-Distribution Generalization via Decomposed Feature Representation and Semantic Augmentationcited by 48
- 2019Fairness in Algorithmic Decision Making: An Excursion Through the Lens of Causalitycited by 33
- 2019Learning Fair Representations via an Adversarial Frameworkcited by 29
- 2017Provably Fair Representationscited by 22
- 2021Bias, Fairness, and Accountability with AI and ML Algorithmscited by 3
- 2021Fair Representation Learning using Interpolation Enabled Disentanglementcited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.