Incentivize to Build: A Crowdsourcing Framework for Federated Learning

Shashi Raj Pandey, N. H. Tran, M. Bennis, Y. Tun, Zhu Han, C. Hong
{"title":"Incentivize to Build: A Crowdsourcing Framework for Federated Learning","authors":"Shashi Raj Pandey, N. H. Tran, M. Bennis, Y. Tun, Zhu Han, C. Hong","doi":"10.1109/GLOBECOM38437.2019.9014329","DOIUrl":null,"url":null,"abstract":"Federated learning (FL) rests on the notion of training a global model in a decentralized manner. Under this setting, mobile devices perform computations on their local data before uploading the required updates to the central aggregator for improving the global model. However, a key challenge is to maintain communication efficiency (i.e., the number of communications per iteration) when participating clients implement uncoordinated computation strategy during aggregation of model parameters. We formulate a utility maximization problem to tackle this difficulty, and propose a novel crowdsourcing framework, involving a number of participating clients with local training data to leverage FL. We show the incentive-based interaction between the crowdsourcing platform and the participating client's independent strategies for training a global learning model, where each side maximizes its own benefit. We formulate a two-stage Stackelberg game to analyze such scenario and find the game's equilibria. Further, we illustrate the efficacy of our proposed framework with simulation results. Results show that the proposed mechanism outperforms the heuristic approach with up to 22% gain in the offered reward to attain a level of target accuracy.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"11 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM38437.2019.9014329","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

Abstract

Federated learning (FL) rests on the notion of training a global model in a decentralized manner. Under this setting, mobile devices perform computations on their local data before uploading the required updates to the central aggregator for improving the global model. However, a key challenge is to maintain communication efficiency (i.e., the number of communications per iteration) when participating clients implement uncoordinated computation strategy during aggregation of model parameters. We formulate a utility maximization problem to tackle this difficulty, and propose a novel crowdsourcing framework, involving a number of participating clients with local training data to leverage FL. We show the incentive-based interaction between the crowdsourcing platform and the participating client's independent strategies for training a global learning model, where each side maximizes its own benefit. We formulate a two-stage Stackelberg game to analyze such scenario and find the game's equilibria. Further, we illustrate the efficacy of our proposed framework with simulation results. Results show that the proposed mechanism outperforms the heuristic approach with up to 22% gain in the offered reward to attain a level of target accuracy.
激励构建:联邦学习的众包框架
联邦学习(FL)基于以分散的方式训练全局模型的概念。在此设置下,移动设备在将所需的更新上传到中央聚合器以改进全局模型之前,先对其本地数据执行计算。然而,当参与的客户端在模型参数聚合期间实现不协调的计算策略时,一个关键的挑战是保持通信效率(即每次迭代的通信数量)。我们提出了一个效用最大化问题来解决这一困难,并提出了一个新的众包框架,涉及许多具有本地训练数据的参与客户来利用FL。我们展示了众包平台和参与客户的独立策略之间基于激励的互动,以训练一个全局学习模型,其中每一方都最大化了自己的利益。我们建立了一个两阶段的Stackelberg博弈来分析这种情况并找到博弈的平衡点。此外,我们用仿真结果说明了我们提出的框架的有效性。结果表明,所提出的机制优于启发式方法,在提供的奖励中获得高达22%的增益,以达到目标精度的水平。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信