REVIEW 2 cited by
Memory Bounded Deep Convolutional Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 2 Pith papers
-
Adversarial Neural Pruning with Latent Vulnerability Suppression
ANP-VS couples a new latent-feature distortion loss with adversarial Bayesian pruning, improving PGD robustness on three datasets while compressing the network.
-
Smaller Models, Better Generalization
A regularizer claimed to minimize a VC dimension bound for neural networks is proposed, but the bound derivation drops a required term and the empirical gains over L2 regularization are inconsistent.
Discussion (0). Continue with ORCID to comment.