Separate, Dynamic and Differentiable (SMART) Pruner for Block/Output Channel Pruning on Computer Vision Tasks
Not on the map. Why?
Abstract (arXiv)
Block pruning, which eliminates contiguous blocks of weights, is a structural pruning method that can significantly enhance the performance of neural processing units (NPUs). In industrial applications, an ideal block pruning algorithm should meet three key requirements: (1) maintain high accuracy across diverse models and tasks, as machine learning deployments on edge devices are typically accuracy-critical; (2) offer precise control over resource constraints to facilitate user adoption; and (3) provide convergence guarantees to prevent performance instability. However, to the best of our knowledge, no existing block pruning algorithm satisfies all three requirements simultaneously. In this paper, we introduce SMART (Separate, Dynamic, and Differentiable) pruning, a novel algorithm designed to address this gap. SMART leverages both weight and activation information to enhance accuracy, employs a differentiable top-k operator for precise control of resource constraints, and offers convergence guarantees under mild conditions. Extensive experiments involving seven models, four datasets, three different block types, and three computer vision tasks demonstrate that SMART pruning achieves state-of-the-art performance in block pruning.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 46 of its 71 references that are in the map. First posted on arXiv 29 Mar 2024.
Builds on
46 of 71 references.
References · 46
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Microsoft COCO: Common Objects in Contextcited by 17,608
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2014Going Deeper with Convolutionscited by 4,241
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,845
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
34 more
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
- 2021MobileViT: Light-weight, General-purpose, and Mobile-friendly Vision Transformercited by 642
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
- 2018HAQ: Hardware-Aware Automated Quantization with Mixed Precisioncited by 443
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
- 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 378
- 2020BiSeNet V2: Bilateral Network with Guided Aggregation for Real-time Semantic Segmentationcited by 294
- 2018Model compression via distillation and quantizationcited by 289
- 2016Dynamic Network Surgery for Efficient DNNscited by 233
- 2021Block Pruning For Faster Transformerscited by 177
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 151
- 2019Additive Powers-of-Two Quantization: An Efficient Non-uniform Discretization for Neural Networkscited by 148
- 2022A Review of Sparse Expert Models in Deep Learningcited by 148
- 2020Dynamic Model Pruning with Feedbackcited by 125
- 2022MobileOne: An Improved One millisecond Mobile Backbonecited by 109
- 2021Network Quantization with Element-wise Gradient Scalingcited by 87
- 2020Channel Pruning via Automatic Structure Searchcited by 85
- 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 84
- 2020Operation-Aware Soft Channel Pruning using Differentiable Maskscited by 74
- 2020DMCP: Differentiable Markov Channel Pruning for Neural Networkscited by 69
- 2021Prune Once for All: Sparse Pre-Trained Language Modelscited by 66
- 2021AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networkscited by 59
- 2019Discovering Neural Wiringscited by 56
- 2019AutoCompress: An Automatic DNN Structured Pruning Framework for Ultra-High Compression Ratescited by 49
- 2020DSA: More Efficient Budgeted Pruning via Differentiable Sparsity Allocationcited by 47
- 2022CHEX: CHannel EXploration for CNN Model Compressioncited by 36
- 2018Deep k-Means: Re-Training and Parameter Sharing with Harder Cluster Assignments for Compressing Deep Convolutionscited by 33
- 2022Pruning-as-Search: Efficient Neural Architecture Search via Channel Pruning and Structural Reparameterizationcited by 32
- 2021DKM: Differentiable K-Means Clustering Layer for Neural Network Compressioncited by 31
- 2023Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspectivecited by 26
- 2023PDP: Parameter-free Differentiable Pruning is All You Needcited by 12
- 2023Automatic Attention Pruning: Improving and Automating Model Pruning using Attentionscited by 11
- 2020Efficient Neural Network Deployment for Microcontrollercited by 7
- 2022OptG: Optimizing Gradient-driven Criteria in Network Sparsitycited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026SLA2: Sparse-Linear Attention with Learnable Routing and QATcited by 22
- 2026SLA2: Sparse-Linear Attention with Learnable Routing and QAT13 Feb 2026