Compact Multi-level Sparse Neural Networks with Input Independent Dynamic Rerouting
Not on the map. Why?
Abstract (arXiv)
Deep neural networks (DNNs) have shown to provide superb performance in many real life applications, but their large computation cost and storage requirement have prevented them from being deployed to many edge and internet-of-things (IoT) devices. Sparse deep neural networks, whose majority weight parameters are zeros, can substantially reduce the computation complexity and memory consumption of the models. In real-use scenarios, devices may suffer from large fluctuations of the available computation and memory resources under different environment, and the quality of service (QoS) is difficult to maintain due to the long tail inferences with large latency. Facing the real-life challenges, we propose to train a sparse model that supports multiple sparse levels. That is, a hierarchical structure of weights are satisfied such that the locations and the values of the non-zero parameters of the more-sparse sub-model area subset of the less-sparse sub-model. In this way, one can dynamically select the appropriate sparsity level during inference, while the storage cost is capped by the least sparse sub-model. We have verified our methodologies on a variety of DNN models and tasks, including the ResNet-50, PointNet++, GNMT, and graph attention networks. We obtain sparse sub-models with an average of 13.38% weights and 14.97% FLOPs, while the accuracies are as good as their dense counterparts. More-sparse sub-models with 5.38% weights and 4.47% of FLOPs, which are subsets of the less-sparse ones, can be obtained with only 3.25% relative accuracy loss.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 30 of its 43 references that are in the map. First posted on arXiv 21 Dec 2021.
Builds on
30 of 43 references.
References · 30
- 2015Deep Residual Learning for Image Recognitioncited by 51,950
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,223
- 2017Graph Attention Networkscited by 8,888
- 2017PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Spacecited by 4,389
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,315
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,017
- 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,473
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 891
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 783
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 592
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 574
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
18 more
- 2017SkipNet: Learning Dynamic Routing in Convolutional Networkscited by 330
- 2018Slimmable Neural Networkscited by 302
- 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 295
- 2019CondConv: Conditionally Parameterized Convolutions for Efficient Inferencecited by 273
- 2017Adaptive Neural Networks for Efficient Inferencecited by 162
- 2018A Systematic DNN Weight Pruning Framework using Alternating Direction Method of Multiplierscited by 120
- 2020MNN: A Universal and Efficient Inference Enginecited by 64
- 2017NeST: A Neural Network Synthesis Tool Based on a Grow-and-Prune Paradigmcited by 60
- 2019PCONV: The Missing but Desirable Sparsity in DNN Weight Pruning for Real-time Execution on Mobile Devicescited by 50
- 2020WeightNet: Revisiting the Design Space of Weight Networkscited by 50
- 2018ADMM-NN: An Algorithm-Hardware Co-Design Framework of DNNs Using Alternating Direction Method of Multiplierscited by 42
- 2019AutoGrow: Automatic Layer Growing in Deep Convolutional Networkscited by 26
- 2018Grow and Prune Compact, Fast, and Accurate LSTMscited by 20
- 2018RePr: Improved Training of Convolutional Filterscited by 12
- 2019SCANN: Synthesis of Compact and Accurate Neural Networkscited by 11
- 2019Incremental Learning Using a Grow-and-Prune Paradigm with Efficient Neural Networkscited by 9
- 2018Dynamically Sacrificing Accuracy for Reduced Computation: Cascaded Inference Based on Softmax Confidencecited by 5
- 2019CGaP: Continuous Growth and Pruning for Efficient Deep Learningcited by 3
Built on by
Not cited yet.