检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Qiang Wang Shaoyi Xu Rongtao Xu Dongji Li
机构地区:[1]School of Electronics and Information Engineering,Beijing Jiaotong University,Beijing 100044,China [2]National Mobile Communications Research Laboratory,Southeast University,Nanjing 210096,China
出 处:《China Communications》2023年第12期111-130,共20页中国通信(英文版)
基 金:supported by the Fundamental Research Funds for the Central Universities(No.2022YJS127);the National Key Research and Development Program under Grant 2022YFB3303702;the Key Program of National Natural Science Foundation of China under Grant 61931001。
摘 要: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.
关 键 词:block coordinate descent concave-convex procedure federated learning learning time resource allocation
分 类 号:TN9[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.62