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 , Ying Wang , Xiangrui Xu , Yuhang Yang , Hina Batool , Zahid Iqbal , 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.
期刊介绍:
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.