Inducing Semi-Structured Sparsity by Masking for Efficient Model Inference in Convolutional Networks
David A. Danhofer

TL;DR
This paper introduces a method to learn semi-structured sparsity in convolutional neural networks through masking, significantly accelerating inference while maintaining model accuracy and allowing easy updates.
Contribution
It presents a novel masking technique to induce semi-structured sparsity, enabling hardware acceleration without altering original model weights or structure.
Findings
Over two-fold inference speedup achieved.
Model performance remains unchanged.
Stability bounds for predictions under maskings are derived.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Brain Tumor Detection and Classification · Neural Networks and Applications
MethodsConvolution
