Beyond traditional assumptions in fair machine learning
Niki Kilbertus

TL;DR
This thesis critically examines and extends fair machine learning by introducing causal fairness, privacy-preserving protocols, and decision-focused learning to address real-world challenges and limitations.
Contribution
It develops new causal fairness criteria, privacy-preserving protocols, and decision-based learning methods, moving fair ML closer to practical application.
Findings
Causal fairness criteria offer a more versatile approach than statistical group fairness.
Protocols enable fair ML without disclosing sensitive data or models.
Decision-focused learning relaxes the need for outcome labels in training.
Abstract
This thesis scrutinizes common assumptions underlying traditional machine learning approaches to fairness in consequential decision making. After challenging the validity of these assumptions in real-world applications, we propose ways to move forward when they are violated. First, we show that group fairness criteria purely based on statistical properties of observed data are fundamentally limited. Revisiting this limitation from a causal viewpoint we develop a more versatile conceptual framework, causal fairness criteria, and first algorithms to achieve them. We also provide tools to analyze how sensitive a believed-to-be causally fair algorithm is to misspecifications of the causal graph. Second, we overcome the assumption that sensitive data is readily available in practice. To this end we devise protocols based on secure multi-party computation to train, validate, and contest fair…
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.
