Preprint
Enforcing Fairness Where It Matters: An Approach Based on Difference-of-Convex Constraints
ArXiV.org
Cornell University
05/18/2025
DOI: 10.48550/arxiv.2505.12530
Abstract
Fairness in machine learning has become a critical concern, particularly in high-stakes applications. Existing approaches often focus on achieving full fairness across all score ranges generated by predictive models, ensuring fairness in both high and low-scoring populations. However, this stringent requirement can compromise predictive performance and may not align with the practical fairness concerns of stakeholders. In this work, we propose a novel framework for building partially fair machine learning models, which enforce fairness within a specific score range of interest, such as the middle range where decisions are most contested, while maintaining flexibility in other regions. We introduce two statistical metrics to rigorously evaluate partial fairness within a given score range, such as the top 20%-40% of scores. To achieve partial fairness, we propose an in-processing method by formulating the model training problem as constrained optimization with difference-of-convex constraints, which can be solved by an inexact difference-of-convex algorithm (IDCA). We provide the complexity analysis of IDCA for finding a nearly KKT point. Through numerical experiments on real-world datasets, we demonstrate that our framework achieves high predictive performance while enforcing partial fairness where it matters most.
Details
- Title: Subtitle
- Enforcing Fairness Where It Matters: An Approach Based on Difference-of-Convex Constraints
- Creators
- Yutian HeYankun HuangYao YaoQihang Lin
- Resource Type
- Preprint
- Publication Details
- ArXiV.org
- DOI
- 10.48550/arxiv.2505.12530
- ISSN
- 2331-8422
- Publisher
- Cornell University; Ithaca, New York
- Language
- English
- Date posted
- 05/18/2025
- Academic Unit
- Business Analytics
- Record Identifier
- 9984824298802771
Metrics
4 Record Views