提出SplitMe框架,降低O-RAN中联邦学习通信与计算开销
Communication and Computation Efficient Split Federated Learning in O-RAN
- 通过互学习机制交替训练近实时与非实时控制器模型,避免频繁数据传输
- 采用零阶技术求解逆模型,实现最终模型融合,提升收敛速度
- 联合优化资源分配与更新策略,满足延迟要求,适合5G O-RAN部署
O-RAN的分层架构催生了基于非实时和近实时无线智能控制器(near-RT-RIC)数据的新型联邦学习范式。然而,模型规模增大导致训练时间延长,威胁到非实时与近实时RIC的时限要求。为此,分割联邦学习(SFL)将部分模型层卸载至高性能非实时RIC以缓解计算压力。但其部署面临两大挑战:(i) SFL中近实时与非实时RIC间频繁的数据/梯度传输在O-RAN中带来显著通信开销;(ii) 计算与通信资源的合理分配对满足时限和影响SFL收敛至关重要。为此,我们提出SplitMe框架,利用互学习机制交替独立训练近实时RIC模型与非实时RIC的逆模型,消除频繁传输。通过零阶技术推导逆模型的逆,完成最终模型集成。进一步构建联合优化问题,实现面向时延的近实时RIC选择与自适应本地更新,最小化整体资源开销。数值结果表明,SplitMe在成本与收敛性方面显著优于SFL、FedAvg和O-RANFed。
原文摘要 · Abstract (English)
The hierarchical architecture of Open Radio Access Network (O-RAN) has enabled a new Federated Learning (FL) paradigm that trains models using data from non- and near-real-time (near-RT) Radio Intelligent Controllers (RICs). However, the ever-increasing model size leads to longer training time, jeopardizing the deadline requirements for both non-RT and near-RT RICs. To address this issue, split federated learning (SFL) offers an approach by offloading partial model layers from near-RT-RIC to high-performance non-RT-RIC. Nonetheless, its deployment presents two challenges: (i) Frequent data/gradient transfers between near-RT-RIC and non-RT-RIC in SFL incur significant communication cost in O-RAN. (ii) Proper allocation of computational and communication resources in O-RAN is vital to satisfying the deadline and affects SFL convergence. Therefore, we propose SplitMe, an SFL framework that exploits mutual learning to alternately and independently train the near-RT-RIC's model and the non-RT-RIC's inverse model, eliminating frequent transfers. The ''inverse'' of the inverse model is derived via a zeroth-order technique to integrate the final model. Then, we solve a joint optimization problem for SplitMe to minimize overall resource costs with deadline-aware selection of near-RT-RICs and adaptive local updates. Our numerical results demonstrate that SplitMe remarkably outperforms FL frameworks like SFL, FedAvg and O-RANFed regarding costs and convergence.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。