通过动态客户端选择解决联邦学习中的数据质量补偿问题

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
Qinjun Fei , Nuria Rodríguez-Barroso , María Victoria Luzón , Zhongliang Zhang , Francisco Herrera
{"title":"通过动态客户端选择解决联邦学习中的数据质量补偿问题","authors":"Qinjun Fei ,&nbsp;Nuria Rodríguez-Barroso ,&nbsp;María Victoria Luzón ,&nbsp;Zhongliang Zhang ,&nbsp;Francisco Herrera","doi":"10.1016/j.future.2025.108138","DOIUrl":null,"url":null,"abstract":"<div><div>In cross-silo Federated Learning (FL), client selection is critical to ensure high model performance, yet it remains challenging due to data quality decompensation, budget constraints, and incentive compatibility. As training progresses, these factors exacerbate client heterogeneity and degrade global performance. Most existing approaches treat these challenges in isolation, making it difficult to optimize multiple factors in conjunction. To address this, we propose Shapley-Bid Reputation Optimized Federated Learning (SBRO-FL), a unified framework integrating dynamic bidding, reputation modeling, and cost-aware selection. Clients submit bids based on their perceived data quality, and their contributions are evaluated using Shapley values to quantify their marginal impact on the global model. A reputation system, inspired by prospect theory, captures historical performance while penalizing inconsistency. The client selection problem is formulated as a 0–1 integer program that maximizes reputation-weighted utility under budget constraints. Experiments on four benchmark datasets demonstrate the framework’s effectiveness, improving final model accuracy by an average of 10.3 % over random selection, with gains exceeding 19 % on more complex datasets like CIFAR-10 and SVHN. Our results highlight the importance of balancing data reliability, incentive compatibility, and cost efficiency to enable scalable and trustworthy FL deployments.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"176 ","pages":"Article 108138"},"PeriodicalIF":6.2000,"publicationDate":"2025-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Addressing data quality decompensation in federated learning via dynamic client selection\",\"authors\":\"Qinjun Fei ,&nbsp;Nuria Rodríguez-Barroso ,&nbsp;María Victoria Luzón ,&nbsp;Zhongliang Zhang ,&nbsp;Francisco Herrera\",\"doi\":\"10.1016/j.future.2025.108138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In cross-silo Federated Learning (FL), client selection is critical to ensure high model performance, yet it remains challenging due to data quality decompensation, budget constraints, and incentive compatibility. As training progresses, these factors exacerbate client heterogeneity and degrade global performance. Most existing approaches treat these challenges in isolation, making it difficult to optimize multiple factors in conjunction. To address this, we propose Shapley-Bid Reputation Optimized Federated Learning (SBRO-FL), a unified framework integrating dynamic bidding, reputation modeling, and cost-aware selection. Clients submit bids based on their perceived data quality, and their contributions are evaluated using Shapley values to quantify their marginal impact on the global model. A reputation system, inspired by prospect theory, captures historical performance while penalizing inconsistency. The client selection problem is formulated as a 0–1 integer program that maximizes reputation-weighted utility under budget constraints. Experiments on four benchmark datasets demonstrate the framework’s effectiveness, improving final model accuracy by an average of 10.3 % over random selection, with gains exceeding 19 % on more complex datasets like CIFAR-10 and SVHN. Our results highlight the importance of balancing data reliability, incentive compatibility, and cost efficiency to enable scalable and trustworthy FL deployments.</div></div>\",\"PeriodicalId\":55132,\"journal\":{\"name\":\"Future Generation Computer Systems-The International Journal of Escience\",\"volume\":\"176 \",\"pages\":\"Article 108138\"},\"PeriodicalIF\":6.2000,\"publicationDate\":\"2025-09-16\",\"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/S0167739X25004327\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"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/S0167739X25004327","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

在跨竖井联邦学习(FL)中,客户端选择对于确保高模型性能至关重要,但由于数据质量补偿、预算约束和激励兼容性,它仍然具有挑战性。随着培训的进展,这些因素加剧了客户的异质性,降低了整体绩效。大多数现有方法都孤立地处理这些挑战,因此难以同时优化多个因素。为了解决这个问题,我们提出了Shapley-Bid Reputation Optimized Federated Learning (SBRO-FL),这是一个集成了动态竞标、声誉建模和成本意识选择的统一框架。客户根据他们感知到的数据质量提交投标,并使用Shapley值来评估他们的贡献,以量化他们对全球模型的边际影响。受前景理论启发的声誉系统捕捉历史业绩,同时惩罚不一致。客户选择问题被表述为一个0-1整数规划,在预算约束下最大化声誉加权效用。在四个基准数据集上的实验证明了该框架的有效性,与随机选择相比,最终模型的准确率平均提高了10.3%,在CIFAR-10和SVHN等更复杂的数据集上,准确率提高了19%以上。我们的研究结果强调了平衡数据可靠性、激励兼容性和成本效率的重要性,以实现可扩展和可信赖的FL部署。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Addressing data quality decompensation in federated learning via dynamic client selection
In cross-silo Federated Learning (FL), client selection is critical to ensure high model performance, yet it remains challenging due to data quality decompensation, budget constraints, and incentive compatibility. As training progresses, these factors exacerbate client heterogeneity and degrade global performance. Most existing approaches treat these challenges in isolation, making it difficult to optimize multiple factors in conjunction. To address this, we propose Shapley-Bid Reputation Optimized Federated Learning (SBRO-FL), a unified framework integrating dynamic bidding, reputation modeling, and cost-aware selection. Clients submit bids based on their perceived data quality, and their contributions are evaluated using Shapley values to quantify their marginal impact on the global model. A reputation system, inspired by prospect theory, captures historical performance while penalizing inconsistency. The client selection problem is formulated as a 0–1 integer program that maximizes reputation-weighted utility under budget constraints. Experiments on four benchmark datasets demonstrate the framework’s effectiveness, improving final model accuracy by an average of 10.3 % over random selection, with gains exceeding 19 % on more complex datasets like CIFAR-10 and SVHN. Our results highlight the importance of balancing data reliability, incentive compatibility, and cost efficiency to enable scalable and trustworthy FL deployments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术文献互助群
群 号:604180095
Book学术官方微信