Incremental Learning Using a Grow-and-Prune Paradigm with Efficient Neural Networks
Not on the map. Why?
Abstract (arXiv)
Deep neural networks (DNNs) have become a widely deployed model for numerous machine learning applications. However, their fixed architecture, substantial training cost, and significant model redundancy make it difficult to efficiently update them to accommodate previously unseen data. To solve these problems, we propose an incremental learning framework based on a grow-and-prune neural network synthesis paradigm. When new data arrive, the neural network first grows new connections based on the gradients to increase the network capacity to accommodate new data. Then, the framework iteratively prunes away connections based on the magnitude of weights to enhance network compactness, and hence recover efficiency. Finally, the model rests at a lightweight DNN that is both ready for inference and suitable for future grow-and-prune updates. The proposed framework improves accuracy, shrinks network size, and significantly reduces the additional training cost for incoming data compared to conventional approaches, such as training from scratch and network fine-tuning. For the LeNet-300-100 and LeNet-5 neural network architectures derived for the MNIST dataset, the framework reduces training cost by up to 64% (63%) and 67% (63%) compared to training from scratch (network fine-tuning), respectively. For the ResNet-18 architecture derived for the ImageNet dataset and DeepSpeech2 for the AN4 dataset, the corresponding training cost reductions against training from scratch (network fine-tunning) are 64% (60%) and 67% (62%), respectively. Our derived models contain fewer network parameters but achieve higher accuracy relative to conventional baselines.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 May 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 2; 2024: 1; 2025: 2.
9 papers.
- 2022Structural Pruning via Latency-Saliency Knapsackcited by 40
- 2023Heterogeneous Continual Learningcited by 6
- 2021Incremental Deep Neural Network Learning using Classification Confidence Thresholdingcited by 3
- 2022Noisy Heuristics NAS: A Network Morphism based Neural Architecture Search using Heuristicscited by 2
- 2023Importance Estimation with Random Gradient for Neural Network Pruningcited by 1
- 2021Compact Multi-level Sparse Neural Networks with Input Independent Dynamic Reroutingcited by 0
- 2024Metric as Transform: Exploring beyond Affine Transform for Interpretable Neural Networkcited by 0
- 2025Evolutionary Developmental Biology Can Serve as the Conceptual Foundation for a New Design Paradigm in Artificial Intelligencecited by 0
- 2025A Vision Toward Energy-Efficient Domain-Specific Artificial Intelligence Models and Agentscited by 0
- 2025A Vision Toward Energy-Efficient Domain-Specific Artificial Intelligence Models and Agents24 Oct 2025
- 2025Evolutionary Developmental Biology Can Serve as the Conceptual Foundation for a New Design Paradigm in Artificial Intelligence15 Jun 2025
- 2024Metric as Transform: Exploring beyond Affine Transform for Interpretable Neural Network21 Oct 2024
- 2023Importance Estimation with Random Gradient for Neural Network Pruning31 Oct 2023
- 2023Heterogeneous Continual Learning14 Jun 2023
- 2022Structural Pruning via Latency-Saliency Knapsack13 Oct 2022
- 2022Noisy Heuristics NAS: A Network Morphism based Neural Architecture Search using Heuristics10 Jul 2022
- 2021Compact Multi-level Sparse Neural Networks with Input Independent Dynamic Rerouting21 Dec 2021
- 2021Incremental Deep Neural Network Learning using Classification Confidence Thresholding21 Jun 2021