Sparse Convolutional Neural Networks
University of Central Florida · Amazon (United States)
Abstract
Deep neural networks have achieved remarkable performance in both image classification and object detection problems, at the cost of a large number of parameters and computational complexity. In this work, we show how to reduce the redundancy in these parameters using a sparse decomposition. Maximum sparsity is obtained by exploiting both inter-channel and intra-channel redundancy, with a fine-tuning step that minimize the recognition loss caused by maximizing sparsity. This procedure zeros out more than 90% of parameters, with a drop of accuracy that is less than 1% on the ILSVRC2012 dataset. We also propose an efficient sparse matrix multiplication algorithm on CPU for Sparse Convolutional Neural Networks…
Citation impact
- FWCI
- 42.86
- Percentile
- 100%
- References
- 34
Authors
5Topics & keywords
- Computer science
- Convolutional neural network
- Speedup
- Redundancy (engineering)
- Sparse matrix
- Computational complexity theory
- Matrix multiplication
- Sparse approximation