arXiv Analytics

Sign in

arXiv:2002.07676 [cs.LG]AbstractReferencesReviewsResources

A Resolution in Algorithmic Fairness: Calibrated Scores for Fair Classifications

Claire Lazar, Suhas Vijaykumar

Published 2020-02-18Version 1

Calibration and equal error rates are fundamental conditions for algorithmic fairness that have been shown to conflict with each other, suggesting that they cannot be satisfied simultaneously. This paper shows that the two are in fact compatible and presents a method for reconciling them. In particular, we derive necessary and sufficient conditions for the existence of calibrated scores that yield classifications achieving equal error rates. We then present an algorithm that searches for the most informative score subject to both calibration and minimal error rate disparity. Applied empirically to credit lending, our algorithm provides a solution that is more fair and profitable than a common alternative that omits sensitive features.

Related articles: Most relevant | Search more
arXiv:2307.00252 [cs.LG] (Published 2023-07-01)
An ML approach to resolution of singularities
arXiv:2501.18331 [cs.LG] (Published 2025-01-30)
Stream-Based Monitoring of Algorithmic Fairness
arXiv:2010.07249 [cs.LG] (Published 2020-10-14)
Exchanging Lessons Between Algorithmic Fairness and Domain Generalization