基于聚类的公平联邦学习框架

Jiaomei Zhang, Ayong Ye, Zhiqiang Yao, Minghui Sun
{"title":"基于聚类的公平联邦学习框架","authors":"Jiaomei Zhang, Ayong Ye, Zhiqiang Yao, Minghui Sun","doi":"10.1109/NaNA56854.2022.00088","DOIUrl":null,"url":null,"abstract":"Federated learning is a distributed learning with multiple participants, and the cooperation and competition among participating clients tend to raise the issue of collaborative fairness. If the collaboration among clients is not fair, resulting in resources being monopolized by some advantaged clients, depriving vulnerable clients of participation opportunities, and even causing a “Matthew effect” on client learning resources. To address the above issues, we propose a fair federated learning framework based on clustering. First, we align vulnerable participants into clusters and increase their chances of participating in the federation. The distribution of the global model in clustering is according to the principle of “allocate by work” to balance contributions and profits. We transform the clustering problem into a Liapunov online queue scheduling problem by establishing a bi-objective optimization function. Finally, through theoretical and experimental analysis, the scheme is proved to have good performance in accuracy and fairness.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Fair Federated Learning Framework based on Clustering\",\"authors\":\"Jiaomei Zhang, Ayong Ye, Zhiqiang Yao, Minghui Sun\",\"doi\":\"10.1109/NaNA56854.2022.00088\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Federated learning is a distributed learning with multiple participants, and the cooperation and competition among participating clients tend to raise the issue of collaborative fairness. If the collaboration among clients is not fair, resulting in resources being monopolized by some advantaged clients, depriving vulnerable clients of participation opportunities, and even causing a “Matthew effect” on client learning resources. To address the above issues, we propose a fair federated learning framework based on clustering. First, we align vulnerable participants into clusters and increase their chances of participating in the federation. The distribution of the global model in clustering is according to the principle of “allocate by work” to balance contributions and profits. We transform the clustering problem into a Liapunov online queue scheduling problem by establishing a bi-objective optimization function. Finally, through theoretical and experimental analysis, the scheme is proved to have good performance in accuracy and fairness.\",\"PeriodicalId\":113743,\"journal\":{\"name\":\"2022 International Conference on Networking and Network Applications (NaNA)\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Networking and Network Applications (NaNA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NaNA56854.2022.00088\",\"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 International Conference on Networking and Network Applications (NaNA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaNA56854.2022.00088","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

联邦学习是一种多参与者的分布式学习,参与的客户端之间的合作与竞争往往会引发协作公平性问题。如果客户之间的协作不公平,导致资源被一些优势客户垄断,剥夺了弱势客户的参与机会,甚至对客户的学习资源造成“马太效应”。为了解决上述问题,我们提出了一个基于聚类的公平联邦学习框架。首先,我们将脆弱的参与者整合到集群中,并增加他们参与联盟的机会。全局模型在聚类中的分布遵循“按功分配”的原则,实现贡献与收益的平衡。通过建立双目标优化函数,将聚类问题转化为Liapunov在线队列调度问题。最后,通过理论分析和实验分析,证明了该方案具有良好的准确性和公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Fair Federated Learning Framework based on Clustering
Federated learning is a distributed learning with multiple participants, and the cooperation and competition among participating clients tend to raise the issue of collaborative fairness. If the collaboration among clients is not fair, resulting in resources being monopolized by some advantaged clients, depriving vulnerable clients of participation opportunities, and even causing a “Matthew effect” on client learning resources. To address the above issues, we propose a fair federated learning framework based on clustering. First, we align vulnerable participants into clusters and increase their chances of participating in the federation. The distribution of the global model in clustering is according to the principle of “allocate by work” to balance contributions and profits. We transform the clustering problem into a Liapunov online queue scheduling problem by establishing a bi-objective optimization function. Finally, through theoretical and experimental analysis, the scheme is proved to have good performance in accuracy and fairness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信