CSTAR: Towards Compact and STructured Deep Neural Networks with Adversarial Robustness
Not on the map. Why?
Abstract (arXiv)
Model compression and model defense for deep neural networks (DNNs) have been extensively and individually studied. Considering the co-importance of model compactness and robustness in practical applications, several prior works have explored to improve the adversarial robustness of the sparse neural networks. However, the structured sparse models obtained by the exiting works suffer severe performance degradation for both benign and robust accuracy, thereby causing a challenging dilemma between robustness and structuredness of the compact DNNs. To address this problem, in this paper, we propose CSTAR, an efficient solution that can simultaneously impose the low-rankness-based Compactness, high STructuredness and high Adversarial Robustness on the target DNN models. By formulating the low-rankness and robustness requirement within the same framework and globally determining the ranks, the compressed DNNs can simultaneously achieve high compression performance and strong adversarial robustness. Evaluations for various DNN models on different datasets demonstrate the effectiveness of CSTAR. Compared with the state-of-the-art robust structured pruning methods, CSTAR shows consistently better performance. For instance, when compressing ResNet-18 on CIFAR-10, CSTAR can achieve up to 20.07% and 11.91% improvement for benign accuracy and robust accuracy, respectively. For compressing ResNet-18 with 16x compression ratio on Imagenet, CSTAR can obtain 8.58% benign accuracy gain and 4.27% robust accuracy gain compared to the existing robust structured pruning method.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 36 of its 56 references that are in the map. First posted on arXiv 4 Dec 2022.
Builds on
36 of 56 references.
References · 36
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
- 2020Fast is better than free: Revisiting adversarial trainingcited by 723
- 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
- 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 291
- 2020Attacks Which Do Not Kill Training Make Adversarial Learning Strongercited by 242
- 2014Compressing Deep Convolutional Networks using Vector Quantizationcited by 189
- 2015Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applicationscited by 161
- 2016Tensor Ring Decompositioncited by 125
- 2015Accelerating Very Deep Convolutional Networks for Classification and Detectioncited by 109
- 2015Convolutional neural networks with low-rank regularizationcited by 102
24 more
- 2019Adversarial Robustness vs Model Compression, or Both?cited by 98
- 2019Defensive Quantization: When Efficiency Meets Robustnesscited by 95
- 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 76
- 2018Deflecting Adversarial Attacks with Pixel Deflectioncited by 71
- 2018Sparse DNNs with Improved Adversarial Robustnesscited by 71
- 2019Model Compression with Adversarial Robustness: A Unified Optimization Frameworkcited by 71
- 2017Tensor-Train Recurrent Neural Networks for Video Classificationcited by 59
- 2020Learning Low-rank Deep Neural Networks via Singular Vector Orthogonality Regularization and Singular Value Sparsificationcited by 52
- 2021Towards Efficient Tensor Decomposition-Based DNN Model Compression with Optimization Frameworkcited by 52
- 2018Wide Compression: Tensor Ring Netscited by 50
- 2018Compressing Recurrent Neural Networks with Tensor Ring for Action Recognitioncited by 34
- 2017Learning Compact Recurrent Neural Networks with Block-Term Tensor Decompositioncited by 33
- 2014Efficient and Accurate Approximations of Nonlinear Convolutional Networkscited by 30
- 2020Heuristic Rank Selection with Progressively Searching Tensor Ring Networkcited by 28
- 2020Real-time, Universal, and Robust Adversarial Attacks Against Speaker Recognition Systemscited by 26
- 2018Trained Rank Pruning for Efficient Deep Neural Networkscited by 23
- 2019Towards Compact and Robust Deep Neural Networkscited by 23
- 2020Graph Universal Adversarial Attacks: A Few Bad Actors Ruin Graph Learning Modelscited by 18
- 2020An Efficient Hardware Accelerator for Structured Sparse Convolutional Neural Networks on FPGAscited by 16
- 2021Towards Extremely Compact RNNs for Video Recognition with Fully Decomposed Hierarchical Tucker Structurecited by 8
- 2019Robust Sparse Regularization: Simultaneously Optimizing Neural Network Robustness and Compactnesscited by 7
- 2022RIBAC: Towards Robust and Imperceptible Backdoor Attack against Compact DNNcited by 4
- 2019CAG: A Real-time Low-cost Enhanced-robustness High-transferability Content-aware Adversarial Attack Generatorcited by 3
- 2020Blind Adversarial Training: Balance Accuracy and Robustnesscited by 1
Built on by
Citing papers per year: 2024: 3; 2025: 1.
4 papers.
- 2024Transferable Learned Image Compression-Resistant Adversarial Perturbationscited by 2
- 2024Adaptive Pruning with Module Robustness Sensitivity: Balancing Compression and Robustnesscited by 0
- 2024Layer Pruning with Consensus: A Triple-Win Solutioncited by 0
- 2025Model-Free Adversarial Purification via Coarse-To-Fine Tensor Network Representationcited by 0
- 2025Model-Free Adversarial Purification via Coarse-To-Fine Tensor Network Representation25 Feb 2025
- 2024Layer Pruning with Consensus: A Triple-Win Solution21 Nov 2024
- 2024Adaptive Pruning with Module Robustness Sensitivity: Balancing Compression and Robustness19 Oct 2024
- 2024Transferable Learned Image Compression-Resistant Adversarial Perturbations6 Jan 2024