Edge federated learning (FL) is an emerging machine learning paradigm that trains a global parametric model from distributed datasets via wireless communications. This paper proposes a unit-modulus over-the-air computation (UM-AirComp) framework to facilitate efficient edge federated learning, which simultaneously uploads local model parameters and updates global model parameters via analog beamforming. The proposed framework avoids sophisticated baseband signal processing, leading to low communication delays and implementation costs. A training loss bound of UM-AirComp is derived and two low-complexity algorithms, termed penalty alternating minimization (PAM) and accelerated gradient projection (AGP), are proposed to minimize the nonconvex nonsmooth loss bound. Simulation results show that the proposed UM-AirComp framework with PAM algorithm not only achieves a smaller mean square error of model parameters' estimation, training loss, and testing error, but also requires a significantly shorter runtime than that of other benchmark schemes. Moreover, the proposed UM-AirComp framework with AGP algorithm achieves satisfactory performance while reduces the computational complexity by orders of magnitude compared with existing optimization algorithms. Finally, we demonstrate the implementation of UM-AirComp in a vehicle-to-everything autonomous driving simulation platform. It is found that autonomous driving tasks are more sensitive to model parameter errors than other tasks since the former neural networks are more sophisticated containing sparser model parameters.
翻译:远距联合学习(FL)是一个新兴的机器学习模式,它通过无线通信,从分布式数据集中培训一个全球参数模型,通过分布式无线通信培训一个全球参数模型。本文件提议了一个单元模量超空计算(UM-AirComp)框架,以促进高效边缘联合学习,同时上传本地模型参数,并通过模拟光成形更新全球模型参数。拟议框架避免了复杂的基带信号处理,导致通信延迟和执行成本降低。UM-AirComp的训练损失是衍生出来的,而两个称为惩罚交替最小化(PAM)和加速梯度投影(AGP)的低精度参数算法(AGP)则提议了一个单位模量模型模型,以尽可能减少非convelx非光速损失约束(UM-Aircomplement ) 框架。模拟结果显示,与PAM算法相比,拟议的UM-Aircompil 框架不仅在模型估计、培训损失和测试错误方面实现一个较小的中,而且还需要比其他基准计划运行时间短得多。此外,拟议的UM-Arial-comcomm lial imal imalalalal assal complactal comma comma comma lax lax lax lax lax 后,最后发现,我们发现一个比了比了比现有的自动压制式算法任务。