paper-with-me

홈 › Papers

NORACL: Neurogenesis for Oracle-free Resource-Adaptive Continual Learning

2026-04-29 · Karthik Charan Raghunathan, Christian Metzner, Laura Kriener, Melika Payvand arxiv

In a continual learning setting, we require a model to be plastic enough to learn a new task and stable enough to not disturb previously learned capabilities. We argue that this dilemma has an architectural root. A finite network has limited representational and plastic resources, yet the required capacity depends on properties of the future task stream that are unknown: how many tasks will be encountered, and how much they overlap in feature space. Regularization-based methods preserve past knowledge within fixed-capacity architectures and therefore implicitly rely on an oracle architecture sized for this unknown future. When tasks are only weakly related, fixed architectures progressively run out of plastic resources; when tasks are few or strongly overlapping, models are often over-provisioned. Inspired by neurogenesis in biology, we propose NORACL to address the stability-plasticity dilemma by tackling the oracle architecture problem through neuronal growth. Starting from a compact network, NORACL grows only when needed by monitoring two complementary signals for representational and plasticity saturation. We evaluate NORACL against oracle-sized static baselines across varying task counts and geometries. Across all settings, NORACL achieves final average accuracies that are better than or on par with oracle-provisioned static baselines while using fewer parameters. Additionally, NORACL yields architectures with interpretable growth, i.e. dissimilar tasks predominantly expand feature-extraction layers, whereas tasks which rely on common features shift growth toward later feature-combination layers. Our analysis further explains why fixed-capacity networks lose plasticity as tasks accumulate, whereas NORACL creates fresh capacity for new tasks through growth. Together, these results show that adaptive neurogenesis pushes the stability-plasticity Pareto frontier of continual learning.

📄 PDF Abstract BibTeX arXiv:2604.27031

Code (0)

등록된 구현이 없습니다.

Tasks

Continual Learning

Similar Papers 제목 키워드 기반

Category-Based Strategy-Driven Question Generator for Visual Dialogue

2021-08-01 · CCL 2021 8 · Shi Yanan, Tan Yanxin, Feng Fangxiang, Zheng Chunping 외

“GuessWhat?! is a task-oriented visual dialogue task which has two players a guesser and anoracle. Guesser aims to locate the object supposed by oracle by asking several Yes/No questions which are answered by oracle. How…

Sentence

Radical pairs may explain reactive oxygen species-mediated effects of hypomagnetic field on neurogenesis

2021-10-25 · Rishabh, Hadi Zadeh-Haghighi, Dennis Salahub, Christoph Simon

Exposures to a hypomagnetic field can affect biological processes. Recently, it has been observed that hypomagnetic field exposure can adversely affect adult hippocampal neurogenesis and hippocampus-dependent cognition i…

HippocampusTriplet

NICE: Neurogenesis Inspired Contextual Encoding for Replay-free Class Incremental Learning

2024-01-01 · CVPR 2024 1 · Mustafa Burak Gurbuz, Jean Michael Moorman, Constantine Dovrolis

Deep neural networks (DNNs) struggle to learn in dynamic settings because they mainly rely on static datasets. Continual learning (CL) aims to overcome this limitation by enabling DNNs to incrementally accumulate kno…

class-incremental learningClass Incremental LearningContinual LearningHippocampus+1

Neurogenesis Deep Learning

2016-12-12 · Timothy J. Draelos, Nadine E. Miner, Christopher C. Lamb, Jonathan A. Cox 외

Neural machine learning methods, such as deep neural networks (DNN), have achieved remarkable success in a number of complex data processing tasks. These methods have arguably had their strongest impact on tasks such as …

BIG-bench Machine LearningDeep LearningHippocampus

New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees

2022-02-09 · Dan Garber, Ben Kretzu

We present new efficient \textit{projection-free} algorithms for online convex optimization (OCO), where by projection-free we refer to algorithms that avoid computing orthogonal projections onto the feasible set, and in…