Structured Pruning of Deep Convolutional Neural Networks

Citations Over TimeTop 1% of 2017 papers

Abstract

Real-time application of deep learning algorithms is often hindered by high computational complexity and frequent memory accesses. Network pruning is a promising technique to solve this problem. However, pruning usually results in irregular network connections that not only demand extra representation efforts but also do not fit well on parallel computation. We introduce structured sparsity at various scales for convolutional neural networks: feature map-wise, kernel-wise, and intra-kernel strided sparsity. This structured sparsity is very advantageous for direct computational resource savings on embedded computers, in parallel computing environments, and in hardware-based systems. To decide the importance of network connections and paths, the proposed method uses a particle filtering approach. The importance weight of each particle is assigned by assessing the misclassification rate with a corresponding connectivity pattern. The pruned network is retrained to compensate for the losses due to pruning. While implementing convolutions as matrix products, we particularly show that intra-kernel strided sparsity with a simple constraint can significantly reduce the size of the kernel and feature map tensors. The proposed work shows that when pruning granularities are applied in combination, we can prune the CIFAR-10 network by more than 70% with less than a 1% loss in accuracy.

Related Papers

• → Kernel Methods and Support Vector Machines(2014)38 cited
• → Novel Kernels and Kernel PCA for Pattern Recognition(2007)10 cited
• A new Compact Support Kernel of support vector machines(2008)
• → Local Linear Approximation for Kernel Methods: The Railway Kernel(2006)2 cited
• → Multiple Kernel LSSVM in Empirical Kernel Mapping Space(2009)1 cited