Advancing Weight and Channel Sparsification with Enhanced Saliency
Not on the map. Why?
Abstract (arXiv)
Pruning aims to accelerate and compress models by removing redundant parameters, identified by specifically designed importance scores which are usually imperfect. This removal is irreversible, often leading to subpar performance in pruned models. Dynamic sparse training, while attempting to adjust sparse structures during training for continual reassessment and refinement, has several limitations including criterion inconsistency between pruning and growth, unsuitability for structured sparsity, and short-sighted growth strategies. Our paper introduces an efficient, innovative paradigm to enhance a given importance criterion for either unstructured or structured sparsity. Our method separates the model into an active structure for exploitation and an exploration space for potential updates. During exploitation, we optimize the active structure, whereas in exploration, we reevaluate and reintegrate parameters from the exploration space through a pruning and growing step consistently guided by the same given importance criterion. To prepare for exploration, we briefly "reactivate" all parameters in the exploration space and train them for a few iterations while keeping the active part frozen, offering a preview of the potential performance gains from reintegrating these parameters. We show on various datasets and configurations that existing importance criterion even simple as magnitude can be enhanced with ours to achieve state-of-the-art performance and training cost reductions. Notably, on ImageNet with ResNet50, ours achieves an +1.3 increase in Top-1 accuracy over prior art at 90% ERK sparsity. Compared with the SOTA latency pruning method HALP, we reduced its training cost by over 70% while attaining a faster and more accurate pruned model.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 72 of its 94 references that are in the map. First posted on arXiv 5 Feb 2025.
Builds on
72 of 94 references.
References · 72
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,845
- 2015SSD: Single Shot MultiBox Detectorcited by 3,130
- 2016Wide Residual Networkscited by 3,070
- 2021SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformerscited by 2,940
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2019Are Sixteen Heads Really Better than One?cited by 816
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
38 more
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
- 2019Importance Estimation for Neural Network Pruningcited by 541
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2019The State of Sparsity in Deep Neural Networkscited by 476
- 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 378
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
- 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 295
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
- 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
- 2014cuDNN: Efficient Primitives for Deep Learningcited by 245
- 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 227
- 2021Accelerating Sparse Deep Neural Networkscited by 223
- 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 213
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 189
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 151
- 2018NetAdapt: Platform-Aware Neural Network Adaptation for Mobile Applicationscited by 147
- 2020Dynamic Model Pruning with Feedbackcited by 125
- 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 110
- 2020Neural Pruning via Growing Regularizationcited by 97
- 2020SCOP: Scientific Control for Reliable Neural Network Pruningcited by 93
- 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 84
- 2021Dynamic Slimmable Networkcited by 83
- 2019Network Pruning via Transformable Architecture Searchcited by 80
- 2020EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruningcited by 80
- 2021Top-KAST: Top-K Always Sparse Trainingcited by 79
- 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 79
- 2017Exploring Sparsity in Recurrent Neural Networkscited by 75
- 2019Towards Efficient Model Compression via Learned Global Rankingcited by 75
- 2020Operation-Aware Soft Channel Pruning using Differentiable Maskscited by 74
- 2016Training Sparse Neural Networkscited by 73
- 2016Learning the Number of Neurons in Deep Networkscited by 69
- 2020DMCP: Differentiable Markov Channel Pruning for Neural Networkscited by 69
- 2020Progressive Skeletonization: Trimming more fat from a network at initializationcited by 64
50 most cited of 72 All 72 (JSON)
Built on by
Citing papers per year: 2025: 1.
1 paper.