提出新型联邦学习框架,让边缘设备无需反向传播即可高效训练大模型。
HO-SFL: Hybrid-Order Split Federated Learning with Backprop-Free Clients and Dimension-Free Aggregation
- 服务器用精确一阶优化,客户端用零阶优化,降低内存消耗。
- 理论证明收敛速度接近一阶方法,通信开销大幅下降。
- 适用于资源受限的视觉与语言任务,适合边缘设备部署。
在边缘设备上微调大型模型受到标准联邦学习和分层学习框架中内存密集型反向传播(BP)的严重制约。尽管用零阶优化替代BP可显著降低内存占用,但通常导致收敛速度急剧下降。为解决这一困境,我们提出混合阶分层联邦学习(HO-SFL)。通过在拉格朗日框架下重构分层学习过程,HO-SFL解耦优化空间:服务器执行精确的一阶更新(即BP),客户端则进行内存高效的零阶优化。该混合设计不仅消除了客户端对BP的需求,还实现了无维度的模型聚合,大幅降低通信成本。关键的是,我们提供了理论收敛性分析,证明HO-SFL缓解了零阶优化固有的维度依赖性收敛慢问题,达到与一阶方法相当的收敛速率。在视觉与语言多任务上的大量实验验证表明,HO-SFL在保持与一阶基线相当的收敛速度的同时,显著降低了通信开销和客户端内存占用。
原文摘要 · Abstract (English)
Fine-tuning large models on edge devices is severely hindered by the memory-intensive backpropagation (BP) in standard frameworks like federated learning and split learning. While substituting BP with zeroth-order optimization can significantly reduce memory footprints, it typically suffers from prohibitively degraded convergence speed. To resolve this dilemma, we propose Hybrid-Order Split Federated Learning (HO-SFL). By reformulating the split learning process within a Lagrangian framework, HO-SFL decouples the optimization landscape: The server performs precise first-order updates (i.e., BP), whereas clients conduct memory-efficient zeroth-order optimization. This hybrid design not only eliminates the need for client-side BP but also enables dimension-free model aggregation, drastically lowering communication costs. Crucially, we provide a theoretical convergence analysis, demonstrating that HO-SFL mitigates the dimension-dependent convergence slowdown of zeroth-order optimization, achieving a convergence rate comparable to first-order methods. Extensive experiments on tasks across vision and language modalities validate that HO-SFL achieves convergence speeds comparable to first-order baselines while significantly reducing communication costs and client memory footprints.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。