GROWN: GRow Only When Necessary for Continual Learning
Not on the map. Why?
Abstract (arXiv)
Catastrophic forgetting is a notorious issue in deep learning, referring to the fact that Deep Neural Networks (DNN) could forget the knowledge about earlier tasks when learning new tasks. To address this issue, continual learning has been developed to learn new tasks sequentially and perform knowledge transfer from the old tasks to the new ones without forgetting. While recent structure-based learning methods show the capability of alleviating the forgetting problem, these methods start from a redundant full-size network and require a complex learning process to gradually grow-and-prune or search the network structure for each task, which is inefficient. To address this problem and enable efficient network expansion for new tasks, we first develop a learnable sparse growth method eliminating the additional pruning/searching step in previous structure-based methods. Building on this learnable sparse growth method, we then propose GROWN, a novel end-to-end continual learning framework to dynamically grow the model only when necessary. Different from all previous structure-based methods, GROWN starts from a small seed network, instead of a full-sized one. We validate GROWN on multiple datasets against state-of-the-art methods, which shows superior performance in both accuracy and model size. For example, we achieve 1.0% accuracy gain on average compared to the current SOTA results on CIFAR-100 Superclass 20 tasks setting.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 25 of its 30 references that are in the map. First posted on arXiv 3 Oct 2021.
Builds on
25 of 30 references.
References · 25
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2016Learning without Forgettingcited by 2,465
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2016Progressive Neural Networkscited by 1,332
- 2017Continual Learning with Deep Generative Replaycited by 1,152
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 734
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
- 2018Progress & Compress: A scalable framework for continual learningcited by 516
- 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
- 2017PathNet: Evolution Channels Gradient Descent in Super Neural Networkscited by 362
13 more
- 2019Learn to Grow: A Continual Structure Learning Framework for Overcoming Catastrophic Forgettingcited by 302
- 2018Learning without Memorizingcited by 249
- 2017Overcoming Catastrophic Forgetting by Incremental Moment Matchingcited by 243
- 2019Compacting, Picking and Growing for Unforgetting Continual Learningcited by 207
- 2018Online Structured Laplace Approximations For Overcoming Catastrophic Forgettingcited by 197
- 2019Scalable and Order-robust Continual Learning with Additive Parameter Decompositioncited by 125
- 2017Incremental Learning Through Deep Adaptationcited by 108
- 2020Efficient Continual Learning with Modular Networks and Task-Driven Priorscited by 87
- 2016Network Morphismcited by 63
- 2020Growing Efficient Deep Networks by Structured Continuous Sparsificationcited by 28
- 2019AutoGrow: Automatic Layer Growing in Deep Convolutional Networkscited by 26
- 2019Efficient Continual Learning in Neural Networks with Embedding Regularizationcited by 20
- 2020KSM: Fast Multiple Task Adaption via Kernel-wise Soft Mask Learningcited by 5
Built on by
Citing papers per year: 2022: 2; 2023: 3; 2024: 3; 2025: 1; 2026: 2.
11 papers.
- 2023Theory on Forgetting and Generalization of Continual Learningcited by 69
- 2022Beyond Not-Forgetting: Continual Learning with Backward Knowledge Transfercited by 59
- 2022SparCL: Sparse Continual Learning on the Edgecited by 55
- 2024A Statistical Theory of Regularization-Based Continual Learningcited by 32
- 2024Understanding Forgetting in Continual Learning with Linear Regressioncited by 26
- 2023Partial Network Cloningcited by 6
- 2023Efficient Self-supervised Continual Learning with Progressive Task-correlated Layer Freezingcited by 5
- 2025Rethinking Continual Learning with Progressive Neural Collapsecited by 4
- 2024Overcoming Growth-Induced Forgetting in Task-Agnostic Continual Learningcited by 1
- 2026Beyond Single-Model Optimization: Preserving Plasticity in Continual Reinforcement Learningcited by 1
- 2026On the Stability of Growth in Structural Plasticity: Forward-Active yet Backward-Starvedcited by 0
- 2026On the Stability of Growth in Structural Plasticity: Forward-Active yet Backward-Starved14 May 2026
- 2026Beyond Single-Model Optimization: Preserving Plasticity in Continual Reinforcement Learning16 Apr 2026
- 2025Rethinking Continual Learning with Progressive Neural Collapse30 May 2025
- 2024Overcoming Growth-Induced Forgetting in Task-Agnostic Continual Learning20 Aug 2024
- 2024A Statistical Theory of Regularization-Based Continual Learning10 Jun 2024
- 2024Understanding Forgetting in Continual Learning with Linear Regression27 May 2024
- 2023Partial Network Cloning19 Mar 2023
- 2023Efficient Self-supervised Continual Learning with Progressive Task-correlated Layer Freezing13 Mar 2023
- 2023Theory on Forgetting and Generalization of Continual Learning12 Feb 2023
- 2022Beyond Not-Forgetting: Continual Learning with Backward Knowledge Transfer1 Nov 2022
- 2022SparCL: Sparse Continual Learning on the Edge20 Sep 2022