Bayes-Optimal Fair Classification with Multiple Sensitive Features
Yi Yang, Yinghui Huang, Xiangyu Chang
TL;DR
This work addresses fairness in binary classification when multiple sensitive features are present by studying Bayes-optimal fair classifiers under approximate fairness, modeled via Mean Difference (MD) and Mean Ratio (MR). It proves that the Bayes-optimal fair classifier can be expressed as an instance-dependent threshold on the posterior $\eta(x)=P(Y=1|X=x)$ with corrections that are weighted sums of group-membership probabilities, applicable to both attribute-aware and attribute-blind settings and to composite notions like Equalized Odds. The authors provide two practical learning paradigms—in-processing, via a fair cost-sensitive objective, and post-processing, via a plug-in thresholding approach—that realize the Bayes-optimal fair classifier from finite data. Empirical results on Adult and COMPAS demonstrate favorable accuracy-fairness trade-offs under DP, EO, PE, and AP (including the new AP case) with MD and MR, highlighting the practical impact of enabling fair decisions when multiple sensitive attributes define intersectional groups.
Abstract
Existing theoretical work on Bayes-optimal fair classifiers usually considers a single (binary) sensitive feature. In practice, individuals are often defined by multiple sensitive features. In this paper, we characterize the Bayes-optimal fair classifier for multiple sensitive features under general approximate fairness measures, including mean difference and mean ratio. We show that these approximate measures for existing group fairness notions, including Demographic Parity, Equal Opportunity, Predictive Equality, and Accuracy Parity, are linear transformations of selection rates for specific groups defined by both labels and sensitive features. We then characterize that Bayes-optimal fair classifiers for multiple sensitive features become instance-dependent thresholding rules that rely on a weighted sum of these group membership probabilities. Our framework applies to both attribute-aware and attribute-blind settings and can accommodate composite fairness notions like Equalized Odds. Building on this, we propose two practical algorithms for Bayes-optimal fair classification via in-processing and post-processing. We show empirically that our methods compare favorably to existing methods.
