mlsanityData to 14 Oct 2026

Fairness Without Harm: An Influence-Guided Active Sampling Approach

arXiv 2402.12789 ↗First posted 20 Feb 2024cs.LG cs.AIcited by 12

Not on the map. Why?

Abstract (arXiv)

The pursuit of fairness in machine learning (ML), ensuring that the models do not exhibit biases toward protected demographic groups, typically results in a compromise scenario. This compromise can be explained by a Pareto frontier where given certain resources (e.g., data), reducing the fairness violations often comes at the cost of lowering the model accuracy. In this work, we aim to train models that mitigate group fairness disparity without causing harm to model accuracy. Intuitively, acquiring more data is a natural and promising approach to achieve this goal by reaching a better Pareto frontier of the fairness-accuracy tradeoff. The current data acquisition methods, such as fair active learning approaches, typically require annotating sensitive attributes. However, these sensitive attribute annotations should be protected due to privacy and safety concerns. In this paper, we propose a tractable active data sampling algorithm that does not rely on training group annotations, instead only requiring group annotations on a small validation set. Specifically, the algorithm first scores each new example by its influence on fairness and accuracy evaluated on the validation dataset, and then selects a certain number of examples for training. We theoretically analyze how acquiring more data can improve fairness without causing harm, and validate the possibility of our sampling approach in the context of risk disparity. We also provide the upper bound of generalization error and risk disparity as well as the corresponding connections. Extensive experiments on real-world data demonstrate the effectiveness of our proposed algorithm. Our code is available at https://github.com/UCSC-REAL/FairnessWithoutHarm.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 51 of its 83 references that are in the map. First posted on arXiv 20 Feb 2024.

Builds on

51 of 83 references.

References · 51

  1. 2014Deep Learning Face Attributes in the Wildcited by 3,693
  2. 2016Equality of Opportunity in Supervised Learningcited by 2,007
  3. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  4. 2014Certifying and removing disparate impactcited by 715
  5. 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 665
  6. 2018A Reductions Approach to Fair Classificationcited by 587
  7. 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 523
  8. 2019Does Learning Require Memorization? A Short Tale about a Long Tailcited by 460
  9. 2017On Fairness and Calibrationcited by 406
  10. 2019Fair Resource Allocation in Federated Learningcited by 394
  11. 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 381
  12. 2018Fairness Without Demographics in Repeated Loss Minimizationcited by 364
38 more
  1. 2020Combating noisy labels by agreement: A joint training method with co-regularizationcited by 289
  2. 2018Improving fairness in machine learning systems: What do industry practitioners need?cited by 262
  3. 2020Fairness without Demographics through Adversarially Reweighted Learningcited by 251
  4. 2018Empirical Risk Minimization under Fairness Constraintscited by 226
  5. 2020No Subclass Left Behind: Fine-Grained Robustness in Coarse-Grained Classification Problemscited by 209
  6. 2019Fair Regression: Quantitative Definitions and Reduction-based Algorithmscited by 168
  7. 2019REPAIR: Removing Representation Bias by Dataset Resamplingcited by 157
  8. 2020Minimax Pareto Fairness: A Multi Objective Perspectivecited by 153
  9. 2019Identifying and Correcting Label Bias in Machine Learningcited by 146
  10. 2019Inherent Tradeoffs in Learning Fair Representationscited by 144
  11. 2018Why Is My Classifier Discriminatory?cited by 143
  12. 2022Training Data Influence Analysis and Estimation: A Surveycited by 135
  13. 2019Fair Generative Modeling via Weak Supervisioncited by 114
  14. 2021Influence Selection for Active Learningcited by 84
  15. 2020Fair Classification with Group-Dependent Label Noisecited by 67
  16. 2020"What We Can't Measure, We Can't Understand": Challenges to Demographic Data Procurement in the Pursuit of Fairnesscited by 56
  17. 2021Towards Fair Classifiers Without Sensitive Attributes: Exploring Biases in Related Featurescited by 45
  18. 2022Achieving Fairness at No Utility Cost via Data Reweighing with Influencecited by 38
  19. 2019Toward a better trade-off between performance and fairness with kernel-based distribution matchingcited by 36
  20. 2023Active Finetuning: Exploiting Annotation Budget in the Pretraining-Finetuning Paradigmcited by 36
  21. 2021Understanding and Improving Fairness-Accuracy Trade-offs in Multi-Task Learningcited by 34
  22. 2022On Learning Fairness and Accuracy on Multiple Subgroupscited by 32
  23. 2020Fair Active Learningcited by 30
  24. 2022Bias Mimicking: A Simple Sampling Approach for Bias Mitigationcited by 30
  25. 2021The Rich Get Richer: Disparate Impact of Semi-Supervised Learningcited by 28
  26. 2022Fairness Transferability Subject to Bounded Distribution Shiftcited by 28
  27. 2022Understanding Instance-Level Impact of Fairness Constraintscited by 27
  28. 2020The Fairness-Accuracy Pareto Frontcited by 26
  29. 2018Assessing and Remedying Coverage for a Given Datasetcited by 21
  30. 2021Boosting Active Learning via Improving Test Performancecited by 19
  31. 2022Weak Proxies are Sufficient and Preferable for Fairness with Missing Sensitive Attributescited by 17
  32. 2019Fairness With Minimal Harm: A Pareto-Optimal Approach For Healthcarecited by 16
  33. 2021Can Active Learning Preemptively Mitigate Fairness Issues?cited by 15
  34. 2023Improving Fair Training under Correlation Shiftscited by 14
  35. 2023Post-hoc Bias Scoring Is Optimal For Fair Classificationcited by 14
  36. 2020Slice Tuner: A Selective Data Acquisition Framework for Accurate and Fair Machine Learning Modelscited by 13
  37. 2019What is Fair? Exploring Pareto-Efficiency for Fairness Constrained Classifierscited by 12
  38. 2018Importance Weighted Generative Networkscited by 7

50 most cited of 51 All 51 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 6; 2026: 5.

12 papers.