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已证明其业绩优于最新算法。