Online Client Scheduling for Fast Federated Learning

Bo Xu, Wenchao Xia, Jun Zhang, Tony Q.S. Quek, Hongbo Zhu

研究成果: Article同行評審

摘要

Federated learning (FL) enables clients to collaboratively learn a shared task while keeping data privacy, which can be adopted at the edge of wireless networks to improve edge intelligence. In this letter, we aim to minimize the training latency of a wireless FL system for a given training loss by client scheduling. Instead of assuming that the prior information about wireless channel state and local computing power of the clients is available, we consider a more practical scenario without knowing the prior information. We first reformulate the client scheduling problem as a multi-armed bandit program and then propose an online scheduling scheme based on ϵ -greedy algorithm to achieve a tradeoff between exploration and exploitation. In addition, the proposed client scheduling scheme reduces the number of training rounds and the time interval per round simultaneously by jointly considering the significance of local updates and delay issue of each client. Simulation results show that in the case of non-independent and identically distributed data, the proposed scheme can save half the training time compared to the scheme which only considers the significance of local updates, and can improve more than 20% test accuracy compared to the scheme which only considers the time consumption per round of each client.

原文English
文章編號9390199
頁(從 - 到)1434-1438
頁數5
期刊IEEE Wireless Communications Letters
10
發行號7
DOIs
出版狀態Published - 2021 七月

All Science Journal Classification (ASJC) codes

  • 控制與系統工程
  • 電氣與電子工程

指紋

深入研究「Online Client Scheduling for Fast Federated Learning」主題。共同形成了獨特的指紋。

引用此