Full deep neural network training on a pruned weight budget
Not on the map. Why?
Abstract (arXiv)
We introduce a DNN training technique that learns only a fraction of the full parameter set without incurring an accuracy penalty. To do this, our algorithm constrains the total number of weights updated during backpropagation to those with the highest total gradients. The remaining weights are not tracked, and their initial value is regenerated at every access to avoid storing them in memory. This can dramatically reduce the number of off-chip memory accesses during both training and inference, a key component of the energy needs of DNN accelerators. By ensuring that the total weight diffusion remains close to that of baseline unpruned SGD, networks pruned using our technique are able to retain state-of-the-art accuracy across network architectures -- including networks previously identified as difficult to compress, such as Densenet and WRN. With ResNet18 on ImageNet, we observe an 11.7× weight reduction with no accuracy loss, and up to 24.4× with a small accuracy impact.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Jun 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 4; 2024: 1.
11 papers.
- 2022Efficient Fine-Tuning of BERT Models on the Edgecited by 29
- 2023SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networkscited by 12
- 2021Adaptive Precision Training (AdaPT): A dynamic fixed point quantized training approach for DNNscited by 8
- 2024Greedy Output Approximation: Towards Efficient Structured Pruning for LLMs Without Retrainingcited by 8
- 2021A Generalized Lottery Ticket Hypothesiscited by 5
- 2023Sparsified Model Zoo Twins: Investigating Populations of Sparsified Neural Network Modelscited by 4
- 2023Breaking through Deterministic Barriers: Randomized Pruning Mask Generation and Selectioncited by 3
- 2022LearningGroup: A Real-Time Sparse Training on FPGA via Learnable Weight Grouping for Multi-Agent Reinforcement Learningcited by 1
- 2023Competitive plasticity to reduce the energetic costs of learningcited by 1
- 2021Dynamic Neural Network Architectural and Topological Adaptation and Related Methods -- A Surveycited by 0
- 2022The Multiple Subnetwork Hypothesis: Enabling Multidomain Learning by Isolating Task-Specific Subnetworks in Feedforward Neural Networkscited by 0
- 2024Greedy Output Approximation: Towards Efficient Structured Pruning for LLMs Without Retraining26 Jul 2024
- 2023Breaking through Deterministic Barriers: Randomized Pruning Mask Generation and Selection19 Oct 2023
- 2023Sparsified Model Zoo Twins: Investigating Populations of Sparsified Neural Network Models26 Apr 2023
- 2023Competitive plasticity to reduce the energetic costs of learning4 Apr 2023
- 2023SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks9 Feb 2023
- 2022LearningGroup: A Real-Time Sparse Training on FPGA via Learnable Weight Grouping for Multi-Agent Reinforcement Learning29 Oct 2022
- 2022The Multiple Subnetwork Hypothesis: Enabling Multidomain Learning by Isolating Task-Specific Subnetworks in Feedforward Neural Networks18 Jul 2022
- 2022Efficient Fine-Tuning of BERT Models on the Edge3 May 2022
- 2021Dynamic Neural Network Architectural and Topological Adaptation and Related Methods -- A Survey28 Jul 2021
- 2021Adaptive Precision Training (AdaPT): A dynamic fixed point quantized training approach for DNNs28 Jul 2021
- 2021A Generalized Lottery Ticket Hypothesis3 Jul 2021