Differentially Private Auction for Federated Learning with Non-IID Data

Kean Ren
{"title":"Differentially Private Auction for Federated Learning with Non-IID Data","authors":"Kean Ren","doi":"10.1109/ICSS55994.2022.00054","DOIUrl":null,"url":null,"abstract":"With the increase in clients’ concerns about their privacy, federated learning, as a new model of machine learning process, was proposed to help people complete learning tasks on the basis of privacy protection. But the large-scale application of federated learning depends on the extensive participation of individual clients. This motivates the incentive mechanism design to increase clients’ willingness to participate. However, the incentive mechanism should take into account non-IID issues and privacy protection of clients’ sensitive information of data distribution. These two aspects are not well studied jointly in the existing incentive mechanism design. In this paper, we propose a differentially private auction for federated learning with non-IID data. It can not only protect clients’ private information of data distribution with differential privacy but also incentivize clients with suitable data distribution to deal with non-IID issues. Finally, we prove that the designed mechanism meets the design objective through detailed theoretical analysis.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Service Science (ICSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSS55994.2022.00054","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the increase in clients’ concerns about their privacy, federated learning, as a new model of machine learning process, was proposed to help people complete learning tasks on the basis of privacy protection. But the large-scale application of federated learning depends on the extensive participation of individual clients. This motivates the incentive mechanism design to increase clients’ willingness to participate. However, the incentive mechanism should take into account non-IID issues and privacy protection of clients’ sensitive information of data distribution. These two aspects are not well studied jointly in the existing incentive mechanism design. In this paper, we propose a differentially private auction for federated learning with non-IID data. It can not only protect clients’ private information of data distribution with differential privacy but also incentivize clients with suitable data distribution to deal with non-IID issues. Finally, we prove that the designed mechanism meets the design objective through detailed theoretical analysis.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于非iid数据的联邦学习差分私有拍卖
随着客户对其隐私的关注日益增加,联邦学习作为一种新的机器学习过程模型被提出,以帮助人们在隐私保护的基础上完成学习任务。但是联邦学习的大规模应用依赖于个体客户的广泛参与。这就激发了激励机制的设计,以增加客户的参与意愿。但是,激励机制应考虑数据分发中客户敏感信息的非iid问题和隐私保护。在现有的激励机制设计中,这两个方面没有得到很好的综合研究。在本文中,我们提出了一种用于非iid数据的联邦学习的差分私有拍卖。它既能以差分隐私保护数据分布的客户私有信息,又能激励数据分布合适的客户处理非iid问题。最后,通过详细的理论分析,证明所设计的机构符合设计目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Game difficulty prediction algorithm based on improved Monte Carlo tree A Process Evaluation Method for Crossover Service Recommendation SUAM: A Service Unified Access Model for Microservice Management A Study on Sentiment Analysis for Smart Tourism Optimization of Service Scheduling in Computing Force Network
×
引用
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