Compact Deep Convolutional Neural Networks With Coarse Pruning

By Sajid Anwar, Wonyong Sung. 2016

58 citations recorded by the source corpus.

The learning capability of a neural network improves with increasing depth at higher computational costs. Wider layers with dense kernel connectivity patterns furhter increase this cost and may hinder real-time inference. We propose feature map and kernel level pruning for reducing the computational complexity of a deep convolutional neural network. Pruning feature maps reduces the width of a layer and hence does not need any sparse representation. Further, kernel pruning converts the dense connectivity pattern into a sparse one. Due to coarse nature, these pruning granularities can be exploited by GPUs and VLSI based implementations. We propose a simple and generic strategy to choose the least adversarial pruning masks for both granularities. The pruned networks are retrained which compensates the loss in accuracy. We obtain the best pruning ratios when we prune a network with both granularities. Experiments with the CIFAR-10 dataset show that more than 85% sparsity can be induced in the convolution layers with less than 1% increase in the missclassification rate of the baseline network.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Song Han
  2. Quoc V. Le
  3. Ji Lin
  4. Dacheng Tao
  5. Junjie Yan
  6. Yi Yang
  7. Chuang Gan
  8. Zhijian Liu

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Dacheng Tao
  3. Song Han
  4. Yi Yang
  5. Trevor Darrell
  6. Xiaogang Wang
  7. Alan L. Yuille
  8. Jitendra Malik

Citations in the corpus