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

FBFL:一种基于领域的协调方法,用于联邦学习中的数据异质性

FBFL: A Field-Based Coordination Approach for Data Heterogeneity in Federated Learning

Davide Domini, Gianluca Aguzzi, Lukas Esterle, Mirko Viroli

AI总结:

FBFL通过宏编程和领域协调方法,解决联邦学习中的数据异质性问题,提升模型性能和鲁棒性。

摘要:

在最近几年,联邦学习(FL)已成为在高隐私关注领域训练机器学习模型的流行解决方案。然而,在现实世界部署中,设备间的数据是非独立同分布(non-IID)的,这使得FL的可扩展性和性能面临重大挑战。数据分布的异质性通常源于设备的空间分布,导致在缺乏适当处理的情况下模型性能下降。此外,FL通常依赖于集中式架构,这在大规模或动态环境中引入了瓶颈和单点故障风险。为填补这一空白,我们提出了领域基于的联邦学习(FBFL),一种新的方法,利用宏编程和领域协调来通过以下方式解决这些限制:(i)分布式空间基于的领导者选举用于个性化,以缓解非IID数据挑战;(ii)使用先进的宏编程模式构建自组织、分层架构。此外,FBFL不仅克服了上述限制,还使能够开发更专门的模型,这些模型针对每个子区域特定的数据分布进行定制。本文正式化了FBFL,并使用MNIST、FashionMNIST和扩展MNIST数据集进行了广泛的评估。我们证明,当在IID数据条件下运行时,FBFL的表现与广泛使用的FedAvg算法相当。此外,在具有挑战性的非IID场景中,FBFL不仅优于FedAvg,还超过了其他最先进的方法,即FedProx和Scaffold,这些方法专门设计用于解决非IID数据分布问题。此外,我们展示了FBFL的自组织分层架构对服务器故障的韧性。

英文摘要:

In the last years, Federated learning (FL) has become a popular solution to train machine learning models in domains with high privacy concerns. However, FL scalability and performance face significant challenges in real-world deployments where data across devices are non-independently and identically distributed (non-IID). The heterogeneity in data distribution frequently arises from spatial distribution of devices, leading to degraded model performance in the absence of proper handling. Additionally, FL typical reliance on centralized architectures introduces bottlenecks and single-point-of-failure risks, particularly problematic at scale or in dynamic environments. To close this gap, we propose Field-Based Federated Learning (FBFL), a novel approach leveraging macroprogramming and field coordination to address these limitations through: (i) distributed spatial-based leader election for personalization to mitigate non-IID data challenges; and (ii) construction of a self-organizing, hierarchical architecture using advanced macroprogramming patterns. Moreover, FBFL not only overcomes the aforementioned limitations, but also enables the development of more specialized models tailored to the specific data distribution in each subregion. This paper formalizes FBFL and evaluates it extensively using MNIST, FashionMNIST, and Extended MNIST datasets. We demonstrate that, when operating under IID data conditions, FBFL performs comparably to the widely-used FedAvg algorithm. Furthermore, in challenging non-IID scenarios, FBFL not only outperforms FedAvg but also surpasses other state-of-the-art methods, namely FedProx and Scaffold, which have been specifically designed to address non-IID data distributions. Additionally, we showcase the resilience of FBFL's self-organizing hierarchical architecture against server failures.

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

↑