FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data
Not on the map. Why?
Abstract (arXiv)
Fairness-aware learning aims at constructing classifiers that not only make accurate predictions, but also do not discriminate against specific groups. It is a fast-growing area of machine learning with far-reaching societal impact. However, existing fair learning methods are vulnerable to accidental or malicious artifacts in the training data, which can cause them to unknowingly produce unfair classifiers. In this work we address the problem of fair learning from unreliable training data in the robust multisource setting, where the available training data comes from multiple sources, a fraction of which might not be representative of the true data distribution. We introduce FLEA, a filtering-based algorithm that identifies and suppresses those data sources that would have a negative impact on fairness or accuracy if they were used for training. As such, FLEA is not a replacement of prior fairness-aware learning methods but rather an augmentation that makes any of them robust against unreliable training data. We show the effectiveness of our approach by a diverse range of experiments on multiple datasets. Additionally, we prove formally that -- given enough data -- FLEA protects the learner against corruptions as long as the fraction of affected data sources is less than half. Our source code and documentation are available at https://github.com/ISTAustria-CVML/FLEA.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 37 of its 80 references that are in the map. First posted on arXiv 22 Jun 2021.
Builds on
37 of 80 references.
References · 37
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2016Equality of Opportunity in Supervised Learningcited by 2,007
- 2019A Survey on Bias and Fairness in Machine Learningcited by 1,917
- 2020Ditto: Fair and Robust Federated Learning Through Personalizationcited by 672
- 2018Mitigating Unwanted Biases with Adversarial Learningcited by 663
- 2018A Reductions Approach to Fair Classificationcited by 587
- 2016Fairness Beyond Disparate Treatment & Disparate Impact: Learning Classification without Disparate Mistreatmentcited by 369
- 2020Fairness without Demographics through Adversarially Reweighted Learningcited by 251
- 2018Empirical Risk Minimization under Fairness Constraintscited by 226
- 2017Data Decisions and Theoretical Implications when Adversarially Learning Fair Representationscited by 165
- 2021Adversarial Examples Make Strong Poisonscited by 119
25 more
- 2021Fair Mixup: Fairness via Interpolationcited by 109
- 2020Tilted Empirical Risk Minimizationcited by 106
- 2020Fair Regression with Wasserstein Barycenterscited by 100
- 2016Learning from Untrusted Datacited by 90
- 2019Assessing Algorithmic Fairness with Unobserved Protected Class Using Data Combinationcited by 79
- 2020Robust Optimization for Fairness with Noisy Protected Groupscited by 78
- 2018Achieving Fairness through Adversarial Learning: an Application to Recidivism Predictioncited by 77
- 2019Learning to Confuse: Generating Training Time Adversarial Data with Auto-Encodercited by 70
- 2020FR-Train: A Mutual Information-Based Approach to Fair and Robust Trainingcited by 52
- 2017Learning From Noisy Singly-labeled Datacited by 50
- 2019Repairing without Retraining: Avoiding Disparate Impact with Counterfactual Distributionscited by 48
- 2020Exacerbating Algorithmic Bias through Fairness Attackscited by 47
- 2019Noise-tolerant fair classificationcited by 40
- 2020Ensuring Fairness Beyond the Training Datacited by 35
- 2020Mitigating Bias in Set Selection with Noisy Protected Attributescited by 29
- 2020A No-Free-Lunch Theorem for MultiTask Learningcited by 28
- 2019Robust Learning from Untrusted Sourcescited by 27
- 2021Fair Classification with Adversarial Perturbationscited by 23
- 2019Learning Fair Representations for Kernel Modelscited by 17
- 2017Learning Discrete Distributions from Untrusted Batchescited by 14
- 2020On the Sample Complexity of Adversarial Multi-Source PAC Learningcited by 11
- 2019Optimal Robust Learning of Discrete Distributions from Batchescited by 10
- 2019Efficiently Learning Structured Distributions from Untrusted Batchescited by 8
- 2020A General Method for Robust Learning from Batchescited by 8
- 2017Efficient PAC Learning from the Crowdcited by 7
Built on by
Not cited yet.