Sparse personalized federated class-incremental learning

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2025-02-19 DOI:10.1016/j.ins.2025.121992
Youchao Liu, Dingjiang Huang
{"title":"Sparse personalized federated class-incremental learning","authors":"Youchao Liu,&nbsp;Dingjiang Huang","doi":"10.1016/j.ins.2025.121992","DOIUrl":null,"url":null,"abstract":"<div><div>Recently federated learning (FL) has attracted growing attention by performing data-private collaborative training on decentralized clients. However, the majority of existing FL methods concentrate on single-task scenarios with static data. In real-world scenarios, local clients usually continuously collect new classes from the data stream and have just a small amount of memory to store training samples of old classes. Using single-task models directly will lead to significant catastrophic forgetting in old classes. In addition, there are some typical challenges in FL scenarios, such as computation and communication overhead, data heterogeneity, etc. To comprehensively describe these challenges, we propose a new Personalized Federated Class-Incremental Learning (PFCIL) problem. Furthermore, we propose an innovative Sparse Personalized Federated Class-Incremental Learning (SpaPFCIL) framework that learns a personalized class-incremental model for each client through sparse training to solve this problem. Unlike most knowledge distillation-based methods, our framework does not require additional data to assist. Specifically, to tackle catastrophic forgetting brought by class-incremental tasks, we utilize expandable class-incremental models instead of single-task models. For typical challenges in FL, we use dynamic sparse training to customize sparse local models on clients. It alleviates the negative effects of data heterogeneity and over-parameterization. Our framework outperforms state-of-the-art methods in terms of average accuracy on representative benchmark datasets by 3.3% to 43.6%.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"706 ","pages":"Article 121992"},"PeriodicalIF":8.1000,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525001240","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Recently federated learning (FL) has attracted growing attention by performing data-private collaborative training on decentralized clients. However, the majority of existing FL methods concentrate on single-task scenarios with static data. In real-world scenarios, local clients usually continuously collect new classes from the data stream and have just a small amount of memory to store training samples of old classes. Using single-task models directly will lead to significant catastrophic forgetting in old classes. In addition, there are some typical challenges in FL scenarios, such as computation and communication overhead, data heterogeneity, etc. To comprehensively describe these challenges, we propose a new Personalized Federated Class-Incremental Learning (PFCIL) problem. Furthermore, we propose an innovative Sparse Personalized Federated Class-Incremental Learning (SpaPFCIL) framework that learns a personalized class-incremental model for each client through sparse training to solve this problem. Unlike most knowledge distillation-based methods, our framework does not require additional data to assist. Specifically, to tackle catastrophic forgetting brought by class-incremental tasks, we utilize expandable class-incremental models instead of single-task models. For typical challenges in FL, we use dynamic sparse training to customize sparse local models on clients. It alleviates the negative effects of data heterogeneity and over-parameterization. Our framework outperforms state-of-the-art methods in terms of average accuracy on representative benchmark datasets by 3.3% to 43.6%.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Editorial Board GRANA: Graph convolutional network based network representation learning method for attributed network alignment Ensuring privacy and correlation awareness in multi-dimensional service quality prediction and recommendation for IoT EVA: Key values eclosion with space anchor used in hand pose estimation and shape reconstruction Polynomial-time verification of pattern diagnosability for timed discrete event systems
×
引用
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