English

Fairness without Demographics through Adversarially Reweighted Learning

Machine Learning 2020-11-04 v3 Machine Learning

Abstract

Much of the previous machine learning (ML) fairness literature assumes that protected features such as race and sex are present in the dataset, and relies upon them to mitigate fairness concerns. However, in practice factors like privacy and regulation often preclude the collection of protected features, or their use for training or inference, severely limiting the applicability of traditional fairness research. Therefore we ask: How can we train an ML model to improve fairness when we do not even know the protected group memberships? In this work we address this problem by proposing Adversarially Reweighted Learning (ARL). In particular, we hypothesize that non-protected features and task labels are valuable for identifying fairness issues, and can be used to co-train an adversarial reweighting approach for improving fairness. Our results show that {ARL} improves Rawlsian Max-Min fairness, with notable AUC improvements for worst-case protected groups in multiple datasets, outperforming state-of-the-art alternatives.

Keywords

Cite

@article{arxiv.2006.13114,
  title  = {Fairness without Demographics through Adversarially Reweighted Learning},
  author = {Preethi Lahoti and Alex Beutel and Jilin Chen and Kang Lee and Flavien Prost and Nithum Thain and Xuezhi Wang and Ed H. Chi},
  journal= {arXiv preprint arXiv:2006.13114},
  year   = {2020}
}

Comments

To appear at 34th Conference on Neural Information Processing Systems (NeurIPS 2020), Vancouver, Canada

R2 v1 2026-06-23T16:33:41.403Z