arXiv:2504.14667cs.LGcs.NI2025-04被引 1

边端协同微调大模型,降低算力需求并提速训练

Efficient Split Federated Learning for Large Language Models over Communication Networks

  • 将大模型拆分+低秩适配,减轻边缘设备计算负担
  • 联合优化通信与计算资源,训练延迟显著降低
  • 适合资源受限的边端场景,尤其对通信不稳环境友好

在资源受限的边缘网络中分布式微调预训练大语言模型面临巨大挑战。为此,我们提出SflLLM框架,融合分片联邦学习与参数高效微调技术。通过模型拆分和低秩适配(LoRA),SflLLM降低边缘设备的计算负担。引入联邦服务器实现并行训练并增强数据隐私。为适应异构通信条件、多样计算能力及LoRA秩选择对收敛性与训练成本的影响,我们构建了联合优化问题,统筹优化子信道分配、功率控制、模型拆分点选择与LoRA秩配置,以最小化总训练延迟。提出迭代优化算法:子信道分配采用贪心启发式,功率控制通过辅助变量转化为凸优化,拆分点与秩选择采用穷举搜索。仿真结果表明,所提SflLLM框架在保持相近模型精度的同时,显著降低客户端计算需求;资源分配方案与自适应LoRA秩选择策略显著减少训练延迟,优于传统方法。

原文摘要 · Abstract (English)

Fine-tuning pre-trained large language models (LLMs) in a distributed manner poses significant challenges on resource-constrained edge networks. To address this challenge, we propose SflLLM, a novel framework that integrates split federated learning with parameter-efficient fine-tuning techniques. By leveraging model splitting and low-rank adaptation (LoRA), SflLLM reduces the computational burden on edge devices. Furthermore, the introduction of a federated server facilitates parallel training and enhances data privacy. To accommodate heterogeneous communication conditions and diverse computational capabilities of edge devices, as well as the impact of LoRA rank selection on model convergence and training cost, we formulate a joint optimization problem of both communication and computation resource. The formulated problem jointly optimizes subchannel allocation, power control, model splitting point selection, and LoRA rank configuration, aimed at minimizing total training delay. An iterative optimization algorithm is proposed to solve this problem efficiently. Specifically, a greedy heuristic is employed for subchannel allocation, the power control subproblem is reformulated as a convex optimization problem using auxiliary variables, and an exhaustive search is adopted for optimal split position and rank selection. Simulation results demonstrate that the proposed SflLLM framework achieves comparable model accuracy while significantly reducing client-side computational requirements. Furthermore, the proposed resource allocation scheme and adaptive LoRA rank selection strategy notably reduce the training latency compared to conventional approaches.

联邦学习大模型边缘计算低秩适配

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