Fair Active Learning in Low-Data Regimes
Not on the map. Why?
Abstract (arXiv)
In critical machine learning applications, ensuring fairness is essential to avoid perpetuating social inequities. In this work, we address the challenges of reducing bias and improving accuracy in data-scarce environments, where the cost of collecting labeled data prohibits the use of large, labeled datasets. In such settings, active learning promises to maximize marginal accuracy gains of small amounts of labeled data. However, existing applications of active learning for fairness fail to deliver on this, typically requiring large labeled datasets, or failing to ensure the desired fairness tolerance is met on the population distribution. To address such limitations, we introduce an innovative active learning framework that combines an exploration procedure inspired by posterior sampling with a fair classification subroutine. We demonstrate that this framework performs effectively in very data-scarce regimes, maximizing accuracy while satisfying fairness constraints with high probability. We evaluate our proposed approach using well-established real-world benchmark datasets and compare it against state-of-the-art methods, demonstrating its effectiveness in producing fair models, and improvement over existing methods.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 28 of its 45 references that are in the map. First posted on arXiv 13 Dec 2023.
Builds on
28 of 45 references.
References · 28
- 2016Equality of Opportunity in Supervised Learningcited by 2,000
- 2018Mitigating Unwanted Biases with Adversarial Learningcited by 663
- 2018A Reductions Approach to Fair Classificationcited by 585
- 2016Inherent Trade-Offs in the Fair Determination of Risk Scorescited by 582
- 2017Algorithmic decision making and the cost of fairnesscited by 402
- 2017Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairnesscited by 381
- 2018Empirical Risk Minimization under Fairness Constraintscited by 226
- 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 218
- 2020Fairness in Machine Learningcited by 194
- 2017Deep Exploration via Randomized Value Functionscited by 155
- 2022Bias Mitigation for Machine Learning Classifiers: A Comprehensive Surveycited by 125
- 2014Generalization and Exploration via Randomized Value Functionscited by 112
16 more
- 2019Randomized Exploration in Generalized Linear Banditscited by 70
- 2020Stochastic Bandits with Linear Constraintscited by 68
- 2019Worst-Case Regret Bounds for Exploration via Randomized Value Functionscited by 57
- 2016Conservative Contextual Linear Banditscited by 56
- 2018Training Well-Generalizing Classifiers for Fairness Metrics and Other Data-Dependent Constraintscited by 53
- 2019Equalized odds postprocessing under imperfect group informationcited by 48
- 2020Active Sampling for Min-Max Fairnesscited by 33
- 2020Fair Active Learningcited by 30
- 2021Best Arm Identification with Safety Constraintscited by 25
- 2021Adaptive Sampling for Minimax Fair Classificationcited by 24
- 2022Adaptive Sampling Strategies to Construct Equitable Training Datasetscited by 18
- 2022Active Learning with Safety Constraintscited by 16
- 2021Can Active Learning Preemptively Mitigate Fairness Issues?cited by 15
- 2021Improved Algorithms for Agnostic Pool-based Active Classificationcited by 15
- 2021Selective Sampling for Online Best-arm Identificationcited by 6
- 2022FAL-CUR: Fair Active Learning using Uncertainty and Representativeness on Fair Clusteringcited by 6
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.