Channel-Aware Joint AoI and Diversity Optimization for Client Scheduling in Federated Learning With Non-IID Datasets

被引:0
作者
Ma, Manyou [1 ]
Wong, Vincent W. S. [1 ]
Schober, Robert [2 ]
机构
[1] Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC V6T 1Z4, Canada
[2] Friedrich Alexander Univ Erlangen Nuremberg, Inst Digital Commun, Erlangen, Germany
基金
加拿大自然科学与工程研究理事会;
关键词
Convergence; Indexes; Training; Wireless communication; Uplink; Scheduling algorithms; Scheduling; Age of information (AoI); constrained Markov decision process (CMDP); diversity; federated learning; index policy; Lagrangian index; INFORMATION; AGE;
D O I
10.1109/TWC.2023.3330967
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Federated learning (FL) is a distributed learning framework where clients jointly train a global model without sharing their local datasets. In each communication round of FL, a subset of clients are scheduled to participate in training. Recent research has shown that diversity-based FL can improve the convergence performance of FL, especially when the client datasets are not independent and identically distributed (non-IID). In this paper, we show that by considering the channel state information and age of information (AoI) of each client, the convergence of FL can further be improved. We formulate a channel-aware joint AoI and diversity-based client scheduling problem as a constrained Markov decision process (CMDP). By using Lagrangian index and one-step lookahead approaches, we develop a two-stage online algorithm which is scalable and has a low computational complexity. For FL tasks with non-IID client datasets, our results show that the proposed algorithm can speed up the convergence of FL by up to 71%, through reducing the duration of uplink transmission, when compared with three state-of-the-art FL algorithms.
引用
收藏
页码:6295 / 6311
页数:17
相关论文
共 30 条
[1]  
[Anonymous], 2012, Dynamic programming and optimal control
[2]  
Balakrishnan T., 2022, P INT C LEARN REPR I, P1
[3]   Age of Information for Updates With Distortion: Constant and Age-Dependent Distortion Constraints [J].
Bastopcu, Melih ;
Ulukus, Sennur .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2021, 29 (06) :2425-2438
[4]  
Bertsekas D. P., 2012, Dynamic Programming and Optimal Control, V2
[5]  
Brand J. v. d., 2020, P 31 ANN ACMS S, P259
[6]   Index Policies and Performance Bounds for Dynamic Selection Problems [J].
Brown, David B. ;
Smith, James E. .
MANAGEMENT SCIENCE, 2020, 66 (07) :3029-3050
[7]   Joint Optimization of Cooperative Beamforming and Relay Assignment in Multi-User Wireless Relay Networks [J].
Che, Enlong ;
Hoang Duong Tuan ;
Nguyen, Ha H. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2014, 13 (10) :5481-5495
[8]  
Fraboni R., 2021, PMLR, P3407
[9]  
Grant S., 2020, CVX MATLAB SOFTWARE
[10]   Asymptotically Optimal Lagrangian Priority Policy for Deadline Scheduling With Processing Rate Limits [J].
Hao, Liangliang ;
Xu, Yunjian ;
Tong, Lang .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2022, 67 (01) :236-250