Heterogeneity‐Aware Dynamic Scheduling for Federated Edge Learning
Kun Guo, Zihan Chen, Howard Hua Yang, Tony Q. S. Quek · 2023
In this chapter, we aim to design a dynamic scheduling policy to explore the spectrum flexibility for heterogeneous fe derated e dge l earning (FEEL), so as to facilitate the distributed intelligence in edge networks. Particularly, FEEL is implemented with multiple communication rounds, in each of which the scheduled device receives the global model from the edge server, updates its local model, and sends the updated local model to the edge server for global aggregation. The heterogeneity in FEEL comes from unbalanced data sizes across devices and diverse device capabilities. In this regard, we start with the convergence analysis of FEEL to determine the role of unbalanced data sizes in the learning performance. Then, based on the fact that diverse device capabilities make the completion times of local updates asynchronous, we adopt the sequential transmission for global aggregation. On this basis, we formulate a heterogeneity-aware dynamic scheduling problem to minimize the global loss function, with the consideration of straggler and limited device energy issues. By solving the formulated problem, we propose a d ynam i c sc heduling alg o rithm (DISCO), to make an intelligent decision on the set and order of scheduled devices in each communication round. Theoretical analysis reveals that under certain conditions, the learning performance and energy constraints can be guaranteed in the DISCO. Finally, we demonstrate the superiority of the DISCO through numerical and experimental results, respectively.