2000 character limit reached
Learning Non-Discriminatory Predictors (1702.06081v3)
Published 20 Feb 2017 in cs.LG
Abstract: We consider learning a predictor which is non-discriminatory with respect to a "protected attribute" according to the notion of "equalized odds" proposed by Hardt et al. [2016]. We study the problem of learning such a non-discriminatory predictor from a finite training set, both statistically and computationally. We show that a post-hoc correction approach, as suggested by Hardt et al, can be highly suboptimal, present a nearly-optimal statistical procedure, argue that the associated computational problem is intractable, and suggest a second moment relaxation of the non-discrimination definition for which learning is tractable.
- Blake Woodworth (30 papers)
- Suriya Gunasekar (34 papers)
- Mesrob I. Ohannessian (12 papers)
- Nathan Srebro (145 papers)