Enhancing Fairness through Reweighting: A Path to Attain the Sufficiency Rule
Not on the map. Why?
Abstract (arXiv)
We introduce an innovative approach to enhancing the empirical risk minimization (ERM) process in model training through a refined reweighting scheme of the training data to enhance fairness. This scheme aims to uphold the sufficiency rule in fairness by ensuring that optimal predictors maintain consistency across diverse sub-groups. We employ a bilevel formulation to address this challenge, wherein we explore sample reweighting strategies. Unlike conventional methods that hinge on model size, our formulation bases generalization complexity on the space of sample weights. We discretize the weights to improve training speed. Empirical validation of our method showcases its effectiveness and robustness, revealing a consistent improvement in the balance between prediction performance and fairness metrics across various experiments.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 29 of its 50 references that are in the map. First posted on arXiv 26 Aug 2024.
Builds on
29 of 50 references.
References · 29
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2014Deep Learning Face Attributes in the Wildcited by 3,679
- 2016Equality of Opportunity in Supervised Learningcited by 2,000
- 2019Invariant Risk Minimizationcited by 1,832
- 2020In Search of Lost Domain Generalizationcited by 1,042
- 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 737
- 2016Fair prediction with disparate impact: A study of bias in recidivism prediction instrumentscited by 671
- 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 580
- 2015Causal inference using invariant prediction: identification and confidence intervalscited by 533
- 2018Learning Adversarially Fair and Transferable Representationscited by 353
17 more
- 2019Optimizing Millions of Hyperparameters by Implicit Differentiationcited by 303
- 2020The Risks of Invariant Risk Minimizationcited by 262
- 2016Hyperparameter optimization with approximate gradientcited by 231
- 2020On the Iteration Complexity of Hypergradient Computationcited by 154
- 2020Invariant Rationalizationcited by 131
- 2018Invariance, Causality and Robustnesscited by 123
- 2020Fair Regression with Wasserstein Barycenterscited by 99
- 2021A Clarification of the Nuances in the Fairness Metrics Landscapecited by 98
- 2018Learning Controllable Fair Representationscited by 83
- 2020An Empirical Study of Invariant Risk Minimizationcited by 35
- 2021Iterative Feature Matching: Toward Provable Domain Generalization with Logarithmic Environmentscited by 30
- 2022Fair Representation Learning through Implicit Path Alignmentcited by 22
- 2020Risk Variance Penalizationcited by 21
- 2021Technical Challenges for Training Fair Neural Networkscited by 20
- 2021Learning Representations that Support Robust Transfer of Predictorscited by 17
- 2023Causal Fairness-Guided Dataset Reweighting using Neural Networkscited by 1
- 2023Adversarial Reweighting Guided by Wasserstein Distance for Bias Mitigationcited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.