mlsanityData to 7 Oct 2026

Fair Classification with Partial Feedback: An Exploration-Based Data Collection Approach

arXiv 2402.11338 ↗First posted 17 Feb 2024cs.LG cs.AI cs.CYcited by 2

Not on the map. Why?

Abstract (arXiv)

In many predictive contexts (e.g., credit lending), true outcomes are only observed for samples that were positively classified in the past. These past observations, in turn, form training datasets for classifiers that make future predictions. However, such training datasets lack information about the outcomes of samples that were (incorrectly) negatively classified in the past and can lead to erroneous classifiers. We present an approach that trains a classifier using available data and comes with a family of exploration strategies to collect outcome data about subpopulations that otherwise would have been ignored. For any exploration strategy, the approach comes with guarantees that (1) all sub-populations are explored, (2) the fraction of false positives is bounded, and (3) the trained classifier converges to a ``desired'' classifier. The right exploration strategy is context-dependent; it can be chosen to improve learning guarantees and encode context-specific group fairness properties. Evaluation on real-world datasets shows that this approach consistently boosts the quality of collected outcome data and improves the fraction of true positives for all groups, with only a small reduction in predictive utility.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 25 of its 49 references that are in the map. First posted on arXiv 17 Feb 2024.

Builds on

25 of 49 references.

References · 25

  1. 2019A Survey on Bias and Fairness in Machine Learningcited by 1,911
  2. 2018A Reductions Approach to Fair Classificationcited by 585
  3. 2021Retiring Adult: New Datasets for Fair Machine Learningcited by 443
  4. 2016Fairness Beyond Disparate Treatment & Disparate Impact: Learning Classification without Disparate Mistreatmentcited by 368
  5. 2018Classification with Fairness Constraints: A Meta-Algorithm with Provable Guaranteescited by 146
  6. 2017Runaway Feedback Loops in Predictive Policingcited by 97
  7. 2018Fairness Under Unawareness: Assessing Disparity When Protected Class Is Unobservedcited by 94
  8. 2019Assessing Algorithmic Fairness with Unobserved Protected Class Using Data Combinationcited by 79
  9. 2020Robust Optimization for Fairness with Noisy Protected Groupscited by 78
  10. 2019Achieving Fairness in the Stochastic Multi-armed Bandit Problemcited by 77
  11. 2021Characterizing Fairness Over the Set of Good Models Under Selective Labelscited by 65
  12. 2019Algorithms for Fairness in Sequential Decision Makingcited by 53
13 more
  1. 2018Residual Unfairness in Fair Machine Learning from Prejudiced Datacited by 49
  2. 2019Equal Opportunity in Online Classification with Partial Feedbackcited by 34
  3. 2020Active Sampling for Min-Max Fairnesscited by 33
  4. 2021Fair Classification with Adversarial Perturbationscited by 23
  5. 2018Learning under selective labels in the presence of expert consistencycited by 18
  6. 2022Adaptive Sampling Strategies to Construct Equitable Training Datasetscited by 18
  7. 2023Performance Scaling via Optimal Transport: Enabling Data Selection from Partially Revealed Sourcescited by 16
  8. 2022Don't Throw it Away! The Utility of Unlabeled Data in Fair Decision Makingcited by 12
  9. 2021Fairness for AUC via Feature Augmentationcited by 9
  10. 2022Addressing Strategic Manipulation Disparities in Fair Classificationcited by 8
  11. 2021Adaptive Data Debiasing through Bounded Explorationcited by 5
  12. 2021Neural Pseudo-Label Optimism for the Bank Loan Problemcited by 3
  13. 2022More Data Can Lead Us Astray: Active Data Acquisition in the Presence of Label Biascited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.