Timezone: »

Noise-tolerant fair classification
Alex Lamy · Ziyuan Zhong · Aditya Menon · Nakul Verma

Thu Dec 12 10:45 AM -- 12:45 PM (PST) @ East Exhibition Hall B + C #81

Fairness-aware learning involves designing algorithms that do not discriminate with respect to some sensitive feature (e.g., race or gender). Existing work on the problem operates under the assumption that the sensitive feature available in one's training sample is perfectly reliable. This assumption may be violated in many real-world cases: for example, respondents to a survey may choose to conceal or obfuscate their group identity out of fear of potential discrimination. This poses the question of whether one can still learn fair classifiers given noisy sensitive features. In this paper, we answer the question in the affirmative: we show that if one measures fairness using the mean-difference score, and sensitive features are subject to noise from the mutually contaminated learning model, then owing to a simple identity we only need to change the desired fairness-tolerance. The requisite tolerance can be estimated by leveraging existing noise-rate estimators from the label noise literature. We finally show that our procedure is empirically effective on two case-studies involving sensitive feature censoring.

Author Information

Alex Lamy (Columbia University)
Ziyuan Zhong (Columbia University)
Aditya Menon (Google)
Nakul Verma (Columbia University)

More from the Same Authors