arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.09232cs.LGcs.DC
收藏

MAP:类别不完整场景下联邦学习中的模型聚合与个性化

MAP: Model Aggregation and Personalization in Federated Learning with Incomplete Classes

Nanjing University(南京大学);Nanjing University of Science and Technology(南京理工大学)

Xin-Chun Li, Shaoming Song, Yinchuan Li, Bingshuai Li, Yunfeng Shao, Yang Yang, De-Chuan Zhan

AI总结:

针对联邦学习中客户端类别不完整的Non-I.I.D.场景,提出MAP算法,通过受限softmax优化聚合、继承式私有模型存储个性化经验,同时实现聚合与个性化目标,经实验验证性能更优。

摘要:

在部分实际应用中,数据样本通常分布在本地设备上,联邦学习(FL)技术正是为协调去中心化客户端、无需直接共享用户隐私数据而提出的。联邦学习通常采用参数服务器架构,包含多轮个性化与聚合流程。客户端间天然存在的数据异构性(即Non-I.I.D.数据)对联邦学习的聚合与个性化目标均构成挑战。本文聚焦一类特殊的Non-I.I.D.场景:客户端持有类别不完整,即每个客户端仅能访问全部类别集合的一个子集。服务器的目标是聚合出一个可泛化至所有类别的完整分类模型,而客户端则倾向于提升其观测到的类别的区分性能。为优化模型聚合,我们指出标准softmax会因类别缺失引发若干问题,并提出“受限softmax”作为替代方案。为优化模型个性化,我们指出来之不易的个性化模型未得到充分利用,并提出“继承式私有模型”来存储个性化经验。我们提出的名为MAP的算法可同时实现联邦学习中的聚合与个性化目标。大量实验研究验证了该算法的优越性。

英文摘要:

In some real-world applications, data samples are usually distributed on local devices, where federated learning (FL) techniques are proposed to coordinate decentralized clients without directly sharing users' private data. FL commonly follows the parameter server architecture and contains multiple personalization and aggregation procedures. The natural data heterogeneity across clients, i.e., Non-I.I.D. data, challenges both the aggregation and personalization goals in FL. In this paper, we focus on a special kind of Non-I.I.D. scene where clients own incomplete classes, i.e., each client can only access a partial set of the whole class set. The server aims to aggregate a complete classification model that could generalize to all classes, while the clients are inclined to improve the performance of distinguishing their observed classes. For better model aggregation, we point out that the standard softmax will encounter several problems caused by missing classes and propose "restricted softmax" as an alternative. For better model personalization, we point out that the hard-won personalized models are not well exploited and propose "inherited private model" to store the personalization experience. Our proposed algorithm named MAP could simultaneously achieve the aggregation and personalization goals in FL. Abundant experimental studies verify the superiorities of our algorithm.

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

↑