Memory Bounded Deep Convolutional Networks
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 17 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 Dec 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 7; 2022: 3; 2023: 4; 2024: 2; 2025: 1.
17 papers.
Sort:
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
- 2021The Low-Resource Double Bind: An Empirical Study of Pruning for Low-Resource Machine Translationcited by 47
- 2021DECORE: Deep Compression with Reinforcement Learningcited by 29
- 2023Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspectivecited by 26
- 2022Data-Efficient Structured Pruning via Submodular Optimizationcited by 23
- 2021Neural Network Training Using ℓ1-Regularization and Bi-fidelity Datacited by 16
- 2021Manipulating Identical Filter Redundancy for Efficient Pruning on Deep and Complicated CNNcited by 9
- 2022Spartan: Differentiable Sparsity via Regularized Transportationcited by 8
- 2021Sum-Rate-Distortion Function for Indirect Multiterminal Source Coding in Federated Learningcited by 2
- 2022A phase transition for finding needles in nonlinear haystacks with LASSO artificial neural networkscited by 2
- 2023Model Compression Methods for YOLOv5: A Reviewcited by 2
- 2021Differentiable Architecture Pruning for Transfer Learningcited by 1
5 more
- 2024Sparse Deep Learning Models with the ℓ1 Regularizationcited by 1
- 2023Neural Network Reduction with Guided Regularizerscited by 0
- 2023Generalization Bounds for Magnitude-Based Pruning via Sparse Matrix Sketchingcited by 0
- 2024Efficient Model Compression for Bayesian Neural Networkscited by 0
- 2025Coding for Computation: Efficient Compression of Neural Networks for Reconfigurable Hardwarecited by 0
- 2025Coding for Computation: Efficient Compression of Neural Networks for Reconfigurable Hardware24 Apr 2025
- 2024Efficient Model Compression for Bayesian Neural Networks1 Nov 2024
- 2024Sparse Deep Learning Models with the ℓ1 Regularization5 Aug 2024
- 2023Model Compression Methods for YOLOv5: A Review21 Jul 2023
- 2023Generalization Bounds for Magnitude-Based Pruning via Sparse Matrix Sketching30 May 2023
- 2023Neural Network Reduction with Guided Regularizers29 May 2023
- 2023Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspective2 Feb 2023
- 2022Spartan: Differentiable Sparsity via Regularized Transportation27 May 2022
- 2022Data-Efficient Structured Pruning via Submodular Optimization9 Mar 2022
- 2022A phase transition for finding needles in nonlinear haystacks with LASSO artificial neural networks21 Jan 2022
- 2021The Low-Resource Double Bind: An Empirical Study of Pruning for Low-Resource Machine Translation6 Oct 2021
- 2021Manipulating Identical Filter Redundancy for Efficient Pruning on Deep and Complicated CNN30 Jul 2021
5 more
- 2021Differentiable Architecture Pruning for Transfer Learning7 Jul 2021
- 2021DECORE: Deep Compression with Reinforcement Learning11 Jun 2021
- 2021Neural Network Training Using ℓ1-Regularization and Bi-fidelity Data27 May 2021
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networks31 Jan 2021
- 2021Sum-Rate-Distortion Function for Indirect Multiterminal Source Coding in Federated Learning21 Jan 2021
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
- 2021The Low-Resource Double Bind: An Empirical Study of Pruning for Low-Resource Machine Translationcited by 47
- 2021DECORE: Deep Compression with Reinforcement Learningcited by 29
- 2023Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspectivecited by 26
- 2022Data-Efficient Structured Pruning via Submodular Optimizationcited by 23
- 2021Neural Network Training Using ℓ1-Regularization and Bi-fidelity Datacited by 16
- 2021Manipulating Identical Filter Redundancy for Efficient Pruning on Deep and Complicated CNNcited by 9
- 2022Spartan: Differentiable Sparsity via Regularized Transportationcited by 8
- 2021Sum-Rate-Distortion Function for Indirect Multiterminal Source Coding in Federated Learningcited by 2
- 2022A phase transition for finding needles in nonlinear haystacks with LASSO artificial neural networkscited by 2
- 2023Model Compression Methods for YOLOv5: A Reviewcited by 2
- 2021Differentiable Architecture Pruning for Transfer Learningcited by 1
12 most cited of 17 All 17 (JSON)
- 2025Coding for Computation: Efficient Compression of Neural Networks for Reconfigurable Hardware24 Apr 2025
- 2024Efficient Model Compression for Bayesian Neural Networks1 Nov 2024
- 2024Sparse Deep Learning Models with the ℓ1 Regularization5 Aug 2024
- 2023Model Compression Methods for YOLOv5: A Review21 Jul 2023
- 2023Generalization Bounds for Magnitude-Based Pruning via Sparse Matrix Sketching30 May 2023
- 2023Neural Network Reduction with Guided Regularizers29 May 2023
- 2023Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspective2 Feb 2023
- 2022Spartan: Differentiable Sparsity via Regularized Transportation27 May 2022
- 2022Data-Efficient Structured Pruning via Submodular Optimization9 Mar 2022
- 2022A phase transition for finding needles in nonlinear haystacks with LASSO artificial neural networks21 Jan 2022
- 2021The Low-Resource Double Bind: An Empirical Study of Pruning for Low-Resource Machine Translation6 Oct 2021
- 2021Manipulating Identical Filter Redundancy for Efficient Pruning on Deep and Complicated CNN30 Jul 2021
12 newest of 17 All 17 (JSON)