arXiv:2502.08577cs.LGcs.AI2025-02被引 9

提出一种新型联邦学习框架,解决数据异构和中心化架构的瓶颈问题。

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

  • 基于空间位置选举局部领导者,实现个性化模型训练
  • 在非独立同分布数据下性能超越FedAvg、FedProx等主流方法
  • 自组织分层架构抗服务器故障,适合大规模动态部署

近年来,联邦学习(FL)已成为高隐私要求领域训练机器学习模型的热门方案。然而,在设备间数据分布非独立同分布(non-IID)的真实场景中,FL的可扩展性和性能面临严峻挑战,这通常由设备的空间分布导致,若无有效处理将显著降低模型表现。此外,传统FL依赖集中式架构,易形成瓶颈与单点故障风险,尤其在大规模或动态环境中尤为突出。为此,本文提出基于场域的联邦学习(FBFL),通过宏编程与场协调机制,实现:(i) 分布式空间导向的领导者选举,用于缓解非独立同分布数据问题;(ii) 利用先进宏编程模式构建自组织分层架构。实验基于MNIST、FashionMNIST和Extended MNIST数据集验证,结果表明:在独立同分布条件下,FBFL性能与广泛使用的FedAvg相当;在具有挑战性的非独立同分布场景下,不仅优于FedAvg,还超越专为应对非独立同分布设计的FedProx和Scaffold等先进方法。同时,展示了其自组织分层架构对服务器故障的鲁棒性。

原文摘要 · Abstract (English)

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.

联邦学习数据异构自组织架构分布式计算

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。