TL;DR
This paper introduces MU-SplitFed, a novel unbalanced update method for split federated learning that enhances resilience to stragglers by allowing multiple local updates, thereby improving convergence and efficiency.
Contribution
The paper proposes MU-SplitFed, a straggler-resilient algorithm for split federated learning that decouples training progress from straggler delays using an unbalanced update mechanism.
Findings
Achieves a convergence rate of O(√(d/τT)) for non-convex objectives.
Demonstrates a linear speedup in communication rounds with increased local updates.
Outperforms baseline methods in the presence of stragglers.
Abstract
Split Federated Learning (SFL) enables scalable training on edge devices by combining the parallelism of Federated Learning (FL) with the computational offloading of Split Learning (SL). Despite its great success, SFL suffers significantly from the well-known straggler issue in distributed learning systems. This problem is exacerbated by the dependency between Split Server and clients: the Split Server side model update relies on receiving activations from clients. Such synchronization requirement introduces significant time latency, making straggler a critical bottleneck to the scalability and efficiency of the system. To mitigate this problem, we propose MU-SplitFed, a straggler-resilient SFL algorithm in zeroth-order optimization that decouples training progress from straggler delays via a simple yet effective unbalanced update mechanism. By enabling the server to perform …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
