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

一种面向存在数量倾斜的非独立同分布数据的鲁棒聚类联邦学习方法

A Robust Clustered Federated Learning Approach for Non-IID Data with Quantity Skew

Université Toulouse UT3, IRIT, CNRS(法国图卢兹大学UT3,IRIT,CNRS);INU Champollion ISIS Castres, IRIT, CNRS(法国夏莫利翁 ISIS 铸造城学院,IRIT,CNRS);Université Toulouse UT2J, IRIT, CNRS(法国图卢兹大学UT2J,IRIT,CNRS)

Michael Ben Ali, Imen Megdiche, André Peninou, Olivier Teste

AI总结:

针对现有聚类联邦学习方法在数量倾斜非独立同分布数据下鲁棒性不足的问题,本文评估了前沿算法在多数量倾斜场景下的表现,并提出协同两种运行策略的CORNFLQS算法,在6个数据集的270种配置中准确率与聚类质量均最优。

摘要:

联邦学习(FL)是一种去中心化范式,支持客户端-服务器架构在不共享原始数据的前提下协同训练全局人工智能模型,从而保护隐私。联邦学习的核心挑战之一是非独立同分布(Non-IID)数据问题,数量倾斜(QS)是Non-IID的一种特定情形,指各客户端持有的数据量存在高度异质性。聚类联邦学习(CFL)是联邦学习的新兴变体,为解决Non-IID问题提供了颇具前景的方案,它通过将数据分布相似的客户端划分到同一簇中来提升模型性能。聚类联邦学习方法通常分为两种运行策略:第一种策略中,客户端选择能最小化本地训练损失的簇;第二种策略中,服务器根据本地模型的相似度对客户端进行分组。然而,大多数聚类联邦学习方法缺乏在数量倾斜场景下的系统性评估,而数量倾斜会给这类方法带来严峻挑战。本文主要有两项贡献:第一项是在多种Non-IID设置下对前沿聚类联邦学习算法开展评估,引入多种数量倾斜场景以衡量其鲁棒性;第二项是提出一种名为CORNFLQS的新型迭代式聚类联邦学习算法,该算法实现了聚类联邦学习两种运行策略的最优协同,对不同的数量倾斜设置变化具有鲁棒性。我们在6个图像分类数据集上开展了大量实验,覆盖270种Non-IID配置。结果表明,CORNFLQS在准确率和聚类质量两项指标上均取得了最高的平均排名,且对数量倾斜扰动具备强鲁棒性。总体而言,所提方法的性能优于现有聚类联邦学习算法。

英文摘要:

Federated Learning (FL) is a decentralized paradigm that enables a client-server architecture to collaboratively train a global Artificial Intelligence model without sharing raw data, thereby preserving privacy. A key challenge in FL is Non-IID data. Quantity Skew (QS) is a particular problem of Non-IID, where clients hold highly heterogeneous data volumes. Clustered Federated Learning (CFL) is an emergent variant of FL that presents a promising solution to Non-IID problem. It improves models' performance by grouping clients with similar data distributions into clusters. CFL methods generally fall into two operating strategies. In the first strategy, clients select the cluster that minimizes the local training loss. In the second strategy, the server groups clients based on local model similarities. However, most CFL methods lack systematic evaluation under QS but present significant challenges because of it. In this paper, we present two main contributions. The first one is an evaluation of state-of-the-art CFL algorithms under various Non-IID settings, applying multiple QS scenarios to assess their robustness. Our second contribution is a novel iterative CFL algorithm, named CORNFLQS, which proposes an optimal coordination between both operating strategies of CFL. Our approach is robust against the different variations of QS settings. We conducted intensive experiments on six image classification datasets, resulting in 270 Non-IID configurations. The results show that CORNFLQS achieves the highest average ranking in both accuracy and clustering quality, as well as strong robustness to QS perturbations. Overall, our approach outperforms actual CFL algorithms.

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

↑