arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.09263cs.DCcs.LG
收藏

面向低延迟联邦学习的移动感知联合用户调度与资源分配

Mobility-Aware Joint User Scheduling and Resource Allocation for Low Latency Federated Learning

Shanghai Jiao Tong University(上海交通大学);Nanjing University of Science and Technology(南京理工大学);Data61, CSIRO(澳大利亚联邦科学与工业研究组织Data61部门)

Kecheng Fan, Wen Chen, Jun Li, Xiumei Deng, Xuefeng Han, Ming Ding

AI总结:

针对移动场景下联邦学习因用户移动性导致训练延迟高的问题,提出考虑用户移动性的多基站FL模型及延迟感知贪心搜索算法,联合优化用户调度与资源分配以降低训练延迟,性能优于现有基准,且适度移动性可提升训练效果。

摘要:

作为一种高效的分布式机器学习方法,联邦学习(Federated Learning,FL)可通过用户端迭代的本地模型训练与中心服务器端的全局模型聚合得到共享模型,从而保护用户隐私。FL系统中的移动用户通常通过无线信道与基站(BS)通信,用户移动性导致的不可靠接入会降低训练性能。然而现有工作仅研究静态场景或随机初始化用户位置,无法捕捉真实网络中的移动性。为解决该问题,我们提出了多基站下FL用户移动性的实用模型,并设计了一种用户调度与资源分配方法,在通信资源受限的条件下最小化训练延迟。具体而言,我们首先构建了考虑用户移动性的优化问题,联合考虑用户选择、用户的基站分配与带宽分配,以最小化每轮通信的延迟。该优化问题被证明是NP难的,我们提出了延迟感知贪心搜索算法(delay-aware greedy search algorithm,DAGSA)来求解。仿真结果表明,所提算法相比现有最优基准取得了更优性能,且一定程度的用户移动性能够提升训练性能。

英文摘要:

As an efficient distributed machine learning approach, Federated learning (FL) can obtain a shared model by iterative local model training at the user side and global model aggregating at the central server side, thereby protecting privacy of users. Mobile users in FL systems typically communicate with base stations (BSs) via wireless channels, where training performance could be degraded due to unreliable access caused by user mobility. However, existing work only investigates a static scenario or random initialization of user locations, which fail to capture mobility in real-world networks. To tackle this issue, we propose a practical model for user mobility in FL across multiple BSs, and develop a user scheduling and resource allocation method to minimize the training delay with constrained communication resources. Specifically, we first formulate an optimization problem with user mobility that jointly considers user selection, BS assignment to users, and bandwidth allocation to minimize the latency in each communication round. This optimization problem turned out to be NP-hard and we proposed a delay-aware greedy search algorithm (DAGSA) to solve it. Simulation results show that the proposed algorithm achieves better performance than the state-of-the-art baselines and a certain level of user mobility could improve training performance.

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

↑