On the Interaction of Compressibility and Adversarial Robustness
Not on the map. Why?
Abstract (arXiv)
As demands for resource efficiency and safety in modern neural networks intensify, substantial research effort has gone into model compression and adversarial robustness. Yet despite progress on each in isolation, a systematic understanding of how compressibility shapes robustness remains elusive. In this paper, we develop a principled framework to analyze how different forms of structured compressibility - such as neuron-level and spectral compressibility - affect adversarial robustness. We show that structured compressibility can induce a small number of highly sensitive directions in the representation space, which adversaries can exploit to construct effective perturbations. Our analysis yields a robustness bound that reveals how neuron and spectral compressibility impact ℓ_∞ and ℓ2 robustness via their effects on the learned representations. Crucially, the vulnerabilities we identify arise irrespective of how compressibility is achieved - whether via regularization, architectural bias, or learning dynamics. Through empirical evaluations across synthetic and realistic tasks, we confirm our theoretical predictions, and further demonstrate that these vulnerabilities persist under adversarial training and transfer learning, and contribute to the emergence of universal adversarial examples. Our findings show a fundamental tension between structured compressibility and robustness and highlight new pathways for designing models that are efficient and safe.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 53 of its 78 references that are in the map. First posted on arXiv 23 Jul 2025.
Builds on
53 of 78 references.
References · 53
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Intriguing properties of neural networkscited by 5,155
- 2016Wide Residual Networkscited by 3,070
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
38 more
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,318
- 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 953
- 2018Robustness May Be at Odds with Accuracycited by 880
- 2016Universal adversarial perturbationscited by 784
- 2019Square Attack: a query-efficient black-box adversarial attack via random searchcited by 685
- 2020What is the State of Neural Network Pruning?cited by 583
- 2018Black-box Adversarial Attacks with Limited Queries and Informationcited by 501
- 2018Lipschitz regularity of deep neural networks: analysis and efficient estimationcited by 415
- 2018Stronger generalization bounds for deep nets via a compression approachcited by 307
- 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 293
- 2018Adversarial Robustness Toolbox v1.0.0cited by 215
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 202
- 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 126
- 2018Sparse DNNs with Improved Adversarial Robustnesscited by 72
- 2020Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compressioncited by 72
- 2019Model Compression with Adversarial Robustness: A Unified Optimization Frameworkcited by 71
- 2020An Overview of Neural Network Compressioncited by 59
- 2024Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compressioncited by 57
- 2020A law of robustness for two-layers neural networkscited by 55
- 2023Pruning vs Quantization: Which is Better?cited by 46
- 2021Heavy Tails in SGD and Compressibility of Overparametrized Neural Networkscited by 44
- 2022Low-rank lottery tickets: finding efficient low-rank neural networks via matrix differential equationscited by 43
- 2020Optimism in the Face of Adversity: Understanding and Improving Deep Learning through Adversarial Robustnesscited by 28
- 2023Pruning Deep Neural Networks from a Sparsity Perspectivecited by 25
- 2023Model Compression in Practice: Lessons Learned from Practitioners Creating On-device Machine Learning Experiencescited by 21
- 2018Design Principles for Sparse Matrix Multiplication on the GPUcited by 19
- 2023Regularization properties of adversarially-trained linear regressioncited by 18
- 2020Achieving Adversarial Robustness via Sparsitycited by 14
- 2023Robust low-rank training via approximate orthonormal constraintscited by 13
- 2020Towards Understanding the Regularization of Adversarial Robustness on Neural Networkscited by 12
- 2022Adversarial robustness of sparse local Lipschitz predictorscited by 11
- 2022Diversified Adversarial Attacks based on Conjugate Gradient Methodcited by 11
- 2024Adversarial Pruning: A Survey and Benchmark of Pruning Methods for Adversarial Robustnesscited by 10
- 2024Tight and Efficient Upper Bound on Spectral Norm of Convolutional Layerscited by 7
- 2022On Transfer of Adversarial Robustness from Pretraining to Downstream Taskscited by 6
- 2023Relationship between Model Compression and Adversarial Robustness: A Review of Current Evidencecited by 6
- 2023Implicit Compressibility of Overparametrized Neural Networks Trained with Heavy-Tailed SGDcited by 5
- 2024Holistic Adversarially Robust Pruningcited by 5
50 most cited of 53 All 53 (JSON)
Built on by
Citing papers per year: 2025: 2.
2 papers.