Joint User Cooperation and Scheduling for Federated Learning in CFmMIMO Networks

Han Bao, Bo Gao, Ke Xiong, Pingyi Fan
{"title":"Joint User Cooperation and Scheduling for Federated Learning in CFmMIMO Networks","authors":"Han Bao, Bo Gao, Ke Xiong, Pingyi Fan","doi":"10.1109/ICSTSN57873.2023.10151575","DOIUrl":null,"url":null,"abstract":"This paper proposes a joint user cooperation and scheduling (JUCS) method to minimize the maximum transmission time among users in the synchronous federated learning (FL) architecture, since the user with the worst quality link limits the training performance of FL. To this end, an optimization problem is formulated to find the optimal user cooperation pairing and the power control coefficients. Meanwhile, as the links among users operate on the same frequency bands, the interface between them is taken into account in this paper. As the problem is non-convex, we decouple it into two sub-problems. For the first sub-problem, we propose a fair scheduling (FS)-based algorithm to schedule the helping users to pair with the ones who are required to be assisted. For the second sub-problem, an algorithm based on deterministic policy gradient (DDPG) is proposed to find the optimized power control coefficients. Experiments show that the proposed JUCS method shortens about 34.48% transmission time of the worst user in FL compared to the traditional one without JUCS.","PeriodicalId":325019,"journal":{"name":"2023 2nd International Conference on Smart Technologies and Systems for Next Generation Computing (ICSTSN)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 2nd International Conference on Smart Technologies and Systems for Next Generation Computing (ICSTSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSTSN57873.2023.10151575","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes a joint user cooperation and scheduling (JUCS) method to minimize the maximum transmission time among users in the synchronous federated learning (FL) architecture, since the user with the worst quality link limits the training performance of FL. To this end, an optimization problem is formulated to find the optimal user cooperation pairing and the power control coefficients. Meanwhile, as the links among users operate on the same frequency bands, the interface between them is taken into account in this paper. As the problem is non-convex, we decouple it into two sub-problems. For the first sub-problem, we propose a fair scheduling (FS)-based algorithm to schedule the helping users to pair with the ones who are required to be assisted. For the second sub-problem, an algorithm based on deterministic policy gradient (DDPG) is proposed to find the optimized power control coefficients. Experiments show that the proposed JUCS method shortens about 34.48% transmission time of the worst user in FL compared to the traditional one without JUCS.
CFmMIMO网络中联合用户协作与联邦学习调度
针对同步联邦学习(FL)体系结构中链路质量最差的用户限制了FL的训练性能,提出了一种联合用户协作与调度(joint user cooperation and scheduling, JUCS)方法,以最小化用户间的最大传输时间。为此,构造了一个优化问题,求出最优的用户协作配对和功率控制系数。同时,由于用户之间的链路运行在同一频段,因此本文考虑了用户之间的接口问题。由于问题是非凸的,我们将其解耦成两个子问题。对于第一个子问题,我们提出了一种基于公平调度(FS)的算法来调度帮助用户与需要帮助的用户配对。针对第二个子问题,提出了一种基于确定性策略梯度(DDPG)的算法来寻找最优的功率控制系数。实验表明,所提出的JUCS方法与传统的无JUCS方法相比,可使FL中最差用户的传输时间缩短34.48%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信