arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.04503cs.LGcs.DSstat.ML
收藏

释放线性优化器用于组公平学习和优化

Unleashing Linear Optimizers for Group-Fair Learning and Optimization

Harvard University(哈佛大学);Microsoft Research New England(微软新英格兰研究院)

Daniel Alabi, Nicole Immorlica, Adam Tauman Kalai

摘要:

大多数系统和学习算法优化平均性能或平均损失--一个原因是计算复杂性。然而,许多具有实际意义的目标比简单的平均损失更为复杂。例如,在平衡绩效或损失与人员公平性时,就会出现这种情况。我们证明,从计算的角度来看,优化任意的目标,考虑到性能在一个小数目的组是不是显着更难优化比平均性能。我们的主要结果是一个多项式时间的减少,使用线性优化器优化的任意(Lipschitz连续)功能的性能超过(恒定)数量的可能重叠的群体。这包括公平的目标,在少数群体,我们进一步指出,其他现有的公平概念,如个人公平,可以投凸优化,因此可以使用更标准的凸技术。除了学习,我们的方法更普遍地适用于多目标优化。

英文摘要:

Most systems and learning algorithms optimize average performance or average loss -- one reason being computational complexity. However, many objectives of practical interest are more complex than simply average loss. This arises, for example, when balancing performance or loss with fairness across people. We prove that, from a computational perspective, optimizing arbitrary objectives that take into account performance over a small number of groups is not significantly harder to optimize than average performance. Our main result is a polynomial-time reduction that uses a linear optimizer to optimize an arbitrary (Lipschitz continuous) function of performance over a (constant) number of possibly-overlapping groups. This includes fairness objectives over small numbers of groups, and we further point out that other existing notions of fairness such as individual fairness can be cast as convex optimization and hence more standard convex techniques can be used. Beyond learning, our approach applies to multi-objective optimization, more generally.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑