Wasserstein support vector machine: Support vector machines made fair
提出一种结合支持向量机与公平性的模型，通过惩罚两组SVM得分的Wasserstein距离来减少歧视，在保持精度的同时大幅降低不公平性。
In this paper, a novel model combining Support Vector Machines (SVM) and equity is introduced. Assuming that a group of individuals need to be protected against discrimination, we address the problem of training the classifier by jointly maximizing the classification performance (SVM margin) and equity (closeness between the distribution of the predictions in the protected group and the remaining individuals). Training makes an efficient use of the available information, since the margin is evaluated on individuals for which the class label is known, whereas the equity is measured on individuals for whom we know whether they belong to the protected group or not, and thus their class label is not required. We modify the dual SVM formulation with a penalization of the Wasserstein distance between the empirical distribution of the SVM scores from the two groups. In our approach, predictions are made by reweighting the records, and we show that these weights can be found by training an SVM with a modified kernel. Numerical results are presented on classic benchmark datasets in the Fair Machine Learning literature, where we investigate the tradeoff between accuracy and unfairness for different values of the decision threshold. With a mild penalization of the Wasserstein distance, we can dramatically reduce the unfairness while keeping a similar level of accuracy.