Aggregating Concepts of Fairness and Accuracy in Prediction Algorithms
David Kinney

TL;DR
This paper proposes a method to balance fairness and accuracy in predictive algorithms by using a linear combination of metrics, grounded in preference aggregation theory, and applies it to real-world data.
Contribution
It introduces a formal framework for aggregating fairness and accuracy measures in prediction algorithms using Harsanyi's preference aggregation result.
Findings
Linear combination of fairness and accuracy metrics effectively balances trade-offs.
Application to COMPAS dataset demonstrates practical utility.
Provides normative guidelines for fairness-accuracy trade-offs.
Abstract
An algorithm that outputs predictions about the state of the world will almost always be designed with the implicit or explicit goal of outputting accurate predictions (i.e., predictions that are likely to be true). In addition, the rise of increasingly powerful predictive algorithms brought about by the recent revolution in artificial intelligence has led to an emphasis on building predictive algorithms that are fair, in the sense that their predictions do not systematically evince bias or bring about harm to certain individuals or groups. This state of affairs presents two conceptual challenges. First, the goals of accuracy and fairness can sometimes be in tension, and there are no obvious normative guidelines for managing the trade-offs between these two desiderata when they arise. Second, there are many distinct ways of measuring both the accuracy and fairness of a predictive…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEthics and Social Impacts of AI
