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

联邦学习中的协作均衡

Collaboration Equilibrium in Federated Learning

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

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

摘要:

联邦学习(FL)是指在不牺牲隐私的情况下,在涉及多个客户的协作研究网络上的学习模型的范例。最近,人们越来越关注不同客户之间的分配差异,这甚至可能在与他人合作时造成适得其反的后果。虽然它不一定是与所有客户端的合作将实现最佳性能,在本文中,我们研究了一个合理的合作称为“协作均衡”(CE),在较小的协作联盟形成。每个客户端与最大限度地提高模型学习的某些成员合作,并隔离其他贡献不大的成员。我们提出了利益图的概念,它描述了每个客户端如何可以受益于与其他客户端的合作,并提出了一个帕累托优化方法来确定最佳的合作者。然后,我们从理论上证明,我们可以达到CE从效益图通过迭代图操作。我们的框架提供了一种在研究网络中建立合作的新方法。合成和真实世界的数据集上的实验证明了我们的方法的有效性。

英文摘要:

Federated learning (FL) refers to the paradigm of learning models over a collaborative research network involving multiple clients without sacrificing privacy. Recently, there have been rising concerns on the distributional discrepancies across different clients, which could even cause counterproductive consequences when collaborating with others. While it is not necessarily that collaborating with all clients will achieve the best performance, in this paper, we study a rational collaboration called ``collaboration equilibrium'' (CE), where smaller collaboration coalitions are formed. Each client collaborates with certain members who maximally improve the model learning and isolates the others who make little contribution. We propose the concept of benefit graph which describes how each client can benefit from collaborating with other clients and advance a Pareto optimization approach to identify the optimal collaborators. Then we theoretically prove that we can reach a CE from the benefit graph through an iterative graph operation. Our framework provides a new way of setting up collaborations in a research network. Experiments on both synthetic and real world data sets are provided to demonstrate the effectiveness of our method.

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

↑