Algorithmic fairness plays an increasingly critical role in machine learning research. Several group fairness notions and algorithms have been proposed. However, the fairness guarantee of existing fair classification methods mainly depends on specific data distributional assumptions, often requiring large sample sizes, and fairness could be violated when there is a modest number of samples, which is often the case in practice. In this paper, we propose FaiREE, a fair classification algorithm that can satisfy group fairness constraints with finite-sample and distribution-free theoretical guarantees. FaiREE can be adapted to satisfy various group fairness notions (e.g., Equality of Opportunity, Equalized Odds, Demographic Parity, etc.) and achieve the optimal accuracy. These theoretical guarantees are further supported by experiments on both synthetic and real data. FaiREE is shown to have favorable performance over state-of-the-art algorithms.
翻译:机器学习研究中,算法公平性越来越重要。已经提出了几个群组公平性概念和算法。然而,现有的公平分类方法的公平保证主要取决于特定数据分布假设,通常需要大样本量。而在实践中,样本数量较少时可能会违反公平性。在本文中,我们提出了FaiREE,一种公平分类算法,它可以满足群体公平性约束,并具有有限样本和分布无关的理论保证。FaiREE可以适应各种群体公平性概念(例如机会均等,平等赔付,人口统计学平衡等),并实现最优精度。这些理论保证进一步得到了在合成和真实数据上的实验支持。FaiREE表现出了优越的性能,优于现有算法。