arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.08435cs.LG
收藏

解决联邦学习中的学习差异和学习效果不一致问题

Addressing Algorithmic Disparity and Performance Inconsistency in Federated Learning

Tsinghua University(清华大学);Alibaba Group(阿里巴巴集团);Weill Cornell Medicine(威尔·康奈尔医学院)

Sen Cui, Weishen Pan, Jian Liang, Changshui Zhang, Fei Wang

摘要:

联邦学习(Federated learning,FL)能够从分布式数据源中进行学习,而不需要访问不同数据源的原始数据样本,因此受到越来越多的关注。到目前为止,FL的研究主要集中在提高性能,算法差异将如何影响从FL学习的模型,以及算法差异对效用不一致性的影响在很大程度上是未知的。在本文中,我们提出了一个FL框架,共同考虑性能的一致性和算法公平性在不同的本地客户端(数据源)。我们从约束多目标优化的角度推导出我们的框架,在该框架中,我们学习了一个模型,该模型满足对所有客户端的公平性约束,并具有一致的性能。具体来说,我们把算法的预测损失在每个本地客户端作为一个目标,并最大限度地提高性能最差的客户端的公平性约束,通过优化代理最大值函数的所有目标。一个基于梯度的过程是实现这个优化问题的帕累托最优。理论分析证明,我们的方法可以收敛到一个Pareto解决方案,实现最小最大的性能与公平性约束的所有客户端。在合成数据集和真实数据集上进行的综合实验表明,我们的方法优于基线,并且在所有本地客户端实现公平性和一致性方面有效。

英文摘要:

Federated learning (FL) has gain growing interests for its capability of learning from distributed data sources collectively without the need of accessing the raw data samples across different sources. So far FL research has mostly focused on improving the performance, how the algorithmic disparity will be impacted for the model learned from FL and the impact of algorithmic disparity on the utility inconsistency are largely unexplored. In this paper, we propose an FL framework to jointly consider performance consistency and algorithmic fairness across different local clients (data sources). We derive our framework from a constrained multi-objective optimization perspective, in which we learn a model satisfying fairness constraints on all clients with consistent performance. Specifically, we treat the algorithm prediction loss at each local client as an objective and maximize the worst-performing client with fairness constraints through optimizing a surrogate maximum function with all objectives involved. A gradient-based procedure is employed to achieve the Pareto optimality of this optimization problem. Theoretical analysis is provided to prove that our method can converge to a Pareto solution that achieves the min-max performance with fairness constraints on all clients. Comprehensive experiments on synthetic and real-world datasets demonstrate the superiority that our approach over baselines and its effectiveness in achieving both fairness and consistency across all local clients.

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

↑