Optimizing Reusable Knowledge for Continual Learning via Metalearning
Julio Hurtado, Alain Raymond-Saez, Alvaro Soto
Abstract
When learning tasks over time, artificial neural networks suffer from a problem known as Catastrophic Forgetting (CF). This happens when the weights of a network are overwritten during the training of a new task causing forgetting of old information. To address this issue, we propose MetA Reusable Knowledge or MARK, a new method that fosters weight reusability instead of overwriting when learning a new task. Specifically, MARK keeps a set of shared weights among tasks. We envision these shared weights as a common Knowledge Base (KB) that is not only used to learn new tasks, but also enriched with new knowledge as the model learns new tasks. Key components behind MARK are two-fold. On the one hand, a metalearning approach provides the key mechanism to incrementally enrich the KB with new knowledge and to foster weight reusability among tasks. On the other hand, a set of trainable masks provides the key mechanism to selectively choose from the KB relevant weights to solve each task. By using MARK, we achieve state of the art results in several popular benchmarks, surpassing the best performing methods in terms of average accuracy by over 10% on the 20-Split-MiniImageNet dataset, while achieving almost zero forgetfulness using 55% of the number of parameters. Furthermore, an ablation study provides evidence that, indeed, MARK is learning reusable knowledge that is selectively used by each task.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers9
- Divide and not forget: Ensemble of selectively trained experts in Continual LearningGrzegorz Rypesc, Sebastian Cygert, Valeriya Khan, Tomasz Trzcinski et al.ICLR 2024 · 52 citations
- Self-Evolved Dynamic Expansion Model for Task-Free Continual LearningFei Ye, Adrian G. BorsICCV 2023 · 28 citations
- Wasserstein Expansible Variational Autoencoder for Discriminative and Generative Continual LearningFei Ye, Adrian G. BorsICCV 2023 · 6 citations
- Minimax Forward and Backward Learning of Evolving Tasks with Performance GuaranteesVerónica Álvarez, Santiago Mazuelas, José Antonio LozanoNeurIPS 2023 · 3 citations
- Continual Unsupervised Generative Modelling via Online Optimal TransportFei Ye, Adrian G. Bors, Kun ZhangAAAI 2025
Builds on10
- Continual learning with hypernetworksJohannes von Oswald, Christian Henning, João Sacramento, Benjamin F. GreweICLR 2020 · 412 citations
- Gradient Projection Memory for Continual LearningGobinda Saha, Isha Garg, Kaushik RoyICLR 2021 · 409 citations
- Supermasks in SuperpositionMitchell Wortsman, Vivek Ramanujan, Rosanne Liu, Aniruddha Kembhavi et al.NeurIPS 2020 · 364 citations
- Continual Prototype Evolution: Learning Online from Non-Stationary Data StreamsMatthias De Lange, Tinne TuytelaarsICCV 2021 · 251 citations
- Online Learned Continual Compression with Adaptive Quantization ModulesLucas Caccia, Eugene Belilovsky, Massimo Caccia, Joelle PineauICML 2020 · 95 citations
Related papers
- CLR: Channel-wise Lightweight Reprogramming for Continual LearningYunhao Ge, Yuecheng Li, Shuo Ni, Jiaping Zhao et al.ICCV 2023 · 16 citations
- One Person, One Model, One World: Learning Continual User Representation without ForgettingFajie Yuan, Guoxiao Zhang, Alexandros Karatzoglou, Joemon M. Jose et al.SIGIR 2021 · 52 citations
- Calibrating CNNs for Lifelong LearningPravendra Singh, Vinay Kumar Verma, Pratik Mazumder, Lawrence Carin et al.NeurIPS 2020 · 78 citations
- A Minimalistic Unified Framework for Incremental Learning across Image Restoration TasksXiaoxuan Gong, Jie MaNeurIPS 2025 · 2 citations
- Layerwise Optimization by Gradient Decomposition for Continual LearningShixiang Tang, Dapeng Chen, Jinguo Zhu, Shijie Yu et al.CVPR 2021
