Intelligent Frameworks for Minimizing Job Completion Time in Clustered Federated Learning
Federated Learning (FL) enables potentially a large number of clients to collaboratively train a global model with the coordination of a central cloud server without exposing client raw data. However, the FL model convergence performance, often measured by the job completion time, is hindered by two critical factors: non independent and identically distributed (non-IID) data across clients and the straggler effect. In this work, we propose a clustered FL framework, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">MCFL</i>, to minimize the job completion time by mitigating the influence of non-IID data and the straggler effect while guaranteeing the FL model convergence performance. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">MCFL</i> builds upon a two-stage operation: i) a clustering algorithm constructs clusters, each containing clients with similar computing and communications capabilities to combat the straggler effect within a cluster; ii) a deep reinforcement learning (DRL) algorithm based on soft actor-critic with discrete actions intelligently selects a subset of clients from each cluster to mitigate the impact of non-IID data, and derives the number of intra-cluster aggregation iterations for each cluster to reduce the straggler effect among clusters. We next propose <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A-MCFL</i>, a semi-asynchronous clustered framework based on context-aware Multi-Armed Bandit (MAB) client selection algorithm to further reduce job completion time. Extensive testbed experiments are conducted under various configurations to verify the efficacy of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">MCFL</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A-MCFL</i>. The results show that <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">MCFL</i> can reduce the job completion time by up to 70% compared with three state-of-the-art FL frameworks. In addition, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A-MCFL</i> has a further performance improvement over <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">MCFL</i>, achieving an average 64% reduction in job completion time.
Authors
- Ruiting Zhou (ORCID: https://orcid.org/0000-0001-9681-6482)
- Jieling Yu (ORCID: https://orcid.org/0000-0003-0485-8162)
- Bo Li (ORCID: https://orcid.org/0000-0001-5980-4861)
- Libing Wu (ORCID: https://orcid.org/0000-0001-9897-1953)
Institutions
- Hong Kong University of Science and Technology (HK)
- Wuhan University (CN)
- Southeast University (CN)
Publication Details
- Journal
- IEEE Transactions on Networking
- Published
- 2025-09-23
- DOI
- https://doi.org/10.1109/ton.2025.3600674
- Primary Topic
- Privacy-Preserving Technologies in Data
- Type
- article
- Field-Weighted Citation Impact
- 0.00