Inducing Semi-Structured Sparsity by Masking for Efficient Model Inference in Convolutional Networks
Not on the map. Why?
Abstract (arXiv)
The crucial role of convolutional models, both as standalone vision models and backbones in foundation models, necessitates effective acceleration techniques. This paper proposes a novel method to learn semi-structured sparsity patterns for convolution kernels in the form of maskings enabling the utilization of readily available hardware accelerations. The approach accelerates convolutional models more than two-fold during inference without decreasing model performance. At the same time, the original model weights and structure remain unchanged keeping the model thus easily updatable. Beyond the immediate practical use, the effect of maskings on prediction is easily quantifiable. Therefore, guarantees on model predictions under maskings are derived showing stability bounds for learned maskings even after updating the original underlying model.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 33 of its 47 references that are in the map. First posted on arXiv 1 Nov 2024.
Builds on
33 of 47 references.
References · 33
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2022A ConvNet for the 2020scited by 3,545
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2017Random Erasing Data Augmentationcited by 1,235
21 more
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2018Rethinking the Value of Network Pruningcited by 595
- 2020What is the State of Neural Network Pruning?cited by 578
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2020The Computational Limits of Deep Learningcited by 188
- 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
- 2020The Hardware Lotterycited by 160
- 2021Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Bettercited by 153
- 2020Dynamic Model Pruning with Feedbackcited by 125
- 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
- 2021Compute and Energy Consumption Trends in Deep Learning Inferencecited by 61
- 2022Advancing Model Pruning via Bi-level Optimizationcited by 55
- 2021How Well Do Sparse Imagenet Models Transfer?cited by 50
- 2018Predicting the Computational Cost of Deep Learning Modelscited by 49
- 2017Exploring the Regularity of Sparse Structure in Convolutional Neural Networkscited by 37
- 2018Deep Learning Inference in Facebook Data Centers: Characterization, Performance Optimizations and Hardware Implicationscited by 35
- 2023Gradient-Free Structured Pruning with Unlabeled Datacited by 26
- 2024Pruning Large Language Models with Semi-Structural Adaptive Sparse Trainingcited by 20
- 2023Accelerating Deep Neural Networks via Semi-Structured Activation Sparsitycited by 10
Built on by
Not cited yet.