An Efficient and Robust Aggregation Algorithm for Learning Federated CNN

Yanyang Lu, Lei Fan
{"title":"An Efficient and Robust Aggregation Algorithm for Learning Federated CNN","authors":"Yanyang Lu, Lei Fan","doi":"10.1145/3432291.3432303","DOIUrl":null,"url":null,"abstract":"Federated learning is a privacy-protected way of decentralized machine learning. In a Federated Learning system, the server uses the aggregation algorithm to obtain a global model from clients. The traditional aggregation method called FedAvg is a simple arithmetic average, but it has never been proved efficient. Moreover, there are many potential attacks and network instability in Federated Learning systems. This paper aims to achieve two goals by replacing the server-side aggregation strategy: 1) Accelerate global model's convergence speed 2) Make global model reliable when facing network instability and offline attacks. Considering different clients' contributions have different impacts, we try to use gaussian distribution to weight clients' potential contributions. To make the aggregation process more modality to different neural network architecture, we try to solve the above problems on Convolution Neural Network as a representation. To work well on different functional units in neural networks, we also propose layer-wise optimizing steps. We have experimented on some representative tasks of Federated Learning, and the results show that our method exceeds FedAvg a lot on convergence speed. When simulating attack situations, our algorithm could be proved to maintain a reliable global model.","PeriodicalId":126684,"journal":{"name":"Proceedings of the 2020 3rd International Conference on Signal Processing and Machine Learning","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 3rd International Conference on Signal Processing and Machine Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3432291.3432303","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Federated learning is a privacy-protected way of decentralized machine learning. In a Federated Learning system, the server uses the aggregation algorithm to obtain a global model from clients. The traditional aggregation method called FedAvg is a simple arithmetic average, but it has never been proved efficient. Moreover, there are many potential attacks and network instability in Federated Learning systems. This paper aims to achieve two goals by replacing the server-side aggregation strategy: 1) Accelerate global model's convergence speed 2) Make global model reliable when facing network instability and offline attacks. Considering different clients' contributions have different impacts, we try to use gaussian distribution to weight clients' potential contributions. To make the aggregation process more modality to different neural network architecture, we try to solve the above problems on Convolution Neural Network as a representation. To work well on different functional units in neural networks, we also propose layer-wise optimizing steps. We have experimented on some representative tasks of Federated Learning, and the results show that our method exceeds FedAvg a lot on convergence speed. When simulating attack situations, our algorithm could be proved to maintain a reliable global model.
一种高效鲁棒的联邦CNN学习聚合算法
联邦学习是一种隐私保护的去中心化机器学习方式。在联邦学习系统中,服务器使用聚合算法从客户端获取全局模型。传统的聚合方法称为fedag,它是一种简单的算术平均值,但从未被证明是有效的。此外,在联邦学习系统中存在许多潜在的攻击和网络不稳定性。本文通过替换服务器端聚合策略实现两个目标:1)加快全局模型的收敛速度;2)使全局模型在面对网络不稳定和离线攻击时可靠。考虑到不同客户的贡献具有不同的影响,我们尝试使用高斯分布来加权客户的潜在贡献。为了使聚合过程对不同的神经网络结构具有更多的模态性,我们尝试用卷积神经网络作为表征来解决上述问题。为了在神经网络的不同功能单元上很好地工作,我们还提出了分层优化步骤。我们在一些具有代表性的联邦学习任务上进行了实验,结果表明我们的方法在收敛速度上大大超过了fedag。通过对攻击情况的仿真,证明了该算法保持了一个可靠的全局模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信