Fast and Controllable Post-training Sparsity: Learning Optimal Sparsity Allocation with Global Constraint in Minutes
Not on the map. Why?
Abstract (arXiv)
Neural network sparsity has attracted many research interests due to its similarity to biological schemes and high energy efficiency. However, existing methods depend on long-time training or fine-tuning, which prevents large-scale applications. Recently, some works focusing on post-training sparsity (PTS) have emerged. They get rid of the high training cost but usually suffer from distinct accuracy degradation due to neglect of the reasonable sparsity rate at each layer. Previous methods for finding sparsity rates mainly focus on the training-aware scenario, which usually fails to converge stably under the PTS setting with limited data and much less training cost. In this paper, we propose a fast and controllable post-training sparsity (FCPTS) framework. By incorporating a differentiable bridge function and a controllable optimization objective, our method allows for rapid and accurate sparsity allocation learning in minutes, with the added assurance of convergence to a predetermined global sparsity rate. Equipped with these techniques, we can surpass the state-of-the-art methods by a large margin, e.g., over 30% improvement for ResNet-50 on ImageNet under the sparsity rate of 80%. Our plug-and-play code and supplementary materials are open-sourced at https://github.com/ModelTC/FCPTS.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 30 of its 39 references that are in the map. First posted on arXiv 9 May 2024.
Builds on
30 of 39 references.
References · 30
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2015SSD: Single Shot MultiBox Detectorcited by 3,125
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
- 2020Designing Network Design Spacescited by 954
- 2018MnasNet: Platform-Aware Neural Architecture Search for Mobilecited by 937
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
18 more
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
- 2019Differentiable Soft Quantization: Bridging Full-Precision and Low-Bit Neural Networkscited by 234
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
- 2022QDrop: Randomly Dropping Quantization for Extremely Low-bit Post-Training Quantizationcited by 175
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 150
- 2020Dynamic Model Pruning with Feedbackcited by 125
- 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
- 2019Towards Unified INT8 Training for Convolutional Neural Networkcited by 77
- 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 77
- 2017Exploring Sparsity in Recurrent Neural Networkscited by 75
- 2019AutoCompress: An Automatic DNN Structured Pruning Framework for Ultra-High Compression Ratescited by 49
- 2021Effective Sparsification of Neural Networks with Global Sparsity Constraintcited by 45
- 2021MQBench: Towards Reproducible and Deployable Model Quantization Benchmarkcited by 38
- 2021Post-training deep neural network pruning via layer-wise calibrationcited by 23
- 2021Lottery Ticket Preserves Weight Correlation: Is It Desirable or Not?cited by 22
- 2023CP3: Channel Pruning Plug-in for Point-based Networkscited by 10
- 2018Combating Adversarial Attacks Using Sparse Representationscited by 9
Built on by
Citing papers per year: 2024: 2; 2025: 1.
3 papers.
- 2024Reconsidering the Energy Efficiency of Spiking Neural Networks Inference from Analytical Perspectivescited by 12
- 2024PTSBench: A Comprehensive Post-Training Sparsity Benchmark Towards Algorithms and Modelscited by 5
- 2025B-FPGM: Lightweight Face Detection via Bayesian-Optimized Soft FPGM Pruningcited by 2
- 2025B-FPGM: Lightweight Face Detection via Bayesian-Optimized Soft FPGM Pruning28 Jan 2025
- 2024PTSBench: A Comprehensive Post-Training Sparsity Benchmark Towards Algorithms and Models10 Dec 2024
- 2024Reconsidering the Energy Efficiency of Spiking Neural Networks Inference from Analytical Perspectives29 Aug 2024