pFL-SBPM:为资源有限的边缘客户提供通信效率高的个性化联合学习框架

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-10-01 Epub Date: 2025-04-10 DOI:10.1016/j.future.2025.107849
Han Hu , Wenli Du , Yuqiang Li , Yue Wang
{"title":"pFL-SBPM:为资源有限的边缘客户提供通信效率高的个性化联合学习框架","authors":"Han Hu ,&nbsp;Wenli Du ,&nbsp;Yuqiang Li ,&nbsp;Yue Wang","doi":"10.1016/j.future.2025.107849","DOIUrl":null,"url":null,"abstract":"<div><div>Federated learning has attracted widespread attention due to its privacy-preserving characteristic. However, in real-world scenarios, the heterogeneity of decentralized data and the limited communication resources of clients pose great challenges to the deployment of federated training. Although existing works have made great strides in dealing with heterogeneous data or compressing communication, they struggle to strike a balance between model accuracy and communication cost. To address the above issues, this paper proposes a novel federated learning framework called pFL-SBPM, which achieves communication-efficient <strong>p</strong>ersonalized <strong>F</strong>ederated <strong>L</strong>earning through <strong>S</strong>tochastic <strong>B</strong>inary <strong>P</strong>robability <strong>M</strong>asks. Specifically, we utilize probability mask optimization instead of conventional weight training, where clients obtain personalized sparse subnetworks adapted to local task requirements by cooperative optimization of probability masks in a randomly weighted network. We develop an uplink communication strategy based on stochastic binary masks and a downlink communication strategy based on binary encoding and decoding, which achieves enhanced privacy protection while dramatically reducing the communication cost. Furthermore, to effectively handle heterogeneous data while mitigating the negative impact of the introduction of stochasticity on the stability of federated training, we carefully design a soft-threshold based selective updating strategy for probability masks. The experimental results show the significant superiority and competitiveness of pFL-SBPM compared to existing baseline and state-of-the-art methods in terms of inference accuracy, communication cost, computational cost and model size.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"171 ","pages":"Article 107849"},"PeriodicalIF":6.2000,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"pFL-SBPM: A communication-efficient personalized federated learning framework for resource-limited edge clients\",\"authors\":\"Han Hu ,&nbsp;Wenli Du ,&nbsp;Yuqiang Li ,&nbsp;Yue Wang\",\"doi\":\"10.1016/j.future.2025.107849\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Federated learning has attracted widespread attention due to its privacy-preserving characteristic. However, in real-world scenarios, the heterogeneity of decentralized data and the limited communication resources of clients pose great challenges to the deployment of federated training. Although existing works have made great strides in dealing with heterogeneous data or compressing communication, they struggle to strike a balance between model accuracy and communication cost. To address the above issues, this paper proposes a novel federated learning framework called pFL-SBPM, which achieves communication-efficient <strong>p</strong>ersonalized <strong>F</strong>ederated <strong>L</strong>earning through <strong>S</strong>tochastic <strong>B</strong>inary <strong>P</strong>robability <strong>M</strong>asks. Specifically, we utilize probability mask optimization instead of conventional weight training, where clients obtain personalized sparse subnetworks adapted to local task requirements by cooperative optimization of probability masks in a randomly weighted network. We develop an uplink communication strategy based on stochastic binary masks and a downlink communication strategy based on binary encoding and decoding, which achieves enhanced privacy protection while dramatically reducing the communication cost. Furthermore, to effectively handle heterogeneous data while mitigating the negative impact of the introduction of stochasticity on the stability of federated training, we carefully design a soft-threshold based selective updating strategy for probability masks. The experimental results show the significant superiority and competitiveness of pFL-SBPM compared to existing baseline and state-of-the-art methods in terms of inference accuracy, communication cost, computational cost and model size.</div></div>\",\"PeriodicalId\":55132,\"journal\":{\"name\":\"Future Generation Computer Systems-The International Journal of Escience\",\"volume\":\"171 \",\"pages\":\"Article 107849\"},\"PeriodicalIF\":6.2000,\"publicationDate\":\"2025-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Future Generation Computer Systems-The International Journal of Escience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167739X2500144X\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2025/4/10 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Computer Systems-The International Journal of Escience","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167739X2500144X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/4/10 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

联邦学习因其隐私保护特性而受到广泛关注。然而,在现实场景中,分散数据的异构性和客户端有限的通信资源给联邦训练的部署带来了巨大的挑战。尽管现有的工作在处理异构数据或压缩通信方面取得了很大的进步,但他们很难在模型精度和通信成本之间取得平衡。为了解决上述问题,本文提出了一种新的联邦学习框架pfl - sppm,该框架通过随机二元概率掩码实现通信高效的个性化联邦学习。具体来说,我们利用概率掩码优化来代替传统的权重训练,其中客户端通过在随机加权网络中概率掩码的协同优化来获得适应局部任务需求的个性化稀疏子网络。提出了基于随机二进制掩码的上行通信策略和基于二进制编解码的下行通信策略,在显著降低通信成本的同时实现了增强的隐私保护。此外,为了有效地处理异构数据,同时减轻引入随机性对联邦训练稳定性的负面影响,我们精心设计了基于软阈值的概率掩码选择性更新策略。实验结果表明,与现有的基线和最先进的方法相比,pfl - sppm在推理精度、通信成本、计算成本和模型大小方面具有显著的优势和竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
pFL-SBPM: A communication-efficient personalized federated learning framework for resource-limited edge clients
Federated learning has attracted widespread attention due to its privacy-preserving characteristic. However, in real-world scenarios, the heterogeneity of decentralized data and the limited communication resources of clients pose great challenges to the deployment of federated training. Although existing works have made great strides in dealing with heterogeneous data or compressing communication, they struggle to strike a balance between model accuracy and communication cost. To address the above issues, this paper proposes a novel federated learning framework called pFL-SBPM, which achieves communication-efficient personalized Federated Learning through Stochastic Binary Probability Masks. Specifically, we utilize probability mask optimization instead of conventional weight training, where clients obtain personalized sparse subnetworks adapted to local task requirements by cooperative optimization of probability masks in a randomly weighted network. We develop an uplink communication strategy based on stochastic binary masks and a downlink communication strategy based on binary encoding and decoding, which achieves enhanced privacy protection while dramatically reducing the communication cost. Furthermore, to effectively handle heterogeneous data while mitigating the negative impact of the introduction of stochasticity on the stability of federated training, we carefully design a soft-threshold based selective updating strategy for probability masks. The experimental results show the significant superiority and competitiveness of pFL-SBPM compared to existing baseline and state-of-the-art methods in terms of inference accuracy, communication cost, computational cost and model size.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
19.90
自引率
2.70%
发文量
376
审稿时长
10.6 months
期刊介绍: Computing infrastructures and systems are constantly evolving, resulting in increasingly complex and collaborative scientific applications. To cope with these advancements, there is a growing need for collaborative tools that can effectively map, control, and execute these applications. Furthermore, with the explosion of Big Data, there is a requirement for innovative methods and infrastructures to collect, analyze, and derive meaningful insights from the vast amount of data generated. This necessitates the integration of computational and storage capabilities, databases, sensors, and human collaboration. Future Generation Computer Systems aims to pioneer advancements in distributed systems, collaborative environments, high-performance computing, and Big Data analytics. It strives to stay at the forefront of developments in grids, clouds, and the Internet of Things (IoT) to effectively address the challenges posed by these wide-area, fully distributed sensing and computing systems.
期刊最新文献
Blockchain architectures for enhancing EV infrastructure security: A unified framework for addressing sophisticated cyber-attacks Applying quantum error-correcting codes for fault-tolerant blind quantum cloud computation A swarm intelligence enabled multi-agent reinforcement learning scheme for computational task offloading in internet of things blockchain KnowAIDE: A fAIR-compliant data environment to accelerate AI research Non-intrusive kernel-level dispatching for MQTT shared subscriptions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1