论文标题

基于NOMA的MEC中联合学习的计划政策和权力分配

Scheduling Policy and Power Allocation for Federated Learning in NOMA Based MEC

论文作者

Ma, Xiang, Sun, Haijian, Hu, Rose Qingyang

论文摘要

联合学习(FL)是一种高度追求的机器学习技术,可以在保持数据分布的同时集中训练模型。分布式计算使得FL对带宽有限的应用程序有限,尤其是在无线通信中。可以有大量连接到中央参数服务器(PS)的分布式边缘设备,并迭代下载/从/上传到PS。由于带宽有限,只能在每个回合中安排一部分连接的设备。在最先进的机器学习模型(例如深度学习)中,通常有数百万个参数,从而导致高计算复杂性以及收集/分发数据进行培训的高沟通负担。为了提高沟通效率并使培训模型更快地收敛,我们建议使用非正交多重访问(NOMA)设置的新调度策略和权力分配方案,以在整个学习过程中在实际限制下最大化加权总和数据速率。 NOMA允许多个用户同时在同一频道上传输。用户调度问题被转换为最大重量独立集问题,可以使用图理论解决。仿真结果表明,与其他现有方案相比,所提出的调度和功率分配方案可以帮助实现基于NOMA的无线网络的更高FL测试精度。

Federated learning (FL) is a highly pursued machine learning technique that can train a model centrally while keeping data distributed. Distributed computation makes FL attractive for bandwidth limited applications especially in wireless communications. There can be a large number of distributed edge devices connected to a central parameter server (PS) and iteratively download/upload data from/to the PS. Due to the limited bandwidth, only a subset of connected devices can be scheduled in each round. There are usually millions of parameters in the state-of-art machine learning models such as deep learning, resulting in a high computation complexity as well as a high communication burden on collecting/distributing data for training. To improve communication efficiency and make the training model converge faster, we propose a new scheduling policy and power allocation scheme using non-orthogonal multiple access (NOMA) settings to maximize the weighted sum data rate under practical constraints during the entire learning process. NOMA allows multiple users to transmit on the same channel simultaneously. The user scheduling problem is transformed into a maximum-weight independent set problem that can be solved using graph theory. Simulation results show that the proposed scheduling and power allocation scheme can help achieve a higher FL testing accuracy in NOMA based wireless networks than other existing schemes.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源