Byzantine-robust Federated Learning via Cosine Similarity Aggregation

被引:0
|
作者
Zhu, Tengteng [1 ]
Guo, Zehua [1 ,2 ]
Yao, Chao [3 ]
Tan, Jiaxin [1 ]
Dou, Songshi [4 ]
Wang, Wenrun [1 ]
Han, Zhenzhen [5 ]
机构
[1] Beijing Inst Technol, Beijing 100081, Peoples R China
[2] Beijing Inst Technol, Zhengzhou Acad Intelligent Technol, Zhengzhou 450040, Peoples R China
[3] Shaanxi Normal Univ, Xian 710119, Shaanxi, Peoples R China
[4] Univ Hong Kong, Hong Kong, Peoples R China
[5] Sinotrans Ltd, Beijing 100044, Peoples R China
关键词
Federated learning; Robust aggregation; Byzantine attacks; Cosine similarity; Angle; DEEP; NETWORKS;
D O I
10.1016/j.comnet.2024.110730
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Federated Learning (FL) is proposed to train a machine learning model for clients with different training data. During the training of FL, a centralized server is usually employed to aggregate local models from clients iteratively. The aggregation process suffers from Byzantine attacks, where clients' models could be maliciously modified by attackers to degrade the training performance. Existing defense aggregation solutions use distances or angles between different gradients to identify and eliminate malicious models from clients. However, they do not work well due to the high dimensional property of the machine learning model. Distance- based solutions cannot effectively identify attackers when the gradient direction of the model is maliciously tampered with. Angle-based solutions face the issue of low model accuracy for large models. In this paper, we propose Convolutional Kernel Angle-based Defense Aggregation (CKADA) to improve defense performance under various Byzantine attacks. The key of CKADA is to use the angle between convolutional kernels as the attack detection metric because the obtuse angle indicates the wrong training direction. CKADA calculates the angle between a client's convolutional kernel gradients and the server's convolutional kernel gradients as the attacker detection metric and eliminates convolutional kernel gradients of clients that create an obtuse angle to mitigate the impact of attackers on the model. We evaluate the performance of CKADA using AlexNet, ResNet-50, and GoogLeNet under two typical attacks. Simulation results show that CKADA mitigates the impact of Byzantine attacks and outperforms existing angle-based solutions and distance-based solutions by improving inference accuracy up to 67% and 89% respectively.
引用
收藏
页数:14
相关论文
共 50 条
  • [21] Byzantine-Robust Federated Learning through Dynamic Clustering
    Wang, Hanyu
    Wang, Liming
    Li, Hongjia
    2023 IEEE 22ND INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS, TRUSTCOM, BIGDATASE, CSE, EUC, ISCI 2023, 2024, : 222 - 230
  • [22] Byzantine-Robust Federated Learning with Optimal Statistical Rates
    Zhu, Banghua
    Wang, Lun
    Pang, Qi
    Wang, Shuai
    Jiao, Jiantao
    Song, Dawn
    Jordan, Michael I.
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 206, 2023, 206
  • [23] Byzantine-Robust and Efficient Federated Learning for the Internet of Things
    Jin R.
    Hu J.
    Min G.
    Lin H.
    IEEE Internet of Things Magazine, 2022, 5 (01): : 114 - 118
  • [24] Byzantine-Robust Federated Learning via Server-Side Mixtue of Experts
    Li, Jing (lj@ustc.edu.cn), 1600, Springer Science and Business Media Deutschland GmbH (14326 LNAI):
  • [25] Privacy-Preserving Byzantine-Robust Federated Learning via Blockchain Systems
    Miao, Yinbin
    Liu, Ziteng
    Li, Hongwei
    Choo, Kim-Kwang Raymond
    Deng, Robert H.
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2022, 17 : 2848 - 2861
  • [26] Privacy-Preserving Byzantine-Robust Federated Learning via Blockchain Systems
    Miao, Yinbin
    Liu, Ziteng
    Li, Hongwei
    Choo, Kim-Kwang Raymond
    Deng, Robert H.
    IEEE Transactions on Information Forensics and Security, 2022, 17 : 2848 - 2861
  • [27] rFedFW: Secure and trustable aggregation scheme for Byzantine-robust federated learning in Internet of Things
    Ni, Lina
    Gong, Xu
    Li, Jufeng
    Tang, Yuncan
    Luan, Zhuang
    Zhang, Jinquan
    INFORMATION SCIENCES, 2024, 653
  • [28] Byzantine-Robust Federated Learning Based on Dynamic Gradient Filtering
    Colosimo, Francesco
    De Rango, Floriano
    20TH INTERNATIONAL WIRELESS COMMUNICATIONS & MOBILE COMPUTING CONFERENCE, IWCMC 2024, 2024, : 1062 - 1067
  • [29] FedCom: Byzantine-Robust Federated Learning Using Data Commitment
    Zhao, Bo
    Wang, Tao
    Fang, Liming
    ICC 2023-IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2023, : 33 - 38
  • [30] Enhancing Model Poisoning Attacks to Byzantine-Robust Federated Learning via Critical Learning Periods
    Yan, Gang
    Wang, Hao
    Yuan, Xu
    Li, Jian
    PROCEEDINGS OF 27TH INTERNATIONAL SYMPOSIUM ON RESEARCH IN ATTACKS, INTRUSIONS AND DEFENSES, RAID 2024, 2024, : 496 - 512