A Shapley value-enhanced evaluation technique for effective aggregation in Federated Learning

Mohammadreza Salarbashishahri, S. Okegbile, Jun Cai
{"title":"A Shapley value-enhanced evaluation technique for effective aggregation in Federated Learning","authors":"Mohammadreza Salarbashishahri, S. Okegbile, Jun Cai","doi":"10.1109/FNWF55208.2022.00024","DOIUrl":null,"url":null,"abstract":"5G networks make it possible to transfer real-time sensory data between millions of devices, forming the internet of things. A typical method to utilize these data is to train a machine learning algorithm to extract the features. Federated learning (FL) is a platform for a coalition of clients to train a model collaboratively without sharing their data to preserve data privacy. Data and model poisoning attacks, free-riding attacks, and model divergence due to clients' non-independent and identically distributed (non-IID) datasets are some challenges in conventional federated learning. The lack of an evaluation method in federated averaging (FedAvg) in FL makes it impossible to identify malicious users or amend the divergence of the global model. In this study, we propose a Shapley-based aggregation algorithm called Shapley averaging (ShapAvg) to aggregate the global model more effectively by evaluating the clients' models. In this algorithm, each client's weight in the weighted average will be proportional to its contribution to the global model performance. The results show that the proposed method outperforms FedAvg when using non-IID datasets and in case of data poisoning or free-riding attacks.","PeriodicalId":300165,"journal":{"name":"2022 IEEE Future Networks World Forum (FNWF)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Future Networks World Forum (FNWF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FNWF55208.2022.00024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

5G networks make it possible to transfer real-time sensory data between millions of devices, forming the internet of things. A typical method to utilize these data is to train a machine learning algorithm to extract the features. Federated learning (FL) is a platform for a coalition of clients to train a model collaboratively without sharing their data to preserve data privacy. Data and model poisoning attacks, free-riding attacks, and model divergence due to clients' non-independent and identically distributed (non-IID) datasets are some challenges in conventional federated learning. The lack of an evaluation method in federated averaging (FedAvg) in FL makes it impossible to identify malicious users or amend the divergence of the global model. In this study, we propose a Shapley-based aggregation algorithm called Shapley averaging (ShapAvg) to aggregate the global model more effectively by evaluating the clients' models. In this algorithm, each client's weight in the weighted average will be proportional to its contribution to the global model performance. The results show that the proposed method outperforms FedAvg when using non-IID datasets and in case of data poisoning or free-riding attacks.
一种用于联邦学习中有效聚合的Shapley值增强评价技术
5G网络使数百万台设备之间的实时传感数据传输成为可能,形成了物联网。利用这些数据的典型方法是训练机器学习算法来提取特征。联邦学习(FL)是一个供客户联盟协作训练模型的平台,无需共享数据以保护数据隐私。数据和模型中毒攻击、搭便车攻击以及由于客户端非独立和同分布(非iid)数据集而导致的模型分歧是传统联邦学习中的一些挑战。FL中联邦平均(FedAvg)缺乏评估方法,使得无法识别恶意用户或修正全局模型的散度。在本研究中,我们提出了一种基于Shapley的聚合算法,称为Shapley平均(ShapAvg),通过评估客户的模型来更有效地聚合全局模型。在该算法中,每个客户端在加权平均值中的权重将与其对全局模型性能的贡献成正比。结果表明,该方法在使用非iid数据集以及数据中毒或搭便车攻击的情况下优于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学术官方微信