A Convex Framework for Fair Regression
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
FairST: Equitable Spatial and Temporal Demand Prediction for New Mobility Systems
FairST combines 1D/2D/3D convolutions with fairness regularization using novel region-based and individual-based fairness gap metrics, reducing fairness gaps over 80% while improving accuracy over LSTMs, ConvLSTMs, an...
-
Fairness Testing for Algorithmic Pricing
Standard OLS fairness tests for deterministic pricing algorithms use invalid standard errors; corrected estimators reveal that all 34 tested Illinois auto insurers discriminate against minority zip codes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.