A Convex Framework for Fair Regression

Abstract

We introduce a flexible family of fairness regularizers for (linear and logistic) regression problems. These regularizers all enjoy convexity, permitting fast optimization, and they span the rang from notions of group fairness to strong individual fairness. By varying the weight on the fairness regularizer, we can compute the efficient frontier of the accuracy-fairness trade-off on any given dataset, and we measure the severity of this trade-off via a numerical quantity we call the Price of Fairness (PoF). The centerpiece of our results is an extensive comparative study of the PoF across six different datasets in which fairness is a primary consideration.

References in corpus (2)

• Equality of Opportunity in Supervised Learning
• On the (im)possibility of fairness

Cited by in corpus (9)

• Fighting Fire with Fire: Using Antidote Data to Improve Polarization and Fairness of Recommender Systems
• Two-stage Algorithm for Fairness-aware Machine Learning
• Learning Optimal and Fair Decision Trees for Non-Discriminative Decision-Making
• Fair Forests: Regularized Tree Induction to Minimize Model Bias
• Fast Fair Regression via Efficient Approximations of Mutual Information
• FairST: Equitable Spatial and Temporal Demand Prediction for New Mobility Systems
• Fairness Measures for Regression via Probabilistic Classification
• Fairness and Missing Values
• Learning Fair and Interpretable Representations via Linear Orthogonalization