AsyncDefender: Dynamic trust adaptation and collaborative defense for Byzantine-robust asynchronous federated learning

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Yulong Bai , Ying Wang , Xiangrui Xu , Yuhang Yang , Hina Batool , Zahid Iqbal , Jiuyun Xu
{"title":"AsyncDefender: Dynamic trust adaptation and collaborative defense for Byzantine-robust asynchronous federated learning","authors":"Yulong Bai ,&nbsp;Ying Wang ,&nbsp;Xiangrui Xu ,&nbsp;Yuhang Yang ,&nbsp;Hina Batool ,&nbsp;Zahid Iqbal ,&nbsp;Jiuyun Xu","doi":"10.1016/j.comnet.2025.111430","DOIUrl":null,"url":null,"abstract":"<div><div>Traditional synchronous federated learning approaches face efficiency challenges in resource-heterogeneous networks and high-latency environments. The appearance of asynchronous federated learning has solved some of these limitations. However, Byzantine fault-tolerant approaches that work well in synchronous environments face unique challenges in asynchronous federated learning, such as synchronous robust rules that cannot be applied to asynchronous scenarios and difficulty in coping with dynamic changes. To address these issues, we introduce AsyncDefender, one of the first solutions designed specifically for Byzantine fault tolerance in asynchronous federated learning.AsyncDefender supports fully asynchronous updates from edge clients, tolerates arbitrary latency, and has no limitation on the number of Byzantine clients. The core of our method is the dynamic allocation of aggregation degrees based on the similarity between client gradients and global model gradients. In addition, we employ collaborative filtering between reviewers and non-reviewers and bidirectional credibility assessments to identify and eliminate malicious updates accurately. Extensive qualitative and quantitative experiments demonstrate that AsyncDefender is not only more robust to a large number of malicious Byzantine clients but also converges faster and performs more stably than existing approaches.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"269 ","pages":"Article 111430"},"PeriodicalIF":4.4000,"publicationDate":"2025-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625003974","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Traditional synchronous federated learning approaches face efficiency challenges in resource-heterogeneous networks and high-latency environments. The appearance of asynchronous federated learning has solved some of these limitations. However, Byzantine fault-tolerant approaches that work well in synchronous environments face unique challenges in asynchronous federated learning, such as synchronous robust rules that cannot be applied to asynchronous scenarios and difficulty in coping with dynamic changes. To address these issues, we introduce AsyncDefender, one of the first solutions designed specifically for Byzantine fault tolerance in asynchronous federated learning.AsyncDefender supports fully asynchronous updates from edge clients, tolerates arbitrary latency, and has no limitation on the number of Byzantine clients. The core of our method is the dynamic allocation of aggregation degrees based on the similarity between client gradients and global model gradients. In addition, we employ collaborative filtering between reviewers and non-reviewers and bidirectional credibility assessments to identify and eliminate malicious updates accurately. Extensive qualitative and quantitative experiments demonstrate that AsyncDefender is not only more robust to a large number of malicious Byzantine clients but also converges faster and performs more stably than existing approaches.
AsyncDefender:拜占庭鲁棒异步联邦学习的动态信任适应和协作防御
传统的同步联邦学习方法在资源异构网络和高延迟环境中面临效率挑战。异步联邦学习的出现解决了其中的一些限制。然而,在同步环境中工作良好的拜占庭容错方法在异步联邦学习中面临着独特的挑战,例如同步健壮规则不能应用于异步场景,以及难以应对动态更改。为了解决这些问题,我们引入了AsyncDefender,这是第一个专门为异步联邦学习中的拜占庭容错设计的解决方案之一。AsyncDefender支持来自边缘客户端的完全异步更新,允许任意延迟,并且对拜占庭客户端的数量没有限制。该方法的核心是基于客户端梯度和全局模型梯度的相似性动态分配聚合度。此外,我们采用审稿人和非审稿人之间的协同过滤以及双向可信度评估来准确识别和消除恶意更新。大量的定性和定量实验表明,AsyncDefender不仅对大量恶意拜占庭客户端更健壮,而且比现有方法收敛得更快,执行得更稳定。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术官方微信