Cryptology ePrint Archive: Report 2018/911

Achieving Fair Treatment in Algorithmic Classification

Andrew Morgan and Rafael Pass

Abstract: Fairness in classification has become an increasingly relevant and controversial issue as computers replace humans in many of today’s classification tasks. In particular, a subject of much recent debate is that of finding, and subsequently achieving, suitable definitions of fairness in an algorithmic context. In this work, following the work of Hardt et al. (NIPS’16), we consider and formalize the task of sanitizing an unfair classifier C into a classifier C' satisfying an approximate notion of "equalized odds", or fair treatment. Our main result shows how to take any (possibly unfair) classifier C over a finite outcome space, and transform it—-by just perturbing the output of C—according to some distribution learned by just having black-box access to samples of labeled, and previously classified, data, to produce a classifier C' that satisfies fair treatment; we additionally show that our derived classifier is near-optimal in terms of accuracy. We also experimentally evaluate the performance of our method.

Category / Keywords: applications / fairness, classification, black-box algorithms, fair treatment, differential privacy

Original Publication (with major differences): IACR-TCC-2018

Date: received 25 Sep 2018, last revised 17 Oct 2018

Contact author: asmorgan at cs cornell edu

Available format(s): PDF | BibTeX Citation

Note: Full version of a paper (by the same title) to appear in TCC 2018.

Version: 20181017:220904 (All versions of this report)

Short URL: ia.cr/2018/911


[ Cryptology ePrint archive ]