Pushing the Efficiency Limit Using Structured Sparse Convolutions
Not on the map. Why?
Abstract (arXiv)
Weight pruning is among the most popular approaches for compressing deep convolutional neural networks. Recent work suggests that in a randomly initialized deep neural network, there exist sparse subnetworks that achieve performance comparable to the original network. Unfortunately, finding these subnetworks involves iterative stages of training and pruning, which can be computationally expensive. We propose Structured Sparse Convolution (SSC), which leverages the inherent structure in images to reduce the parameters in the convolutional filter. This leads to improved efficiency of convolutional architectures compared to existing methods that perform pruning at initialization. We show that SSC is a generalization of commonly used layers (depthwise, groupwise and pointwise convolution) in ``efficient architectures.'' Extensive experiments on well-known CNN models and datasets show the effectiveness of the proposed method. Architectures based on SSC achieve state-of-the-art performance compared to baselines on CIFAR-10, CIFAR-100, Tiny-ImageNet, and ImageNet classification benchmarks.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 47 of its 64 references that are in the map. First posted on arXiv 23 Oct 2022.
Builds on
47 of 64 references.
References · 47
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2014Going Deeper with Convolutionscited by 4,231
- 2016Aggregated Residual Transformations for Deep Neural Networkscited by 2,540
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
- 2018ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Designcited by 1,132
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
35 more
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
- 2018Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layerscited by 340
- 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
- 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
- 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 283
- 2018Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Datacited by 260
- 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
- 2017Deep Rewiring: Training very sparse deep networkscited by 136
- 2020Dynamic Model Pruning with Feedbackcited by 125
- 2019Orthogonal Convolutional Neural Networkscited by 122
- 2018A Systematic DNN Weight Pruning Framework using Alternating Direction Method of Multiplierscited by 118
- 2017Bayesian Compression for Deep Learningcited by 116
- 2015Data-free parameter pruning for Deep Neural Networkscited by 112
- 2018On the Power of Over-parametrization in Neural Networks with Quadratic Activationcited by 102
- 2019A Signal Propagation Perspective for Pruning Neural Networks at Initializationcited by 96
- 2016Understanding and Improving Convolutional Neural Networks via Concatenated Rectified Linear Unitscited by 86
- 2017All You Need is Beyond a Good Init: Exploring Better Solution for Training Extremely Deep Convolutional Neural Networks with Orthonormality and Modulationcited by 58
- 2017Compression-aware Training of Deep Networkscited by 46
- 2019Stabilizing the Lottery Ticket Hypothesiscited by 36
- 2018Leveraging Filter Correlations for Deep Model Compressioncited by 23
- 2019HetConv: Heterogeneous Kernel-Based Convolutions for Deep CNNscited by 16
- 2022Interspace Pruning: Using Adaptive Filter Representations to Improve Training of Sparse CNNscited by 16
- 2019Play and Prune: Adaptive Filter Pruning for Deep Model Compressioncited by 15
- 2020A "Network Pruning Network" Approach to Deep Model Compressioncited by 2
Built on by
Citing papers per year: 2023: 2; 2024: 1.
3 papers.