Self-Regulated Neurogenesis for Online Data-Incremental Learning
Not on the map. Why?
Abstract (arXiv)
Neural networks often struggle with catastrophic forgetting when learning sequences of tasks or data streams, unlike humans who can continuously learn and consolidate new concepts even in the absence of explicit cues. Online data-incremental learning seeks to emulate this capability by processing each sample only once, without having access to task or stream cues at any point in time since this is more realistic compared to offline setups, where all data from novel class(es) is assumed to be readily available. However, existing methods typically rely on storing the subsets of data in memory or expanding the initial model architecture, resulting in significant computational overhead. Drawing inspiration from 'self-regulated neurogenesis'-brain's mechanism for creating specialized regions or circuits for distinct functions-we propose a novel approach SERENA which encodes each concept in a specialized network path called 'concept cell', integrated into a single over-parameterized network. Once a concept is learned, its corresponding concept cell is frozen, effectively preventing the forgetting of previously acquired information. Furthermore, we introduce two new continual learning scenarios that more closely reflect real-world conditions, characterized by gradually changing sample sizes. Experimental results show that our method not only establishes new state-of-the-art results across ten benchmarks but also remarkably surpasses offline supervised batch learning performance. The code is available at https://github.com/muratonuryildirim/serena.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 59 of its 92 references that are in the map. First posted on arXiv 13 Mar 2024.
Builds on
59 of 92 references.
References · 59
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2016Learning without Forgettingcited by 2,465
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2016Matching Networks for One Shot Learningcited by 2,246
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,313
- 2017Continual Learning with Deep Generative Replaycited by 1,152
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
- 2021Learning to Prompt for Continual Learningcited by 938
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
38 more
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 734
- 2019Large Scale Incremental Learningcited by 727
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2019Gradient based sample selection for online continual learningcited by 568
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 446
- 2016Expert Gate: Lifelong Learning with a Network of Expertscited by 369
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
- 2019On Tiny Episodic Memories in Continual Learningcited by 299
- 2021DyTox: Transformers for Continual Learning with DYnamic TOken eXpansioncited by 291
- 2019Maintaining Discrimination and Fairness in Class Incremental Learningcited by 281
- 2020Inductive Biases for Deep Learning of Higher-Level Cognitioncited by 273
- 2019What's Hidden in a Randomly Weighted Neural Network?cited by 236
- 2022FOSTER: Feature Boosting and Compression for Class-Incremental Learningcited by 228
- 2020Supermasks in Superpositioncited by 223
- 2018Task-Free Continual Learningcited by 219
- 2022A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learningcited by 152
- 2020Adaptive Aggregation Networks for Class-Incremental Learningcited by 149
- 2020Continual Prototype Evolution: Learning Online from Non-Stationary Data Streamscited by 143
- 2020A Neural Dirichlet Process Mixture Model for Task-Free Continual Learningcited by 133
- 2022FeTrIL: Feature Translation for Exemplar-Free Class-Incremental Learningcited by 120
- 2022Class-Incremental Learning by Knowledge Distillation with Adaptive Feature Consolidationcited by 113
- 2022Learning Fast, Learning Slow: A General Continual Learning Method based on Complementary Learning Systemcited by 110
- 2019Continual Learning via Neural Pruningcited by 101
- 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
- 2018Task Agnostic Continual Learning Using Online Variational Bayescited by 61
- 2022SparCL: Sparse Continual Learning on the Edgecited by 55
- 2020SpaceNet: Make Free Space For Continual Learningcited by 53
- 2023Online Prototype Learning for Online Continual Learningcited by 53
- 2020Continual Learning with Extended Kronecker-factored Approximate Curvaturecited by 39
- 2022NISPA: Neuro-Inspired Stability-Plasticity Adaptation for Continual Learning in Sparse Networkscited by 38
- 2022On the Soft-Subnetwork for Few-shot Class Incremental Learningcited by 37
- 2022Long-Tailed Class Incremental Learningcited by 36
- 2016A topological insight into restricted Boltzmann machinescited by 32
50 most cited of 59 All 59 (JSON)
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.