Fair Bayesian Data Selection via Generalized Discrepancy Measures
Not on the map. Why?
Abstract (arXiv)
Fairness concerns are increasingly critical as machine learning models are deployed in high-stakes applications. While existing fairness-aware methods typically intervene at the model level, they often suffer from high computational costs, limited scalability, and poor generalization. To address these challenges, we propose a Bayesian data selection framework that ensures fairness by aligning group-specific posterior distributions of model parameters and sample weights with a shared central distribution. Our framework supports flexible alignment via various distributional discrepancy measures, including Wasserstein distance, maximum mean discrepancy, and f-divergence, allowing geometry-aware control without imposing explicit fairness constraints. This data-centric approach mitigates group-specific biases in training data and improves fairness in downstream tasks, with theoretical guarantees. Experiments on benchmark datasets show that our method consistently outperforms existing data selection and model-based fairness methods in both fairness and accuracy.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 44 references that are in the map. First posted on arXiv 10 Nov 2025.
Builds on
22 of 44 references.
References · 22
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2018Mitigating Unwanted Biases with Adversarial Learningcited by 663
- 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
- 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 323
- 2018Empirical Risk Minimization under Fairness Constraintscited by 226
- 2015The Variational Fair Autoencodercited by 223
- 2019Flexibly Fair Representation Learning by Disentanglementcited by 196
- 2015Online Batch Selection for Faster Training of Neural Networkscited by 121
- 2020FairBatch: Batch Selection for Model Fairnesscited by 99
- 2021Learning Fast Sample Re-weighting Without Reward Datacited by 69
10 more
- 2020Confidence Scores Make Instance-dependent Label-noise Learning Possiblecited by 63
- 2021LongReMix: Robust Learning with High Confidence Samples in a Noisy Label Environmentcited by 40
- 2016A statistical framework for fair predictive algorithmscited by 37
- 2021A Stochastic Optimization Framework for Fair Risk Minimizationcited by 26
- 2024Post-Training Attribute Unlearning in Recommender Systemscited by 23
- 2017Learning What Data to Learncited by 21
- 2023Adaptive Training Distributions with Scalable Online Bilevel Optimizationcited by 11
- 2015Fairness Constraints: Mechanisms for Fair Classificationcited by 10
- 2024A Bayesian Approach to Data Point Selectioncited by 3
- 2025Personalized Bayesian Federated Learning with Wasserstein Barycenter Aggregationcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.