Joint Client Scheduling and Quantization Optimization in Energy Harvesting-Enabled Federated Learning Networks

被引:3
作者
Ni, Zhengwei [1 ]
Zhang, Zhaoyang [2 ,3 ,4 ,5 ]
Luong, Nguyen Cong [6 ]
Niyato, Dusit [7 ]
Kim, Dong In [8 ]
Feng, Shaohan [1 ]
机构
[1] Zhejiang Gongshang Univ, Sussex Artificial Intelligence Inst, Sch Informat & Elect Engn, Hangzhou 310018, Peoples R China
[2] Zhejiang Univ, Coll Informat Sci & Elect Engn, Hangzhou 310027, Peoples R China
[3] Key Lab Informat Proc Commun & Networking Zhejiang, Hangzhou 310027, Peoples R China
[4] Key Lab Collaborat Sensing & Autonomous Unmanned S, Hangzhou 310015, Peoples R China
[5] Zhejiang Univ, Int Joint Innovat Ctr, Haining 314400, Peoples R China
[6] Phenikaa Univ, Fac Comp Sci, Hanoi 12116, Vietnam
[7] Nanyang Technol Univ, Sch Comp Sci & Engn, Singapore 639798, Singapore
[8] Sungkyunkwan Univ, Dept Elect & Comp Engn, Suwon 16419, South Korea
基金
中国国家自然科学基金; 新加坡国家研究基金会;
关键词
Quantization (signal); Training; Wireless communication; Convergence; Cause effect analysis; Task analysis; Servers; Federated learning; client scheduling; quantization; fairness; energy harvesting; MIXED-INTEGER; TRANSMISSION; ALLOCATION; RECEIVERS; ALGORITHM;
D O I
10.1109/TWC.2024.3363706
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A vital challenge in the deployment of federated learning (FL) over wireless networks is the high energy consumption incurred for the local computation and model update upload on energy-constrained devices such as IoT sensors. Equipping with energy harvesting (EH) modules is a promising solution that allows the devices to work in a self-sustainable manner. Moreover, quantizing the model updates can further improve the energy efficiency during the upload. In this paper, we propose an EH-enabled FL system with model quantization in which EH devices act as clients and client scheduling, model quantization, and transmit energy are jointly optimized to minimize the training loss while satisfying energy causality constraints and guaranteeing fairness in client selection. We formulate a non-convex mixed-integer nonlinear programming (MINLP) problem for the optimization. Then, by recasting the product of a continuous variable and a 0-1 variable in an equivalent linear form, we transform this non-convex MINLP problem into a convex problem and solve it. We present numerical evaluations on various datasets to show that our proposed system is stable and achieves high performance regardless of whether the loss function is convex or non-convex and whether the data distributions are independent and identically distributed (i.i.d.) or non-i.i.d.
引用
收藏
页码:9566 / 9582
页数:17
相关论文
共 64 条
  • [1] Acar DAE, 2021, Arxiv, DOI arXiv:2111.04263
  • [2] Alistarh D, 2017, ADV NEUR IN, V30
  • [3] ApS M., 2022, The MOSEK optimization toolbox for MATLAB manual
  • [4] Blasco P, 2013, IEEE INT SYMP INFO, P1601, DOI 10.1109/ISIT.2013.6620497
  • [5] Dynamic Aggregation for Heterogeneous Quantization in Federated Learning
    Chen, Shengbo
    Shen, Cong
    Zhang, Lanxue
    Tang, Yuanmin
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2021, 20 (10) : 6804 - 6819
  • [6] Drumond M, 2018, ADV NEUR IN, V31
  • [7] Fading channel prediction for mobile radio adaptive transmission systems
    Duel-Hallen, Alexandra
    [J]. PROCEEDINGS OF THE IEEE, 2007, 95 (12) : 2299 - 2313
  • [8] AN OUTER-APPROXIMATION ALGORITHM FOR A CLASS OF MIXED-INTEGER NONLINEAR PROGRAMS
    DURAN, MA
    GROSSMANN, IE
    [J]. MATHEMATICAL PROGRAMMING, 1986, 36 (03) : 307 - 339
  • [9] Joint Service Pricing and Cooperative Relay Communication for Federated Learning
    Feng, Shaohan
    Niyato, Dusit
    Wang, Ping
    Kim, Dong In
    Liang, Ying-Chang
    [J]. 2019 INTERNATIONAL CONFERENCE ON INTERNET OF THINGS (ITHINGS) AND IEEE GREEN COMPUTING AND COMMUNICATIONS (GREENCOM) AND IEEE CYBER, PHYSICAL AND SOCIAL COMPUTING (CPSCOM) AND IEEE SMART DATA (SMARTDATA), 2019, : 815 - 820
  • [10] SOLVING MIXED-INTEGER NONLINEAR PROGRAMS BY OUTER APPROXIMATION
    FLETCHER, R
    LEYFFER, S
    [J]. MATHEMATICAL PROGRAMMING, 1994, 66 (03) : 327 - 349