pith. sign in

arxiv: 1412.1442 · v1 · pith:RDPYICXJnew · submitted 2014-12-03 · 💻 cs.CV

Memory Bounded Deep Convolutional Networks

classification 💻 cs.CV
keywords memoryregularizerscnnsconvolutiondeepnetworksresulttraining
0
0 comments X
read the original abstract

In this work, we investigate the use of sparsity-inducing regularizers during training of Convolution Neural Networks (CNNs). These regularizers encourage that fewer connections in the convolution and fully connected layers take non-zero values and in effect result in sparse connectivity between hidden units in the deep network. This in turn reduces the memory and runtime cost involved in deploying the learned CNNs. We show that training with such regularization can still be performed using stochastic gradient descent implying that it can be used easily in existing codebases. Experimental evaluation of our approach on MNIST, CIFAR, and ImageNet datasets shows that our regularizers can result in dramatic reductions in memory requirements. For instance, when applied on AlexNet, our method can reduce the memory consumption by a factor of four with minimal loss in accuracy.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding

    cs.CV 2015-10 conditional novelty 7.0

    A pruning-quantization-Huffman pipeline compresses deep neural networks 35-49x without accuracy loss.