Whilst optimal transport (OT) is increasingly being recognized as a powerful and flexible approach for dealing with fairness issues, current OT fairness methods are confined to the use of discrete OT. In this paper, we leverage recent advances from the OT literature to introduce a stochastic-gradient fairness method based on a dual formulation of continuous OT. We show that this method gives superior performance to discrete OT methods when little data is available to solve the OT problem, and similar performance otherwise. We also show that both continuous and discrete OT methods are able to continually adjust the model parameters to adapt to different levels of unfairness that might occur in real-world applications of ML systems.
翻译:虽然人们日益认识到最佳运输(OT)是处理公平问题的强有力和灵活的方法,但目前的OT公平方法仅限于使用离散的OT。在本文中,我们利用OT文献的最新进展,在连续的OT的双重配方基础上引入了随机分级公平方法。我们表明,当几乎没有数据解决OT问题时,这种方法使离散的OT方法发挥优异的性能,而在其他情况下则使类似的性能。我们还表明,连续的和离散的OT方法能够不断调整模型参数,以适应在ML系统的实际应用中可能出现的不同程度的不公平。