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 条
  • [31] Byzantine-Robust Federated Linear Bandits
    Jadbabaie, Ali
    Li, Haochuan
    Qian, Jian
    Tian, Yi
    2022 IEEE 61ST CONFERENCE ON DECISION AND CONTROL (CDC), 2022, : 5206 - 5213
  • [32] Efficient and Privacy-Preserving Byzantine-robust Federated Learning
    Luan, Shijie
    Lu, Xiang
    Zhang, Zhuangzhuang
    Chang, Guangsheng
    Guo, Yunchuan
    IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 2202 - 2208
  • [33] Local Model Poisoning Attacks to Byzantine-Robust Federated Learning
    Fang, Minghong
    Cao, Xiaoyu
    Jia, Jinyuan
    Gong, Neil Nenqiang
    PROCEEDINGS OF THE 29TH USENIX SECURITY SYMPOSIUM, 2020, : 1623 - 1640
  • [34] Lightweight Byzantine-Robust and Privacy-Preserving Federated Learning
    Lu, Zhi
    Lu, Songfeng
    Cui, Yongquan
    Wu, Junjun
    Nie, Hewang
    Xiao, Jue
    Yi, Zepu
    EURO-PAR 2024: PARALLEL PROCESSING, PART II, EURO-PAR 2024, 2024, 14802 : 274 - 287
  • [35] Byzantine-Robust Federated Learning with Variance Reduction and Differential Privacy
    Zhang, Zikai
    Hu, Rui
    2023 IEEE CONFERENCE ON COMMUNICATIONS AND NETWORK SECURITY, CNS, 2023,
  • [36] FLForest: Byzantine-robust Federated Learning through Isolated Forest
    Wang, Tao
    Zhao, Bo
    Fang, Liming
    2022 IEEE 28TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, ICPADS, 2022, : 296 - 303
  • [37] Byzantine-Robust and Communication-Efficient Personalized Federated Learning
    Zhang, Jiaojiao
    He, Xuechao
    Huang, Yue
    Ling, Qing
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2025, 73 : 26 - 39
  • [38] Byzantine-robust federated learning performance evaluation via distance-statistical aggregations
    Colosimo, Francesco
    Rocca, Giovanni
    ASSURANCE AND SECURITY FOR AI-ENABLED SYSTEMS, 2024, 13054
  • [39] Byzantine-robust federated learning via credibility assessment on non- IID data
    Zhai, Kun
    Ren, Qiang
    Wang, Junli
    Yan, Chungang
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2022, 19 (02) : 1659 - 1676
  • [40] FBR-FL: Fair and Byzantine-Robust Federated Learning via SPD Manifold
    Zhang, Tao
    Li, Haoshuo
    Liu, Teng
    Song, Anxiao
    Shen, Yulong
    PATTERN RECOGNITION AND COMPUTER VISION, PRCV 2024, PT 1, 2025, 15031 : 395 - 409