pFL-SBPM: A communication-efficient personalized federated learning framework for resource-limited edge clients

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
Han Hu , Wenli Du , Yuqiang Li , Yue Wang
{"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-04-10","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":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

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.

Abstract Image

pFL-SBPM:为资源有限的边缘客户提供通信效率高的个性化联合学习框架
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
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.
×
引用
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学术官方微信