arXiv:2602.02469cs.ITcs.LG2026-02被引 1

无线联邦学习中,用时间感知选择关键参数,减少传输延迟。

Age-Aware Edge-Blind Federated Learning via Over-the-Air Aggregation

  • 设备不需信道信息,由基站用多天线合并信号
  • 通过时间感知筛选重要参数,单符号完成传输
  • 天线越多越准,噪声大时选少参数更优

我们研究在无线衰落信道下的联邦学习,多个设备同时发送模型更新。提出一种无需设备端信道状态信息的高效年龄感知边缘盲空中聚合方法。参数服务器使用多天线并基于估计的信道增益和进行最大比合并以检测参数更新。主要挑战是正交子载波数量有限,传输大量参数需多个正交频分复用(OFDM)符号,增加延迟。为此,参数服务器每轮仅选择一小部分模型坐标,采用AgeTop-k:先选幅度最大的项,再选自上次选择以来等待时间最长的k个坐标。确保所有选中参数可放入一个OFDM符号内,降低延迟。我们提供了收敛界,揭示了更多天线阵元的优势,并指出关键权衡:增大k可降低压缩误差,但会增加信道噪声影响。实验表明:(i) 更多基站天线显著提升准确率与收敛速度;(ii) 在相对良好信道下,AgeTop-k优于随机选择;(iii) 最优k值取决于信道条件,噪声大时较小的k更优。

原文摘要 · Abstract (English)

We study federated learning (FL) over wireless fading channels where multiple devices simultaneously send their model updates. We propose an efficient age-aware edge-blind over-the-air FL approach that does not require channel state information (CSI) at the devices. Instead, the parameter server (PS) uses multiple antennas and applies maximum-ratio combining (MRC) based on its estimated sum of the channel gains to detect the parameter updates. A key challenge is that the number of orthogonal subcarriers is limited; thus, transmitting many parameters requires multiple Orthogonal Frequency Division Multiplexing (OFDM) symbols, which increases latency. To address this, the PS selects only a small subset of model coordinates each round using AgeTop-k, which first picks the largest-magnitude entries and then chooses the k coordinates with the longest waiting times since they were last selected. This ensures that all selected parameters fit into a single OFDM symbol, reducing latency. We provide a convergence bound that highlights the advantages of using a higher number of antenna array elements and demonstrates a key trade-off: increasing k decreases compression error at the cost of increasing the effect of channel noise. Experimental results show that (i) more PS antennas greatly improve accuracy and convergence speed; (ii) AgeTop-k outperforms random selection under relatively good channel conditions; and (iii) the optimum k depends on the channel, with smaller k being better in noisy settings.

联邦学习无线通信边缘计算压缩策略

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