用极化码按重要性保护模型更新,提升联邦学习通信效率与鲁棒性。
Polar Code Based Federated Learning: Convergence Analysis and Resource Allocation

- 基于极化码的不等错误保护,优先保护关键量化比特
- 推导收敛误差上界并联合优化量化位数与码长
- 在信道质量差时仍显著优于传统方案,适合实际通信场景
联邦学习(FL)允许多个分布式设备在不共享原始数据的情况下协同训练模型,但实践中面临严重的通信瓶颈和信道损伤问题。传统网络层处理方式或理想化信道为无错,或对传输的模型更新采用等错误保护(EEP),未能考虑单个本地模型中量化比特的重要程度差异。为此,我们提出一种跨层极化码联邦学习方案,利用极化码在有限块长下的不等错误保护(UEP)特性,有选择地保护更关键的量化比特,从而减轻信道噪声的负面影响。我们进一步对该方案进行了严格的收敛性分析,推导出收敛差距的上界,并在此基础上联合优化所有训练迭代中的量化比特数与极化码块长。实验结果表明,无论采用固定还是可变块长配置,所提方案均显著优于无编码及基于LDPC的等错误保护基准,且随着信道质量下降,优势愈发明显。这些发现验证了跨层设计在真实信道条件下提升联邦学习鲁棒性与效率的有效性。
原文摘要 · Abstract (English)
Federated learning (FL) enables collaborative model training across distributed devices without sharing raw data; however, it faces significant communication bottlenecks and channel impairments in practice. Conventional network layer treatments either idealize the channel as error free or apply equal error protection (EEP) to transmitted model updates, failing to account for the inherently unequal importance of quantization bits within a single local model. To address this limitation, we propose a cross layer polar code based FL scheme that leverages the unequal error protection (UEP) property of polar codes under finite block lengths. Specifically, the proposed design selectively protects more significant quantization bits, thereby mitigating the detrimental effects of channel noise. We further provide a rigorous convergence analysis of the proposed scheme, deriving an upper bound on the convergence gap, which we then jointly optimize over the number of quantization bits and the polar code block length across all training iterations. Experimental results demonstrate that both constant and variable block length configurations of our polar code based scheme consistently achieve substantial performance gains over uncoded and LDPC-based EEP benchmarks, with the advantage becoming increasingly pronounced as the channel quality deteriorating. These findings confirm the efficacy of our cross-layer design in enhancing FL robustness and efficiency under realistic channel conditions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。