Learning Fair Classifiers via Min-Max F-divergence Regularization
Meiyu Zhong, Ravi Tandon

TL;DR
This paper introduces a novel min-max F-divergence regularization framework for fair classification that balances high accuracy with fairness, applicable to multiple sensitive attributes and datasets.
Contribution
It proposes a new F-divergence based training method using two networks, improving fairness-accuracy trade-offs over existing approaches.
Findings
Achieves state-of-the-art fairness-accuracy trade-offs.
Effective on multiple real-world datasets including COMPAS and CelebA.
Supports multiple sensitive attributes and high-dimensional data.
Abstract
As machine learning (ML) based systems are adopted in domains such as law enforcement, criminal justice, finance, hiring and admissions, ensuring the fairness of ML aided decision-making is becoming increasingly important. In this paper, we focus on the problem of fair classification, and introduce a novel min-max F-divergence regularization framework for learning fair classification models while preserving high accuracy. Our framework consists of two trainable networks, namely, a classifier network and a bias/fairness estimator network, where the fairness is measured using the statistical notion of F-divergence. We show that F-divergence measures possess convexity and differentiability properties, and their variational representation make them widely applicable in practical gradient based training methods. The proposed framework can be readily adapted to multiple sensitive attributes…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEthics and Social Impacts of AI
MethodsFocus
