arXiv:2409.19509cs.LGcs.AI2024-09

针对边缘联邦学习的异构性,优化资源分配与网络拓扑以加速训练。

Heterogeneity-Aware Resource Allocation and Topology Design for Hierarchical Federated Edge Learning

  • 构建两级边缘联邦学习框架,通过动态资源分配与连通性调整降低延迟。
  • 实验表明训练延迟显著下降,模型精度与基线相当。
  • 适合大规模边缘智能场景中存在设备与数据异构的系统设计者。

联邦学习(FL)为在移动边缘设备上训练机器学习模型提供了隐私保护框架。传统FL算法如FedAvg对这些设备造成沉重通信负担。为缓解此问题,分层联邦边缘学习(HFEL)被提出,利用边缘服务器作为模型聚合的中间节点。尽管有效,HFEL仍面临收敛速度慢、资源消耗高等挑战,尤其在系统与数据异构条件下。现有工作主要聚焦于提升传统FL的训练效率,而对HFEL的效率研究较少。本文考虑一个两级HFEL系统:边缘设备连接至边缘服务器,边缘服务器通过点对点(P2P)边缘回传网络互联。目标是通过策略性资源分配与拓扑设计提升HFEL系统的训练效率。具体地,我们构建优化问题以最小化总训练延迟,涉及计算与通信资源分配及P2P连接调整。为确保动态拓扑下的收敛性,分析了收敛误差界,并引入模型共识约束。所提问题被分解为多个子问题,支持在线交替求解。该方法在数据与系统异构下实现了大规模边缘联邦学习的高效部署。在基准数据集上的全面实验验证了有效性,相比多种基线方法,训练延迟显著降低,同时保持模型精度。

原文摘要 · Abstract (English)

Federated Learning (FL) provides a privacy-preserving framework for training machine learning models on mobile edge devices. Traditional FL algorithms, e.g., FedAvg, impose a heavy communication workload on these devices. To mitigate this issue, Hierarchical Federated Edge Learning (HFEL) has been proposed, leveraging edge servers as intermediaries for model aggregation. Despite its effectiveness, HFEL encounters challenges such as a slow convergence rate and high resource consumption, particularly in the presence of system and data heterogeneity. However, existing works are mainly focused on improving training efficiency for traditional FL, leaving the efficiency of HFEL largely unexplored. In this paper, we consider a two-tier HFEL system, where edge devices are connected to edge servers and edge servers are interconnected through peer-to-peer (P2P) edge backhauls. Our goal is to enhance the training efficiency of the HFEL system through strategic resource allocation and topology design. Specifically, we formulate an optimization problem to minimize the total training latency by allocating the computation and communication resources, as well as adjusting the P2P connections. To ensure convergence under dynamic topologies, we analyze the convergence error bound and introduce a model consensus constraint into the optimization problem. The proposed problem is then decomposed into several subproblems, enabling us to alternatively solve it online. Our method facilitates the efficient implementation of large-scale FL at edge networks under data and system heterogeneity. Comprehensive experiment evaluation on benchmark datasets validates the effectiveness of the proposed method, demonstrating significant reductions in training latency while maintaining the model accuracy compared to various baselines.

联邦学习边缘计算资源分配异构性

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