Papers
Topics
Authors
Recent
Search
2000 character limit reached

Towards Straggler-Resilient Split Federated Learning: An Unbalanced Update Approach

Published 24 Oct 2025 in cs.DC, cs.AI, and cs.LG | (2510.21155v1)

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 τ\tau local updates per client round, MU-SplitFed achieves a convergence rate of O(d/(τT))O(\sqrt{d/(\tau T)}) for non-convex objectives, demonstrating a linear speedup of τ\tau in communication rounds. Experiments demonstrate that MU-SplitFed consistently outperforms baseline methods with the presence of stragglers and effectively mitigates their impact through adaptive tuning of τ\tau. The code for this project is available at https://github.com/Johnny-Zip/MU-SplitFed.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.