{"title":"An efficient federated learning framework deployed in resource-constrained IoV: User selection and learning time optimization schemes","authors":"Qiang Wang, Shaoyi Xu, Rongtao Xu, Dongji Li","doi":"10.23919/JCC.fa.2022-0726.202312","DOIUrl":null,"url":null,"abstract":"In this article, an efficient federated learning (FL) Framework in the Internet of Vehicles (IoV) is studied. In the considered model, vehicle users implement an FL algorithm by training their local FL models and sending their models to a base station (BS) that generates a global FL model through the model aggregation. Since each user owns data samples with diverse sizes and different quality, it is necessary for the BS to select the proper participating users to acquire a better global model. Meanwhile, considering the high computational overhead of existing selection methods based on the gradient, the lightweight user selection scheme based on the loss decay is proposed. Due to the limited wireless bandwidth, the BS needs to select an suitable subset of users to implement the FL algorithm. Moreover, the vehicle users' computing resource that can be used for FL training is usually limited in the IoV when other multiple tasks are required to be executed. The local model training and model parameter transmission of FL will have significant effects on the latency of FL. To address this issue, the joint communication and computing optimization problem is formulated whose objective is to minimize the FL delay in the resource-constrained system. To solve the complex nonconvex problem, an algorithm based on the concave-convex procedure (CCCP) is proposed, which can achieve superior performance in the small-scale and delay-insensitive FL system. Due to the fact that the convergence rate of CCCP method is too slow in a large-scale FL system, this method is not suitable for delay-sensitive applications. To solve this issue, a block coordinate descent algorithm based on the one-step projected gradient method is proposed to decrease the complexity of the solution at the cost of light performance degrading. Simulations are conducted and numerical results show the good performance of the proposed methods.","PeriodicalId":9814,"journal":{"name":"China Communications","volume":"372 2","pages":"111-130"},"PeriodicalIF":3.1000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"China Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.23919/JCC.fa.2022-0726.202312","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
In this article, an efficient federated learning (FL) Framework in the Internet of Vehicles (IoV) is studied. In the considered model, vehicle users implement an FL algorithm by training their local FL models and sending their models to a base station (BS) that generates a global FL model through the model aggregation. Since each user owns data samples with diverse sizes and different quality, it is necessary for the BS to select the proper participating users to acquire a better global model. Meanwhile, considering the high computational overhead of existing selection methods based on the gradient, the lightweight user selection scheme based on the loss decay is proposed. Due to the limited wireless bandwidth, the BS needs to select an suitable subset of users to implement the FL algorithm. Moreover, the vehicle users' computing resource that can be used for FL training is usually limited in the IoV when other multiple tasks are required to be executed. The local model training and model parameter transmission of FL will have significant effects on the latency of FL. To address this issue, the joint communication and computing optimization problem is formulated whose objective is to minimize the FL delay in the resource-constrained system. To solve the complex nonconvex problem, an algorithm based on the concave-convex procedure (CCCP) is proposed, which can achieve superior performance in the small-scale and delay-insensitive FL system. Due to the fact that the convergence rate of CCCP method is too slow in a large-scale FL system, this method is not suitable for delay-sensitive applications. To solve this issue, a block coordinate descent algorithm based on the one-step projected gradient method is proposed to decrease the complexity of the solution at the cost of light performance degrading. Simulations are conducted and numerical results show the good performance of the proposed methods.
期刊介绍:
China Communications (ISSN 1673-5447) is an English-language monthly journal cosponsored by the China Institute of Communications (CIC) and IEEE Communications Society (IEEE ComSoc). It is aimed at readers in industry, universities, research and development organizations, and government agencies in the field of Information and Communications Technologies (ICTs) worldwide.
The journal's main objective is to promote academic exchange in the ICTs sector and publish high-quality papers to contribute to the global ICTs industry. It provides instant access to the latest articles and papers, presenting leading-edge research achievements, tutorial overviews, and descriptions of significant practical applications of technology.
China Communications has been indexed in SCIE (Science Citation Index-Expanded) since January 2007. Additionally, all articles have been available in the IEEE Xplore digital library since January 2013.