mlsanityData to 7 Oct 2026

On the Effect of Pruning on Adversarial Robustness

arXiv 2108.04890 ↗First posted 10 Aug 2021cs.CVcited by 23

Not on the map. Why?

Abstract (arXiv)

Pruning is a well-known mechanism for reducing the computational cost of deep convolutional networks. However, studies have shown the potential of pruning as a form of regularization, which reduces overfitting and improves generalization. We demonstrate that this family of strategies provides additional benefits beyond computational performance and generalization. Our analyses reveal that pruning structures (filters and/or layers) from convolutional networks increase not only generalization but also robustness to adversarial images (natural images with content modified). Such achievements are possible since pruning reduces network capacity and provides regularization, which have been proven effective tools against adversarial images. In contrast to promising defense mechanisms that require training with adversarial images and careful regularization, we show that pruning obtains competitive results considering only natural images (e.g., the standard and low-cost training). We confirm these findings on several adversarial attacks and architectures; thus suggesting the potential of pruning as a novel defense mechanism against adversarial images.

Key facts. Cited by 23 papers in the map (data through 7 Oct 2026). Builds on 55 of its 64 references that are in the map. First posted on arXiv 10 Aug 2021.

Builds on

55 of 64 references.

References · 55

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  3. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  4. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  5. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
  6. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
  7. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  8. 2018ImageNet-trained CNNs are biased towards texture; increasing shape bias improves accuracy and robustnesscited by 1,430
  9. 2019Natural Adversarial Examplescited by 1,401
  10. 2016Deep Networks with Stochastic Depthcited by 973
  11. 2019AugMix: A Simple Data Processing Method to Improve Robustness and Uncertaintycited by 897
  12. 2019Big Transfer (BiT): General Visual Representation Learningcited by 766
38 more
  1. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  2. 2018Rethinking the Value of Network Pruningcited by 595
  3. 2020What is the State of Neural Network Pruning?cited by 578
  4. 2018Spectral Signatures in Backdoor Attackscited by 457
  5. 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
  6. 2019Unlabeled Data Improves Adversarial Robustnesscited by 415
  7. 2021Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depthcited by 411
  8. 2017Mitigating Adversarial Effects Through Randomizationcited by 382
  9. 2019Using Pre-Training Can Improve Model Robustness and Uncertaintycited by 373
  10. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
  11. 2017SkipNet: Learning Dynamic Routing in Convolutional Networkscited by 328
  12. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
  13. 2019Adversarial Examples Improve Image Recognitioncited by 283
  14. 2020BERT Loses Patience: Fast and Robust Inference with Early Exitcited by 267
  15. 2020Bag of Tricks for Adversarial Trainingcited by 199
  16. 2020How Does Mixup Help With Robustness and Generalization?cited by 193
  17. 2017BlockDrop: Dynamic Inference Paths in Residual Networkscited by 185
  18. 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
  19. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  20. 2020Understanding and Mitigating the Tradeoff Between Robustness and Accuracycited by 148
  21. 2017Convolutional Networks with Adaptive Inference Graphscited by 147
  22. 2019Adversarial Training Can Hurt Generalizationcited by 131
  23. 2019Adversarial Robustness vs Model Compression, or Both?cited by 98
  24. 2019Are All Layers Created Equal?cited by 94
  25. 2020Shape-Texture Debiased Neural Network Trainingcited by 76
  26. 2021Improving Adversarial Robustness via Channel-wise Activation Suppressingcited by 76
  27. 2019Towards Efficient Model Compression via Learned Global Rankingcited by 75
  28. 2020Good Subnetworks Provably Exist: Pruning via Greedy Forward Selectioncited by 70
  29. 2019Adversarially robust transfer learningcited by 66
  30. 2020Informative Dropout for Robust Representation Learning: A Shape-bias Perspectivecited by 57
  31. 2019The Generalization-Stability Tradeoff In Neural Network Pruningcited by 54
  32. 2018ExpandNets: Linear Over-parameterization to Train Compact Convolutional Networkscited by 53
  33. 2019Neural Network Pruning with Residual-Connections and Limited-Datacited by 52
  34. 2020Model Rubik's Cube: Twisting Resolution, Depth and Width for TinyNetscited by 49
  35. 2020Once-for-All Adversarial Training: In-Situ Tradeoff between Robustness and Accuracy for Freecited by 48
  36. 2019The Impact of Neural Network Overparameterization on Gradient Confusion and Stochastic Gradient Descentcited by 46
  37. 2020Triple Wins: Boosting Accuracy, Robustness and Efficiency Together by Enabling Input-Adaptive Inferencecited by 45
  38. 2019Intriguing properties of adversarial training at scalecited by 33

50 most cited of 55 All 55 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 6; 2023: 3; 2024: 8; 2025: 3; 2026: 3.

23 papers.

Sort:

By area:

  1. 2022The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformerscited by 121
  2. 2024Pruning for Robust Concept Erasing in Diffusion Modelscited by 22
  3. 2022Can Model Compression Improve NLP Fairnesscited by 18
  4. 2022Can pruning improve certified robustness of neural networks?cited by 14
  5. 2023Robust low-rank training via approximate orthonormal constraintscited by 12
  6. 2022Linearity Grafting: Relaxed Neuron Pruning Helps Certifiable Robustnesscited by 10
  7. 2024Adversarial Pruning: A Survey and Benchmark of Pruning Methods for Adversarial Robustnesscited by 10
  8. 2022Recall Distortion in Neural Network Pruning and the Undecayed Pruning Algorithmcited by 9
  9. 2023Relationship between Model Compression and Adversarial Robustness: A Review of Current Evidencecited by 6
  10. 2024Investigating Calibration and Corruption Robustness of Post-hoc Pruned Perception CNNs: An Image Classification Benchmark Studycited by 5
  11. 2025Dynamical Low-Rank Compression of Neural Networks with Robustness under Adversarial Attackscited by 5
  12. 2023Benchmarking Adversarial Robustness of Compressed Deep Learning Modelscited by 3
11 more
  1. 2024An Empirical Study of the Influence of Adversarial Fine-Tuning on Compressed Neural Networkscited by 1
  2. 2022Towards Global Neural Network Abstractions with Locally-Exact Reconstructioncited by 0
  3. 2024Robustness to distribution shifts of compressed networks for edge devicescited by 0
  4. 2024Formal Local Implication Between Two Neural Networkscited by 0
  5. 2024Adaptive Pruning with Module Robustness Sensitivity: Balancing Compression and Robustnesscited by 0
  6. 2024Layer Pruning with Consensus: A Triple-Win Solutioncited by 0
  7. 2025Robustness as Architecture: Designing IQA Models to Withstand Adversarial Perturbationscited by 0
  8. 2025Enhancing Certifiable Semantic Robustness via Robust Pruning of Deep Neural Networkscited by 0
  9. 2026Bias In, Bias Out? Finding Unbiased Subnetworks in Vanilla Modelscited by 0
  10. 2026Understanding Fault Tolerance of Adversarially Robust Pruned Modelscited by 0
  11. 2026FOCUS & RePAIR: Mitigating Text Degeneration via Token-Level Guidance for Pruned Large Language Modelscited by 0