Dynamic Structure Pruning for Compressing CNNs
Not on the map. Why?
Abstract (arXiv)
Structure pruning is an effective method to compress and accelerate neural networks. While filter and channel pruning are preferable to other structure pruning methods in terms of realistic acceleration and hardware compatibility, pruning methods with a finer granularity, such as intra-channel pruning, are expected to be capable of yielding more compact and computationally efficient networks. Typical intra-channel pruning methods utilize a static and hand-crafted pruning granularity due to a large search space, which leaves room for improvement in their pruning performance. In this work, we introduce a novel structure pruning method, termed as dynamic structure pruning, to identify optimal pruning granularities for intra-channel pruning. In contrast to existing intra-channel pruning methods, the proposed method automatically optimizes dynamic pruning granularities in each layer while training deep neural networks. To achieve this, we propose a differentiable group learning method designed to efficiently learn a pruning granularity based on gradient-based learning of filter groups. The experimental results show that dynamic structure pruning achieves state-of-the-art pruning performance and better realistic acceleration on a GPU compared with channel pruning. In particular, it reduces the FLOPs of ResNet50 by 71.85% without accuracy degradation on the ImageNet dataset. Our code is available at https://github.com/irishev/DSP.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 43 of its 53 references that are in the map. First posted on arXiv 17 Mar 2023.
Builds on
43 of 53 references.
References · 43
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2019Importance Estimation for Neural Network Pruningcited by 531
31 more
- 2013Do Deep Nets Really Need to be Deep?cited by 466
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
- 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
- 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
- 2018SNAS: Stochastic Neural Architecture Searchcited by 288
- 2016Dynamic Network Surgery for Efficient DNNscited by 233
- 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
- 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 226
- 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
- 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
- 2018Dynamic Channel Pruning: Feature Boosting and Suppressioncited by 129
- 2020Dynamic Model Pruning with Feedbackcited by 125
- 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
- 2018Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layerscited by 112
- 2019Provable Filter Pruning for Efficient Neural Networkscited by 98
- 2020Neural Pruning via Growing Regularizationcited by 97
- 2020SCOP: Scientific Control for Reliable Neural Network Pruningcited by 92
- 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 76
- 2020Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compressioncited by 72
- 2020Good Subnetworks Provably Exist: Pruning via Greedy Forward Selectioncited by 70
- 2020DHP: Differentiable Meta Pruning via HyperNetworkscited by 57
- 2019DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measurescited by 56
- 2022Revisiting Random Channel Pruning for Neural Network Compressioncited by 50
- 2020Pruning Filter in Filtercited by 46
- 2021Manifold Regularized Dynamic Network Pruningcited by 43
- 2018Exploiting Kernel Sparsity and Entropy for Interpretable CNN Compressioncited by 40
- 2020Accelerate CNNs from Three Dimensions: A Comprehensive Pruning Frameworkcited by 27
- 2018Structured Pruning for Efficient ConvNets via Incremental Regularizationcited by 15
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 2.
5 papers.
- 2023PriPrune: Quantifying and Preserving Privacy in Pruned Federated Learningcited by 3
- 2024Pick-or-Mix: Dynamic Channel Sampling for ConvNetscited by 2
- 2025BackSlash: Rate Constrained Optimized Training of Large Language Modelscited by 1
- 2024Dynamic neural network with memristive CIM and CAM for 2D and 3D visioncited by 0
- 2025ONG: One-Shot NMF-based Gradient Masking for Efficient Model Sparsificationcited by 0
- 2025ONG: One-Shot NMF-based Gradient Masking for Efficient Model Sparsification18 Aug 2025
- 2025BackSlash: Rate Constrained Optimized Training of Large Language Models23 Apr 2025
- 2024Dynamic neural network with memristive CIM and CAM for 2D and 3D vision12 Jul 2024
- 2024Pick-or-Mix: Dynamic Channel Sampling for ConvNets16 Jun 2024
- 2023PriPrune: Quantifying and Preserving Privacy in Pruned Federated Learning30 Oct 2023