Adaptive Pruning with Module Robustness Sensitivity: Balancing Compression and Robustness
Lincen Bai, Hedi Tabia, Raúl Santos-Rodríguez
TL;DR
This work tackles the trade-off between neural network compression and adversarial robustness by introducing Module Robust Pruning and Fine-Tuning (MRPF), a framework guided by the Module Robustness Sensitivity (MRS) metric. MRPF adaptively allocates pruning across layers based on robustness impact and couples pruning with adversarial fine-tuning (notably TRADES) to preserve robust decision boundaries. Across CIFAR-10/100, SVHN, and Tiny-ImageNet on ResNet, VGG, and MobileViT, MRPF demonstrates improved adversarial robustness and competitive accuracy at various sparsity levels, outperforming state-of-the-art structured pruning methods in balancing robustness, accuracy, and compression. The framework is practical, scalable, and generalizable to diverse architectures, offering a principled path to robust, efficient pruned networks and motivating extensions to larger models and transformer-based backbones.
Abstract
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.
