基于模型分解的多任务联邦学习任务选择与资源优化

IF 3.7 3区 计算机科学 Q2 TELECOMMUNICATIONS
Haowen Sun;Ming Chen;Zhaohui Yang;Yijin Pan;Yihan Cang;Zhaoyang Zhang
{"title":"基于模型分解的多任务联邦学习任务选择与资源优化","authors":"Haowen Sun;Ming Chen;Zhaohui Yang;Yijin Pan;Yihan Cang;Zhaoyang Zhang","doi":"10.1109/LCOMM.2024.3511663","DOIUrl":null,"url":null,"abstract":"In this letter, we investigate the training latency minimization problem for a multi-task federated learning (FL) framework with model decomposition over wireless communication networks. To handle the non-independent and non-identically distributed (non-IID) data, we first transform the multi-class classification task into multiple binary classification tasks. We then introduce sampling equalization to ensure the convergence of FL system. The optimization problem aims to minimize the training latency under energy and FL convergence constraints by optimizing task selection, number of learning iterations, and communication resource allocation. We decompose it into three sub-problems and propose alternating algorithm to address each sub-problem iteratively. Numerical results validate that the proposed algorithm significantly reduces time consumption compared to the conventional algorithms.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 1","pages":"225-229"},"PeriodicalIF":3.7000,"publicationDate":"2024-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Task Selection and Resource Optimization in Multi-Task Federated Learning With Model Decomposition\",\"authors\":\"Haowen Sun;Ming Chen;Zhaohui Yang;Yijin Pan;Yihan Cang;Zhaoyang Zhang\",\"doi\":\"10.1109/LCOMM.2024.3511663\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this letter, we investigate the training latency minimization problem for a multi-task federated learning (FL) framework with model decomposition over wireless communication networks. To handle the non-independent and non-identically distributed (non-IID) data, we first transform the multi-class classification task into multiple binary classification tasks. We then introduce sampling equalization to ensure the convergence of FL system. The optimization problem aims to minimize the training latency under energy and FL convergence constraints by optimizing task selection, number of learning iterations, and communication resource allocation. We decompose it into three sub-problems and propose alternating algorithm to address each sub-problem iteratively. Numerical results validate that the proposed algorithm significantly reduces time consumption compared to the conventional algorithms.\",\"PeriodicalId\":13197,\"journal\":{\"name\":\"IEEE Communications Letters\",\"volume\":\"29 1\",\"pages\":\"225-229\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2024-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Communications Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10778551/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10778551/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

在这封信中,我们研究了无线通信网络上具有模型分解的多任务联邦学习(FL)框架的训练延迟最小化问题。为了处理非独立和非同分布(non-IID)数据,我们首先将多类分类任务转换为多个二元分类任务。然后引入采样均衡以保证系统的收敛性。优化问题旨在通过优化任务选择、学习迭代次数和通信资源分配,使能量和FL收敛约束下的训练延迟最小化。我们将其分解为三个子问题,并提出了迭代求解每个子问题的交替算法。数值结果表明,与传统算法相比,该算法显著降低了时间消耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Task Selection and Resource Optimization in Multi-Task Federated Learning With Model Decomposition
In this letter, we investigate the training latency minimization problem for a multi-task federated learning (FL) framework with model decomposition over wireless communication networks. To handle the non-independent and non-identically distributed (non-IID) data, we first transform the multi-class classification task into multiple binary classification tasks. We then introduce sampling equalization to ensure the convergence of FL system. The optimization problem aims to minimize the training latency under energy and FL convergence constraints by optimizing task selection, number of learning iterations, and communication resource allocation. We decompose it into three sub-problems and propose alternating algorithm to address each sub-problem iteratively. Numerical results validate that the proposed algorithm significantly reduces time consumption compared to the conventional algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Communications Letters
IEEE Communications Letters 工程技术-电信学
CiteScore
8.10
自引率
7.30%
发文量
590
审稿时长
2.8 months
期刊介绍: The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.
×
引用
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学术官方微信