基于SignSGD的多任务联邦边缘学习

Sawan Singh Mahara, M. Shruti, B. Bharath
{"title":"基于SignSGD的多任务联邦边缘学习","authors":"Sawan Singh Mahara, M. Shruti, B. Bharath","doi":"10.1109/NCC55593.2022.9806778","DOIUrl":null,"url":null,"abstract":"The paper proposes a novel Federated Learning (FL) algorithm involving signed gradient as feedback to reduce communication overhead. The Multi-task nature of the algorithm provides each device a custom neural network after completion. Towards improving the performance, a weighted average loss across devices is proposed which considers the similarity between their data distributions. A Probably Approximately Correct (PAC) bound on the true loss in terms of the proposed empirical loss is derived. The bound is in terms of (i) Rademacher complexity, (ii) discrepancy, and (iii) penalty term. A distributed algorithm is proposed to find the discrepancy as well as the fine tuned neural network at each node. It is experimentally shown that this proposed method outperforms existing algorithms such as FedSGD, DITTO, FedAvg and locally trained neural network with good generalization on various data sets.","PeriodicalId":403870,"journal":{"name":"2022 National Conference on Communications (NCC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-Task Federated Edge Learning (MTFeeL) With SignSGD\",\"authors\":\"Sawan Singh Mahara, M. Shruti, B. Bharath\",\"doi\":\"10.1109/NCC55593.2022.9806778\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper proposes a novel Federated Learning (FL) algorithm involving signed gradient as feedback to reduce communication overhead. The Multi-task nature of the algorithm provides each device a custom neural network after completion. Towards improving the performance, a weighted average loss across devices is proposed which considers the similarity between their data distributions. A Probably Approximately Correct (PAC) bound on the true loss in terms of the proposed empirical loss is derived. The bound is in terms of (i) Rademacher complexity, (ii) discrepancy, and (iii) penalty term. A distributed algorithm is proposed to find the discrepancy as well as the fine tuned neural network at each node. It is experimentally shown that this proposed method outperforms existing algorithms such as FedSGD, DITTO, FedAvg and locally trained neural network with good generalization on various data sets.\",\"PeriodicalId\":403870,\"journal\":{\"name\":\"2022 National Conference on Communications (NCC)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC55593.2022.9806778\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC55593.2022.9806778","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了减少通信开销,提出了一种采用带符号梯度作为反馈的联邦学习算法。该算法的多任务特性在完成后为每个设备提供了一个自定义的神经网络。为了提高性能,提出了考虑数据分布相似性的设备间加权平均损耗。根据建议的经验损失,推导出真实损失的可能近似正确(PAC)界限。边界是用(i) Rademacher复杂度,(ii)差异和(iii)罚项来表示的。提出了一种分布式算法来查找每个节点上的差异并对神经网络进行微调。实验表明,该方法在各种数据集上优于FedSGD、DITTO、fedag和局部训练神经网络等现有算法,具有良好的泛化能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multi-Task Federated Edge Learning (MTFeeL) With SignSGD
The paper proposes a novel Federated Learning (FL) algorithm involving signed gradient as feedback to reduce communication overhead. The Multi-task nature of the algorithm provides each device a custom neural network after completion. Towards improving the performance, a weighted average loss across devices is proposed which considers the similarity between their data distributions. A Probably Approximately Correct (PAC) bound on the true loss in terms of the proposed empirical loss is derived. The bound is in terms of (i) Rademacher complexity, (ii) discrepancy, and (iii) penalty term. A distributed algorithm is proposed to find the discrepancy as well as the fine tuned neural network at each node. It is experimentally shown that this proposed method outperforms existing algorithms such as FedSGD, DITTO, FedAvg and locally trained neural network with good generalization on various data sets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
CoRAL: Coordinated Resource Allocation for Intercell D2D Communication in Cellular Networks Modelling the Impact of Multiple Pro-inflammatory Cytokines Using Molecular Communication STPGANsFusion: Structure and Texture Preserving Generative Adversarial Networks for Multi-modal Medical Image Fusion Intelligent On/Off Switching of mmRSUs in Urban Vehicular Networks: A Deep Q-Learning Approach Classification of Auscultation Sounds into Objective Spirometry Findings using MVMD and 3D CNN
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1