arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.09360cs.LGmath.OC
收藏

基于局部损失的新型聚类联邦学习

Novel clustered federated learning based on local loss

LMIB, School of Mathematical Sciences, Beihang University(力学系,数学科学学院,北航);College of Science, China Agricultural University(中国农业大学,理学院);School of Mathematical Sciences, Nanjing Normal University(南京师范大学,数学科学学院);School of Mathematical Sciences, Beihang University(力学系,数学科学学院,北航)

Endong Gu, Yongxin Chen, Hao Wen, Xingju Cai, Deren Han

AI总结:

本文提出LCFL,一种用于评估联邦学习中客户端数据分布的新型聚类度量方法,解决了隐私问题,提高了非凸模型的适用性,并提供了更准确的分类结果。

摘要:

本文提出LCFL,一种用于评估联邦学习中客户端数据分布的新型聚类度量方法。LCFL符合联邦学习的要求,准确评估客户端间的数据分布差异。它在现有聚类联邦学习方法上具有优势,解决了隐私问题,提高了非凸模型的适用性,并提供了更准确的分类结果。LCFL不需要事先了解客户端的数据分布。我们提供了严谨的数学分析,证明了框架的正确性和可行性。使用神经网络实例的数值实验突显了LCFL在多个聚类联邦学习基准上的优越性能。

英文摘要:

This paper proposes LCFL, a novel clustering metric for evaluating clients' data distributions in federated learning. LCFL aligns with federated learning requirements, accurately assessing client-to-client variations in data distribution. It offers advantages over existing clustered federated learning methods, addressing privacy concerns, improving applicability to non-convex models, and providing more accurate classification results. LCFL does not require prior knowledge of clients' data distributions. We provide a rigorous mathematical analysis, demonstrating the correctness and feasibility of our framework. Numerical experiments with neural network instances highlight the superior performance of LCFL over baselines on several clustered federated learning benchmarks.

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

↑