Efficient Resource Optimization for Split Federated Learning

arXiv:2608.17849v1 Announce Type: new Abstract: Split federated learning (SFL) has emerged as a powerful paradigm for model training at the edge. However, SFL inherently involves discrete decision variables for model splitting and resource allocation, resulting in a challenging mixed-integer problem. Consequently, prior optimization schemes for SFL are either extit{heuristic} or extit{computationally inefficient}, which cannot handle large-scale user populations. To address this limitation, this work establishes an efficient optimization framework for SFL under resource-constrained networks. Our framework jointly optimizes model splitting and resource allocation to minimize training cost, which is defined as the weighted sum of latency and energy costs. We first study the model splitting problem and develop a polynomial-time algorithm that achieves the global optimum. Then, we extend the approach to the joint model splitting and resource allocation problem. In this case, we formulate it as a two-dimensional master problem and develop an efficient approximation method with a (1+epsilon)-approximation guarantee. Extensive experiments show that the proposed approach provides efficient solutions to strike the optimal energy--latency tradeoff.

Related

• DisAgg: Distributed Aggregators for Efficient Secure Aggregation in Federated Learning
• Fed-DLoRA: Efficient Wireless Federated Learning with Dynamic Low-Rank Adaptation
• Subspace Optimization for Efficient Federated Learning under Heterogeneous Data
• Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications

Source: arXiv cs.LG | 2026-08-19