Aggressive or Imperceptible, or Both: Network Pruning Assisted Hybrid Byzantines in Federated Learning
Not on the map. Why?
Abstract (arXiv)
In federated learning (FL), profiling and verifying each client is inherently difficult, which introduces a significant security vulnerability: malicious clients, commonly referred to as Byzantines, can degrade the accuracy of the global model by submitting poisoned updates during training. To mitigate this, the aggregation process at the parameter server must be robust against such adversarial behaviour. Most existing defences approach the Byzantine problem from an outlier detection perspective, treating malicious updates as statistical anomalies and ignoring the internal structure of the trained neural network (NN). Motivated by this, this work highlights the potential of leveraging side information tied to the NN architecture to design stronger, more targeted attacks. In particular, inspired by insights from sparse NNs, we introduce a hybrid sparse Byzantine attack. The attack consists of two coordinated components: (i) A sparse attack component that selectively manipulates parameters with higher sensitivity in the NN, aiming to cause maximum disruption with minimal visibility; (ii) A slow-accumulating attack component that silently poisons parameters over multiple rounds to evade detection. Together, these components create a strong but imperceptible attack strategy that can bypass common defences. We evaluate the proposed attack through extensive simulations and demonstrate its effectiveness against eight state-of-the-art defence mechanisms.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 54 of its 96 references that are in the map. First posted on arXiv 9 Apr 2024.
Builds on
54 of 96 references.
References · 54
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2019Advances and Open Problems in Federated Learningcited by 3,021
- 2018Federated Optimization in Heterogeneous Networkscited by 2,971
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2018How To Backdoor Federated Learningcited by 745
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
- 2021Federated Learning Based on Dynamic Regularizationcited by 555
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
38 more
- 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 479
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
- 2018Analyzing Federated Learning through an Adversarial Lenscited by 346
- 2020FLTrust: Byzantine-robust Federated Learning via Trust Bootstrappingcited by 330
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
- 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 324
- 2019Robust Aggregation for Federated Learningcited by 314
- 2019A Little Is Enough: Circumventing Defenses For Distributed Learningcited by 285
- 2019Can You Really Backdoor Federated Learning?cited by 250
- 2019PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimizationcited by 234
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
- 2022FedDC: Federated Learning with Non-IID Data via Local Drift Decoupling and Correctioncited by 181
- 2018RSA: Byzantine-Robust Stochastic Aggregation Methods for Distributed Learning from Heterogeneous Datasetscited by 148
- 2020Learning from History for Byzantine Robust Optimizationcited by 137
- 2019Fall of Empires: Breaking Byzantine-tolerant SGD by Inner Product Manipulationcited by 136
- 2021Group Fisher Pruning for Practical Network Compressioncited by 130
- 2020Byzantine-Robust Learning on Heterogeneous Datasets via Bucketingcited by 125
- 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
- 2019SlowMo: Improving Communication-Efficient Distributed SGD with Slow Momentumcited by 121
- 2022FLDetector: Defending Federated Learning Against Model Poisoning Attacks via Detecting Malicious Clientscited by 119
- 2021Back to the Drawing Board: A Critical Evaluation of Poisoning Attacks on Production Federated Learningcited by 116
- 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
- 2019Federated Variance-Reduced Stochastic Gradient Descent with Robustness to Byzantine Attackscited by 79
- 2019Byzantine-Robust Federated Machine Learning through Adaptive Model Averagingcited by 70
- 2020Progressive Skeletonization: Trimming more fat from a network at initializationcited by 64
- 2022Byzantine Machine Learning Made Easy by Resilient Averaging of Momentumscited by 63
- 2021Efficient Lottery Ticket Finding: Less Data is Morecited by 44
- 2020Stochastic-Sign SGD for Federated Learning with Theoretical Guaranteescited by 34
- 2022Rare Gems: Finding Lottery Tickets at Initializationcited by 34
- 2019Distributed Training with Heterogeneous Data: Bridging Median- and Mean-Based Algorithmscited by 29
- 2022Dual Lottery Ticket Hypothesiscited by 27
- 2020FedADC: Accelerated Federated Learning with Drift Controlcited by 26
- 2023FedSecurity: Benchmarking Attacks and Defenses in Federated Learning and Federated LLMscited by 19
- 2021Robust Federated Learning with Attack-Adaptive Aggregationcited by 17
- 2023Byzantine-Robust Learning on Heterogeneous Data via Gradient Splittingcited by 13
- 2022FL-Defender: Combating Targeted Attacks in Federated Learningcited by 12
- 2020Byzantine-Robust Variance-Reduced Federated Learning over Distributed Non-i.i.d. Datacited by 8
- 2022Byzantines can also Learn from History: Fall of Centered Clipping in Federated Learningcited by 8
50 most cited of 54 All 54 (JSON)
Built on by
Not cited yet.