FairDPFL-SCS: Fair Dynamic Personalized Federated Learning with strategic client selection for improved accuracy and fairness

IF 14.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Fahad Sabah , Yuwen Chen , Zhen Yang , Abdul Raheem , Muhammad Azam , Nadeem Ahmad , Raheem Sarwar
{"title":"FairDPFL-SCS: Fair Dynamic Personalized Federated Learning with strategic client selection for improved accuracy and fairness","authors":"Fahad Sabah ,&nbsp;Yuwen Chen ,&nbsp;Zhen Yang ,&nbsp;Abdul Raheem ,&nbsp;Muhammad Azam ,&nbsp;Nadeem Ahmad ,&nbsp;Raheem Sarwar","doi":"10.1016/j.inffus.2024.102756","DOIUrl":null,"url":null,"abstract":"<div><div>Personalized federated learning (PFL) addresses the significant challenge of non-independent and identically distributed (non-IID) data across clients in federated learning (FL). Our proposed framework, “FairDPFL-SCS: Fair Dynamic Personalized Federated Learning with Strategic Client Selection”, marks a notable advancement in this domain. By integrating dynamic learning rate adjustments and a strategic client selection mechanism, our approach effectively mitigates the challenges posed by non-IID data while enhancing model personalization, fairness, and efficiency. We evaluated FairDPFL-SCS using standard datasets, including MNIST, FashionMNIST, and SVHN, employing architectures like VGG and CNN. Our model achieved impressive results, attaining 99.04% accuracy on MNIST, 89.19% on FashionMNIST, and 90.9% on SVHN. These results represent a substantial improvement over existing methods, including a highest increase of 16.74% in accuracy on SVHN when compared to the best-performing benchmark methods. In particular, our method also demonstrated lower fairness variance, presenting the importance of fairness in model personalization, a frequently overlooked aspect in FL research. Through extensive experiments, we validate the superior performance of FairDPFL-SCS compared to benchmark PFL approaches, highlighting significant improvements over state-of-the-art methods. This work represents a promising step forward in the field of federated learning, offering a comprehensive solution to the challenges presented by non-IID data while prioritizing fairness and efficiency in model personalization.</div></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"115 ","pages":"Article 102756"},"PeriodicalIF":14.7000,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Fusion","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1566253524005347","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Personalized federated learning (PFL) addresses the significant challenge of non-independent and identically distributed (non-IID) data across clients in federated learning (FL). Our proposed framework, “FairDPFL-SCS: Fair Dynamic Personalized Federated Learning with Strategic Client Selection”, marks a notable advancement in this domain. By integrating dynamic learning rate adjustments and a strategic client selection mechanism, our approach effectively mitigates the challenges posed by non-IID data while enhancing model personalization, fairness, and efficiency. We evaluated FairDPFL-SCS using standard datasets, including MNIST, FashionMNIST, and SVHN, employing architectures like VGG and CNN. Our model achieved impressive results, attaining 99.04% accuracy on MNIST, 89.19% on FashionMNIST, and 90.9% on SVHN. These results represent a substantial improvement over existing methods, including a highest increase of 16.74% in accuracy on SVHN when compared to the best-performing benchmark methods. In particular, our method also demonstrated lower fairness variance, presenting the importance of fairness in model personalization, a frequently overlooked aspect in FL research. Through extensive experiments, we validate the superior performance of FairDPFL-SCS compared to benchmark PFL approaches, highlighting significant improvements over state-of-the-art methods. This work represents a promising step forward in the field of federated learning, offering a comprehensive solution to the challenges presented by non-IID data while prioritizing fairness and efficiency in model personalization.
FairDPFL-SCS:公平动态个性化联合学习,通过策略性客户选择提高准确性和公平性
个性化联合学习(PFL)解决了联合学习(FL)中跨客户端非独立和同分布(non-IID)数据的重大挑战。我们提出的框架 "FairDPFL-SCS:具有策略性客户选择的公平动态个性化联合学习 "标志着这一领域的显著进步。通过整合动态学习率调整和策略性客户选择机制,我们的方法有效地缓解了非 IID 数据带来的挑战,同时提高了模型的个性化、公平性和效率。我们使用标准数据集对 FairDPFL-SCS 进行了评估,包括 MNIST、FashionMNIST 和 SVHN,并采用了 VGG 和 CNN 等架构。我们的模型取得了令人印象深刻的结果,在 MNIST 上达到了 99.04% 的准确率,在 FashionMNIST 上达到了 89.19% 的准确率,在 SVHN 上达到了 90.9% 的准确率。这些结果表明,与现有方法相比,我们的模型有了很大的改进,其中在 SVHN 上与表现最好的基准方法相比,准确率最高提高了 16.74%。特别是,我们的方法还表现出较低的公平性方差,显示了公平性在模型个性化中的重要性,这也是 FL 研究中经常被忽视的一个方面。通过广泛的实验,我们验证了 FairDPFL-SCS 与基准 PFL 方法相比的优越性能,凸显了与最先进方法相比的显著改进。这项工作代表着联合学习领域向前迈出了充满希望的一步,它为非 IID 数据带来的挑战提供了全面的解决方案,同时优先考虑了模型个性化的公平性和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Fusion
Information Fusion 工程技术-计算机:理论方法
CiteScore
33.20
自引率
4.30%
发文量
161
审稿时长
7.9 months
期刊介绍: Information Fusion serves as a central platform for showcasing advancements in multi-sensor, multi-source, multi-process information fusion, fostering collaboration among diverse disciplines driving its progress. It is the leading outlet for sharing research and development in this field, focusing on architectures, algorithms, and applications. Papers dealing with fundamental theoretical analyses as well as those demonstrating their application to real-world problems will be welcome.
×
引用
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学术官方微信