arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.09177eess.SP
收藏

高效联邦学习的资源分配研究

Research on Resource Allocation for Efficient Federated Learning

Jianyang Ren, Wanli Ni, Gaofeng Nie, Hui Tian

摘要:

联邦学习作为实现孤立数据所有者之间有效学习和解决数据隐私问题的一种有前途的解决方案,正受到广泛关注。使用边缘服务器作为中介可以有效地收集传感器数据,执行本地模型训练,并上传模型参数以进行全局聚合。因此,本文提出了一种新的框架,用于边缘计算支持的分层网络中的资源分配。在此框架下,我们通过优化带宽、计算频率、功率分配和子载波分配来最小化系统成本和学习成本的加权和。为了解决这个具有挑战性的混合整数非线性问题,我们首先将带宽优化问题(P1)从整个问题中解耦出来,并获得一个封闭形式的解。剩余的计算频率、功率和子载波联合优化问题(P2)可以进一步分解为两个子问题:延迟和计算频率优化问题(P3)以及传输功率和子载波优化问题(P4)。P3是一个凸优化问题,很容易解决。在联合优化问题(P4)中,可以首先通过连续凸近似(SCA)算法获得每个子载波选择下的最优功率。将求出的最优功率值代入P4,可将子问题看作一个指派问题,从而可以有效地利用匈牙利算法求解,问题P2的求解是通过迭代求解P3和P4来完成的。为了验证该算法的性能,我们将该算法与等带宽分配算法、保证学习成本算法、贪婪子载波分配算法、保证系统成本算法和时间偏差算法进行了比较。数值结果表明,该算法在面对参数变化时具有显著的性能增益和鲁棒性。

英文摘要:

As a promising solution to achieve efficient learning among isolated data owners and solve data privacy issues, federated learning is receiving wide attention. Using the edge server as an intermediary can effectively collect sensor data, perform local model training, and upload model parameters for global aggregation. So this paper proposes a new framework for resource allocation in a hierarchical network supported by edge computing. In this framework, we minimize the weighted sum of system cost and learning cost by optimizing bandwidth, computing frequency, power allocation and subcarrier assignment. To solve this challenging mixed-integer non-linear problem, we first decouple the bandwidth optimization problem(P1) from the whole problem and obtain a closed-form solution. The remaining computational frequency, power, and subcarrier joint optimization problem(P2) can be further decomposed into two sub-problems: latency and computational frequency optimization problem(P3) and transmission power and subcarrier optimization problem(P4). P3 is a convex optimization problem that is easy to solve. In the joint optimization problem(P4), the optimal power under each subcarrier selection can be obtained first through the successive convex approximation(SCA) algorithm. Substituting the optimal power value obtained back to P4, the subproblem can be regarded as an assignment problem, so the Hungarian algorithm can be effectively used to solve it. The solution of problem P2 is accomplished by solving P3 and P4 iteratively. To verify the performance of the algorithm, we compare the proposed algorithm with five algorithms; namely Equal bandwidth allocation, Learning cost guaranteed, Greedy subcarrier allocation, System cost guaranteed and Time-biased algorithm. Numerical results show the significant performance gain and the robustness of the proposed algorithm in the face of parameter changes.

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

↑