Loss-Aware Automatic Selection of Structured Pruning Criteria for Deep Neural Network Acceleration
Not on the map. Why?
Abstract (arXiv)
Structured pruning is a well-established technique for compressing neural networks, making it suitable for deployment in resource-limited edge devices. This paper presents an efficient Loss-Aware Automatic Selection of Structured Pruning Criteria (LAASP) for slimming and accelerating deep neural networks. The majority of pruning methodologies employ a sequential process consisting of three stages: 1) training, 2) pruning, and 3) fine-tuning, whereas the proposed pruning technique adopts a pruning-while-training approach that eliminates the first stage and integrates the second and third stages into a single cycle. The automatic selection of magnitude or similarity-based filter pruning criteria from a specified pool of criteria and the specific pruning layer at each pruning iteration is guided by the network's overall loss on a small subset of the training data. To mitigate the abrupt accuracy drop due to pruning, the network is retrained briefly after each reduction of a predefined number of floating-point operations (FLOPs). The optimal pruning rates for each layer in the network are automatically determined, eliminating the need for manual allocation of fixed or variable pruning rates for each layer. Experiments on the VGGNet and ResNet models on the CIFAR-10 and ImageNet benchmark datasets demonstrate the effectiveness of the proposed method. In particular, the ResNet56 and ResNet110 models on the CIFAR-10 dataset significantly improve the top-1 accuracy compared to state-of-the-art methods while reducing the network FLOPs by 52%. Furthermore, the ResNet50 model on the ImageNet dataset reduces FLOPs by more than 42% with a negligible 0.33% drop in top-5 accuracy. The source code of this paper is publicly available online - https://github.com/ghimiredhikura/laasp.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 33 of its 49 references that are in the map. First posted on arXiv 25 Jun 2025.
Builds on
33 of 49 references.
References · 33
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2016Wide Residual Networkscited by 3,070
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2016Identity Mappings in Deep Residual Networkscited by 1,965
- 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,593
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2018Rethinking the Value of Network Pruningcited by 599
21 more
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
- 2018Model compression via distillation and quantizationcited by 289
- 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
- 2023DepGraph: Towards Any Structural Pruningcited by 203
- 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 182
- 2018Learning to Quantize Deep Networks by Optimizing Quantization Intervals with Task Losscited by 160
- 2019Global Sparse Momentum SGD for Pruning Very Deep Neural Networkscited by 70
- 2021Only Train Once: A One-Shot Neural Network Training And Pruning Frameworkcited by 70
- 2020Learning Low-rank Deep Neural Networks via Singular Vector Orthogonality Regularization and Singular Value Sparsificationcited by 53
- 2021Towards Efficient Tensor Decomposition-Based DNN Model Compression with Optimization Frameworkcited by 52
- 2021Refine Myself by Teaching Myself: Feature Refinement via Self-Knowledge Distillationcited by 46
- 2019PruneTrain: Fast Neural Network Training by Dynamic Sparse Model Reconfigurationcited by 41
- 2021When to Prune? A Policy towards Early Structural Pruningcited by 38
- 2023OTOV2: Automatic, Generic, User-Friendlycited by 32
- 2018Leveraging Filter Correlations for Deep Model Compressioncited by 23
- 2019Filter Pruning by Switching to Neighboring CNNs with Good Attributescited by 15
- 2023Performance-aware Approximation of Global Channel Pruning for Multitask CNNscited by 9
- 2020Fusion-Catalyzed Pruning for Optimizing Deep Learning on Intelligent Edge Devicescited by 3
Built on by
Not cited yet.