mlsanityData to 14 Oct 2026

Adaptive Pruning with Module Robustness Sensitivity: Balancing Compression and Robustness

arXiv 2410.15176 ↗First posted 19 Oct 2024cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Neural network pruning has traditionally focused on weight-based criteria to achieve model compression, frequently overlooking the crucial balance between adversarial robustness and accuracy. Existing approaches often fail to preserve robustness in pruned networks, leaving them more susceptible to adversarial attacks. This paper introduces Module Robustness Sensitivity (MRS), a novel metric that quantifies layer-wise sensitivity to adversarial perturbations and dynamically informs pruning decisions. Leveraging MRS, we propose Module Robust Pruning and Fine-Tuning (MRPF), an adaptive pruning algorithm compatible with any adversarial training method, offering both flexibility and scalability. Extensive experiments on SVHN, CIFAR, and Tiny-ImageNet across diverse architectures, including ResNet, VGG, and MobileViT, demonstrate that MRPF significantly enhances adversarial robustness while maintaining competitive accuracy and computational efficiency. Furthermore, MRPF consistently outperforms state-of-the-art structured pruning methods in balancing robustness, accuracy, and compression. This work establishes a practical and generalizable framework for robust pruning, addressing the long-standing trade-off between model compression and robustness preservation.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 36 of its 48 references that are in the map. First posted on arXiv 19 Oct 2024.

Builds on

36 of 48 references.

References · 36

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  4. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  5. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  6. 2013Intriguing properties of neural networkscited by 5,155
  7. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  8. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  9. 2016Identity Mappings in Deep Residual Networkscited by 1,965
  10. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
  11. 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
  12. 2016Pruning Filters for Efficient ConvNetscited by 1,143
24 more
  1. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  2. 2021MobileViT: Light-weight, General-purpose, and Mobile-friendly Vision Transformercited by 642
  3. 2018Rethinking the Value of Network Pruningcited by 599
  4. 2019Importance Estimation for Neural Network Pruningcited by 541
  5. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
  6. 2019Nesterov Accelerated Gradient and Scale Invariance for Adversarial Attackscited by 355
  7. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
  8. 2021Enhancing the Transferability of Adversarial Attacks through Variance Tuningcited by 244
  9. 2015Quantized Convolutional Neural Networks for Mobile Devicescited by 215
  10. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 202
  11. 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
  12. 2021Group Fisher Pruning for Practical Network Compressioncited by 131
  13. 2019Adversarial Robustness vs Model Compression, or Both?cited by 98
  14. 2020Do Wider Neural Networks Really Help Adversarial Robustness?cited by 79
  15. 2018Sparse DNNs with Improved Adversarial Robustnesscited by 72
  16. 2019Model Compression with Adversarial Robustness: A Unified Optimization Frameworkcited by 71
  17. 2021Multi-Prize Lottery Ticket Hypothesis: Finding Accurate Binary Neural Networks by Pruning A Randomly Weighted Networkcited by 55
  18. 2021Network Pruning That Matters: A Case Study on Retraining Variantscited by 25
  19. 2021On the Effect of Pruning on Adversarial Robustnesscited by 23
  20. 2023Improving Generalization of Adversarial Training via Robust Critical Fine-Tuningcited by 23
  21. 2023Adaptive Sharpness-Aware Pruning for Robust Sparse Networkscited by 17
  22. 2022Pruning Adversarially Robust Neural Networks without Adversarial Examplescited by 12
  23. 2024Adversarial Pruning: A Survey and Benchmark of Pruning Methods for Adversarial Robustnesscited by 10
  24. 2022CSTAR: Towards Compact and STructured Deep Neural Networks with Adversarial Robustnesscited by 4

Built on by

Not cited yet.