Adversarial Pruning: A Survey and Benchmark of Pruning Methods for Adversarial Robustness
Not on the map. Why?
Abstract (arXiv)
Recent work has proposed neural network pruning techniques to reduce the size of a network while preserving robustness against adversarial examples, i.e., well-crafted inputs inducing a misclassification. These methods, which we refer to as adversarial pruning methods, involve complex and articulated designs, making it difficult to analyze the differences and establish a fair and accurate comparison. In this work, we overcome these issues by surveying current adversarial pruning methods and proposing a novel taxonomy to categorize them based on two main dimensions: the pipeline, defining when to prune; and the specifics, defining how to prune. We then highlight the limitations of current empirical analyses and propose a novel, fair evaluation benchmark to address them. We finally conduct an empirical re-evaluation of current adversarial pruning methods and discuss the results, highlighting the shared traits of top-performing adversarial pruning methods, as well as common issues. We welcome contributions in our publicly-available benchmark at https://github.com/pralab/AdversarialPruningBenchmark
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 56 of its 77 references that are in the map. First posted on arXiv 2 Sep 2024.
Builds on
56 of 77 references.
References · 56
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,442
38 more
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,315
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
- 2016Adversarial Machine Learning at Scalecited by 934
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2020Fast is better than free: Revisiting adversarial trainingcited by 723
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2017Evasion Attacks against Machine Learning at Test Timecited by 686
- 2017ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Modelscited by 656
- 2020What is the State of Neural Network Pruning?cited by 578
- 2019On Evaluating Adversarial Robustnesscited by 442
- 2019Unlabeled Data Improves Adversarial Robustnesscited by 415
- 2017Wild Patterns: Ten Years After the Rise of Adversarial Machine Learningcited by 411
- 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
- 2018Parametric Noise Injection: Trainable Randomness to Improve Deep Neural Network Robustness against Adversarial Attackcited by 123
- 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
- 2019Adversarial Robustness vs Model Compression, or Both?cited by 98
- 2020Learnable Boundary Guided Adversarial Trainingcited by 93
- 2019Pruning by Explaining: A Novel Criterion for Deep Neural Network Pruningcited by 89
- 2018Sparse DNNs with Improved Adversarial Robustnesscited by 71
- 2021Fast Minimum-norm Adversarial Attacks through Adaptive Norm Constraintscited by 50
- 2019Accurate, reliable and fast robustness evaluationcited by 43
- 2022Sparsity Winning Twice: Better Robust Generalization from More Efficient Trainingcited by 41
- 2021Drawing Robust Scratch Tickets: Subnetworks with Inborn Robustness Are Found within Randomly Initialized Networkscited by 29
- 2023Ten Lessons We Have Learned in the New "Sparseland": A Short Handbook for Sparse Neural Network Researcherscited by 25
- 2019Towards Compact and Robust Deep Neural Networkscited by 23
- 2021Indicators of Attack Failure: Debugging and Improving Optimization of Adversarial Examplescited by 23
- 2021On the Effect of Pruning on Adversarial Robustnesscited by 23
- 2022Masking Adversarial Damage: Finding Adversarial Saliency for Robust and Sparse Networkcited by 21
- 2020Achieving Adversarial Robustness via Sparsitycited by 14
- 2024AttackBench: Evaluating Gradient-based Attacks for Adversarial Examplescited by 14
- 2022Pruning Adversarially Robust Neural Networks without Adversarial Examplescited by 12
- 2019The Search for Sparse, Robust Neural Networkscited by 11
- 2020Towards Practical Lottery Ticket Hypothesis for Adversarial Trainingcited by 9
- 2019Robust Sparse Regularization: Simultaneously Optimizing Neural Network Robustness and Compactnesscited by 7
50 most cited of 56 All 56 (JSON)
Built on by
Citing papers per year: 2024: 1; 2025: 6; 2026: 3.
10 papers.
- 2025Diagnosing Corruption-Induced Reliability Failures in Vision-Language Modelscited by 3
- 2025On the Interaction of Compressibility and Adversarial Robustnesscited by 2
- 2025Two is Better than One: Efficient Ensemble Defense for Robust and Compact Modelscited by 1
- 2024Adaptive Pruning with Module Robustness Sensitivity: Balancing Compression and Robustnesscited by 0
- 2025Compression Aware Certified Trainingcited by 0
- 2025S2AP: Score-space Sharpness Minimization for Adversarial Pruningcited by 0
- 2025Hierarchical Sparse Plus Low Rank Compression of LLMcited by 0
- 2026GRAPE: Guided Parameter-Space Evolution for Compact Adversarial Robustnesscited by 0
- 2026Prescriptive SVD-Inspired Attention via Spectral Energy Retentioncited by 0
- 2026AERIAL: Adversarial Evaluation of Robustness in Accuracy-Preserving Low-Precision EEG Decoderscited by 0
- 2026AERIAL: Adversarial Evaluation of Robustness in Accuracy-Preserving Low-Precision EEG Decoders24 Sep 2026
- 2026Prescriptive SVD-Inspired Attention via Spectral Energy Retention21 Sep 2026
- 2026GRAPE: Guided Parameter-Space Evolution for Compact Adversarial Robustness12 Jun 2026
- 2025Hierarchical Sparse Plus Low Rank Compression of LLM19 Dec 2025
- 2025Diagnosing Corruption-Induced Reliability Failures in Vision-Language Models24 Nov 2025
- 2025S2AP: Score-space Sharpness Minimization for Adversarial Pruning21 Oct 2025
- 2025On the Interaction of Compressibility and Adversarial Robustness23 Jul 2025
- 2025Compression Aware Certified Training13 Jun 2025
- 2025Two is Better than One: Efficient Ensemble Defense for Robust and Compact Models7 Apr 2025
- 2024Adaptive Pruning with Module Robustness Sensitivity: Balancing Compression and Robustness19 Oct 2024