You Only Debias Once: Towards Flexible Accuracy-Fairness Trade-offs at Inference Time
Not on the map. Why?
Abstract (arXiv)
Deep neural networks are prone to various bias issues, jeopardizing their applications for high-stake decision-making. Existing fairness methods typically offer a fixed accuracy-fairness trade-off, since the weight of the well-trained model is a fixed point (fairness-optimum) in the weight space. Nevertheless, more flexible accuracy-fairness trade-offs at inference time are practically desired since: 1) stakes of the same downstream task can vary for different individuals, and 2) different regions have diverse laws or regularization for fairness. If using the previous fairness methods, we have to train multiple models, each offering a specific level of accuracy-fairness trade-off. This is often computationally expensive, time-consuming, and difficult to deploy, making it less practical for real-world applications. To address this problem, we propose You Only Debias Once (YODO) to achieve in-situ flexible accuracy-fairness trade-offs at inference time, using a single model that trained only once. Instead of pursuing one individual fixed point (fairness-optimum) in the weight space, we aim to find a "line" in the weight space that connects the accuracy-optimum and fairness-optimum points using a single model. Points (models) on this line implement varying levels of accuracy-fairness trade-offs. At inference time, by manually selecting the specific position of the learned "line", our proposed method can achieve arbitrary accuracy-fairness trade-offs for different end-users and scenarios. Experimental results on tabular and image datasets show that YODO achieves flexible trade-offs between model accuracy and fairness, at ultra-low overheads. For example, if we need 100 levels of trade-off on the acse dataset, YODO takes 3.53 seconds while training 100 fixed models consumes 425 seconds. The code is available at https://github.com/ahxt/yodo.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 51 of its 82 references that are in the map. First posted on arXiv 10 Mar 2025.
Builds on
51 of 82 references.
References · 51
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Deep Learning Face Attributes in the Wildcited by 3,693
- 2016Wide Residual Networkscited by 3,070
- 2016Equality of Opportunity in Supervised Learningcited by 2,007
- 2019A Survey on Bias and Fairness in Machine Learningcited by 1,917
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
- 2018A Reductions Approach to Fair Classificationcited by 587
- 2021Retiring Adult: New Datasets for Fair Machine Learningcited by 449
- 2020Fairness in Machine Learning: A Surveycited by 370
- 2018Learning Adversarially Fair and Transferable Representationscited by 353
38 more
- 2017Fairness in Criminal Justice Risk Assessments: The State of the Artcited by 315
- 2015The Variational Fair Autoencodercited by 223
- 2020Fairness in Machine Learningcited by 194
- 2015Censoring Representations with an Adversarycited by 192
- 2020Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent Kernelcited by 187
- 2016Fairness in Learning: Classic and Contextual Banditscited by 168
- 2023UniMax: Fairer and more Effective Language Sampling for Large-Scale Multilingual Pretrainingcited by 151
- 2017Fairness in Machine Learning: Lessons from Political Philosophycited by 149
- 2019Inherent Tradeoffs in Learning Fair Representationscited by 144
- 2018Why Is My Classifier Discriminatory?cited by 143
- 2018The Frontiers of Fairness in Machine Learningcited by 141
- 2019Fairness in Deep Learning: A Computational Perspectivecited by 123
- 2021Fair Mixup: Fairness via Interpolationcited by 109
- 2021Learning Neural Network Subspacescited by 82
- 2021Loss Surface Simplexes for Mode Connecting Volumes and Fast Ensemblingcited by 75
- 2021Fairness via Representation Neutralizationcited by 63
- 2019Counterfactual Risk Assessments, Evaluation, and Fairnesscited by 59
- 2019Mathematical Notions vs. Human Perception of Fairness: A Descriptive Approach to Fairness for Machine Learningcited by 57
- 2016Learning to Pivot with Adversarial Networkscited by 55
- 2019Recovering from Biased Data: Can Fairness Constraints Improve Accuracy?cited by 50
- 2015On the relation between accuracy and fairness in binary classificationcited by 48
- 2021Sample Selection for Fair and Robust Trainingcited by 48
- 2022Diagnosing failures of fairness transfer across distribution shift in real-world medical settingscited by 45
- 2017A Short-term Intervention for Long-term Fairness in the Labor Marketcited by 44
- 2020Algorithmic Fairness in Educationcited by 44
- 2020A Distributionally Robust Approach to Fair Classificationcited by 43
- 2020Accuracy and Fairness Trade-offs in Machine Learning: A Stochastic Multi-Objective Approachcited by 39
- 2021Emergent Unfairness in Algorithmic Fairness-Accuracy Trade-Off Researchcited by 34
- 2022Fairness Reprogrammingcited by 33
- 2020The Fairness-Accuracy Pareto Frontcited by 26
- 2022FairGBM: Gradient Boosting with Fairness Constraintscited by 25
- 2023Fairness and Accuracy under Domain Generalizationcited by 24
- 2023Fair Attribute Completion on Graph with Missing Attributescited by 22
- 2022Efficient Conditionally Invariant Representation Learningcited by 19
- 2023Improving Fair Training under Correlation Shiftscited by 14
- 2022Equal Improvability: A New Fairness Notion Considering the Long-term Impactcited by 13
- 2020Learning Fair Scoring Functions: Bipartite Ranking under ROC-based Fairness Constraintscited by 7
- 2022FaiREE: Fair Classification with Finite-Sample and Distribution-Free Guaranteecited by 5
50 most cited of 51 All 51 (JSON)
Built on by
Not cited yet.