Learning Certified Individually Fair Representations
Anian Ruoss, Mislav Balunovi\'c, Marc Fischer, and Martin Vechev

TL;DR
This paper introduces a novel method for certifying individual fairness in data representations, allowing data consumers to verify fairness guarantees for both existing and new data points using latent space proximity.
Contribution
We propose the first approach to certify individual fairness in learned representations by mapping similar individuals to close latent representations and providing robustness certificates.
Findings
Effective certification of individual fairness on real-world datasets
Scalable approach suitable for various fairness constraints
Demonstrated expressivity and robustness of the method
Abstract
Fair representation learning provides an effective way of enforcing fairness constraints without compromising utility for downstream users. A desirable family of such fairness constraints, each requiring similar treatment for similar individuals, is known as individual fairness. In this work, we introduce the first method that enables data consumers to obtain certificates of individual fairness for existing and new data points. The key idea is to map similar individuals to close latent representations and leverage this latent proximity to certify individual fairness. That is, our method enables the data producer to learn and certify a representation where for a data point all similar individuals are at -distance at most , thus allowing data consumers to certify individual fairness by proving -robustness of their classifier. Our experimental evaluation on…
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.
Code & Models
Videos
Taxonomy
TopicsEthics and Social Impacts of AI · Adversarial Robustness in Machine Learning · Explainable Artificial Intelligence (XAI)
