Bayes-Optimal Classifiers under Group Fairness
Xianli Zeng, Edgar Dobriban, Guang Cheng
TL;DR
The paper introduces a unified Neyman-Pearson-based framework to derive Bayes-optimal classifiers under group fairness constraints and proposes FairBayes, a fast post-processing method that achieves direct control of disparity via group-wise thresholds. It proves that, under demographic parity with tolerance $\delta$, the Bayes-optimal solution is a group-wise threshold rule, and provides a practical algorithm to estimate thresholds from data. The approach yields favorable fairness-accuracy tradeoffs in synthetic and real-data experiments while maintaining computational efficiency. This work offers a principled path to explicitly constrain unfairness levels while preserving near-optimal predictive performance, with potential extensions to multi-class protected attributes and other fairness criteria.
Abstract
Machine learning algorithms are becoming integrated into more and more high-stakes decision-making processes, such as in social welfare issues. Due to the need of mitigating the potentially disparate impacts from algorithmic predictions, many approaches have been proposed in the emerging area of fair machine learning. However, the fundamental problem of characterizing Bayes-optimal classifiers under various group fairness constraints has only been investigated in some special cases. Based on the classical Neyman-Pearson argument (Neyman and Pearson, 1933; Shao, 2003) for optimal hypothesis testing, this paper provides a unified framework for deriving Bayes-optimal classifiers under group fairness. This enables us to propose a group-based thresholding method we call FairBayes, that can directly control disparity, and achieve an essentially optimal fairness-accuracy tradeoff. These advantages are supported by thorough experiments.
