StructADMM: A Systematic, High-Efficiency Framework of Structured Weight Pruning for DNNs
Not on the map. Why?
Abstract (arXiv)
Weight pruning methods of DNNs have been demonstrated to achieve a good model pruning rate without loss of accuracy, thereby alleviating the significant computation/storage requirements of large-scale DNNs. Structured weight pruning methods have been proposed to overcome the limitation of irregular network structure and demonstrated actual GPU acceleration. However, in prior work the pruning rate (degree of sparsity) and GPU acceleration are limited (to less than 50%) when accuracy needs to be maintained. In this work,we overcome these limitations by proposing a unified, systematic framework of structured weight pruning for DNNs. It is a framework that can be used to induce different types of structured sparsity, such as filter-wise, channel-wise, and shape-wise sparsity, as well non-structured sparsity. The proposed framework incorporates stochastic gradient descent with ADMM, and can be understood as a dynamic regularization method in which the regularization target is analytically updated in each iteration. Without loss of accuracy on the AlexNet model, we achieve 2.58X and 3.65X average measured speedup on two GPUs, clearly outperforming the prior work. The average speedups reach 3.15X and 8.52X when allowing a moderate ac-curacy loss of 2%. In this case the model compression for convolutional layers is 15.0X, corresponding to 11.93X measured CPU speedup. Our experiments on ResNet model and on other data sets like UCF101 and CIFAR-10 demonstrate the consistently higher performance of our framework.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Jul 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 2; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
8 papers.
- 2022Pruning-as-Search: Efficient Neural Architecture Search via Channel Pruning and Structural Reparameterizationcited by 32
- 2022Pruning Networks with Cross-Layer Ranking & k-Reciprocal Nearest Filterscited by 16
- 2021Structured Model Pruning of Convolutional Networks on Tensor Processing Unitscited by 3
- 2021DARTS-PRIME: Regularization and Scheduling Improve Constrained Optimization in Differentiable NAScited by 1
- 2025A Metamorphic Testing Perspective on Knowledge Distillation for Language Models of Code: Does the Student Deeply Mimic the Teacher?cited by 1
- 2021BreakingBED -- Breaking Binary and Efficient Deep Neural Networks by Adversarial Attackscited by 0
- 2021Efficient Micro-Structured Weight Unification and Pruning for Neural Network Compressioncited by 0
- 2026Layerwise Decoupling for Stable Structured Sparsification of Fully Connected Layerscited by 0
- 2026Layerwise Decoupling for Stable Structured Sparsification of Fully Connected Layers17 Sep 2026
- 2025A Metamorphic Testing Perspective on Knowledge Distillation for Language Models of Code: Does the Student Deeply Mimic the Teacher?7 Nov 2025
- 2022Pruning-as-Search: Efficient Neural Architecture Search via Channel Pruning and Structural Reparameterization2 Jun 2022
- 2022Pruning Networks with Cross-Layer Ranking & k-Reciprocal Nearest Filters15 Feb 2022
- 2021Structured Model Pruning of Convolutional Networks on Tensor Processing Units9 Jul 2021
- 2021DARTS-PRIME: Regularization and Scheduling Improve Constrained Optimization in Differentiable NAS22 Jun 2021
- 2021Efficient Micro-Structured Weight Unification and Pruning for Neural Network Compression15 Jun 2021
- 2021BreakingBED -- Breaking Binary and Efficient Deep Neural Networks by Adversarial Attacks14 Mar 2021