Accelerating Wireless Distributed Learning via Hybrid Split and Federated Learning Optimization
Kun Guo, Xuefei Li, Xijun Wang, Howard H. Yang, Wei Feng, Tony Q. S. Quek
TL;DR
This work tackles accelerating wireless distributed learning by enabling Hybrid Split and Federated Learning (HSFL), where devices can operate in FL or SL mode in parallel. It develops a convergence-informed delay-minimization framework that jointly optimizes learning mode selection, model splitting, bandwidth allocation, and batch sizes, solved via a two-stage block-coordinate method with a batch-size rounding step. The proposed approach balances per-round delay with the number of rounds to convergence, and empirical results show significant reductions in overall learning delay to reach a target accuracy, especially under data heterogeneity. The methods enable practical HSFL deployment in resource-constrained wireless networks, providing a principled way to exploit both low-latency FL and high-accuracy SL within a single framework.
Abstract
Federated learning (FL) and split learning (SL) are two effective distributed learning paradigms in wireless networks, enabling collaborative model training across mobile devices without sharing raw data. While FL supports low-latency parallel training, it may converge to less accurate model. In contrast, SL achieves higher accuracy through sequential training but suffers from increased delay. To leverage the advantages of both, hybrid split and federated learning (HSFL) allows some devices to operate in FL mode and others in SL mode. This paper aims to accelerate HSFL by addressing three key questions: 1) How does learning mode selection affect overall learning performance? 2) How does it interact with batch size? 3) How can these hyperparameters be jointly optimized alongside communication and computational resources to reduce overall learning delay? We first analyze convergence, revealing the interplay between learning mode and batch size. Next, we formulate a delay minimization problem and propose a two-stage solution: a block coordinate descent method for a relaxed problem to obtain a locally optimal solution, followed by a rounding algorithm to recover integer batch sizes with near-optimal performance. Experimental results demonstrate that our approach significantly accelerates convergence to the target accuracy compared to existing methods.
