Controllable Guarantees for Fair Outcomes via Contrastive Information Estimation
Umang Gupta, Aaron M. Ferber, Bistra Dilkina, Greg Ver Steeg
摘要
Controlling bias in training datasets is vital for ensuring equal treatment, or parity, between different groups in downstream applications. A naive solution is to transform the data so that it is statistically independent of group membership, but this may throw away too much information when a reasonable compromise between fairness and accuracy is desired. Another common approach is to limit the ability of a particular adversary who seeks to maximize parity. Unfortunately, representations produced by adversarial approaches may still retain biases as their efficacy is tied to the complexity of the adversary used during training. To this end, we theoretically establish that by limiting the mutual information between representations and protected attributes, we can assuredly control the parity of any downstream classifier. We demonstrate an effective method for controlling parity through mutual information based on contrastive information estimators and show that they outperform approaches that rely on variational bounds based on complex generative models. We test our approach on UCI Adult and Heritage Health datasets and demonstrate that our approach provides more informative representations across a range of desired parity thresholds while providing strong theoretical guarantees on the parity of any downstream algorithm.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper21
- Fair Normalizing FlowsMislav Balunovic, Anian Ruoss, Martin T. VechevICLR 2022 · 被引用 46 次
- Understanding Instance-Level Impact of Fairness ConstraintsJialu Wang, Xin Eric Wang, Yang LiuICML 2022 · 被引用 41 次
- Fair Representation Learning for Recommendation: A Mutual Information PerspectiveChen Zhao, Le Wu, Pengyang Shao, Kun Zhang 等AAAI 2023 · 被引用 37 次
- Fair Representation Learning through Implicit Path AlignmentChangjian Shui, Qi Chen, Jiaqi Li, Boyu Wang 等ICML 2022 · 被引用 32 次
- Tight Mutual Information Estimation With Contrastive Fenchel-Legendre OptimizationQing Guo, Junya Chen, Dong Wang, Yuewei Yang 等NeurIPS 2022 · 被引用 28 次
它引用的顶会 Paper3
- A Theory of Usable Information under Computational ConstraintsYilun Xu, Shengjia Zhao, Jiaming Song, Russell Stewart 等ICLR 2020 · 被引用 211 次
- Invariant Representations through Adversarial ForgettingAyush Jaiswal, Daniel Moyer, Greg Ver Steeg, Wael AbdAlmageed 等AAAI 2020 · 被引用 46 次
- A Free-Energy Principle for Representation LearningYansong Gao, Pratik ChaudhariICML 2020 · 被引用 11 次
相关 Paper
- Controllable Universal Fair Representation LearningYue Cui, Chen Ma, Kai Zheng, Lei Chen 等WWW 2023 · 被引用 5 次
- Data preprocessing to mitigate bias: A maximum entropy based approachL. Elisa Celis, Vijay Keswani, Nisheeth K. VishnoiICML 2020 · 被引用 45 次
- Fair Representation Learning: An Alternative to Mutual InformationJi Liu, Zenan Li, Yuan Yao, Feng Xu 等KDD 2022 · 被引用 14 次
- FADES: Fair Disentanglement with Sensitive RelevanceTaeuk Jang, Xiaoqian WangCVPR 2024
- Exploiting MMD and Sinkhorn Divergences for Fair and Transferable Representation LearningLuca Oneto, Michele Donini, Giulia Luise, Carlo Ciliberto 等NeurIPS 2020 · 被引用 56 次
