Learning to Continually Learn with the Bayesian Principle
Not on the map. Why?
Abstract (arXiv)
In the present era of deep learning, continual learning research is mainly focused on mitigating forgetting when training a neural network with stochastic gradient descent on a non-stationary stream of data. On the other hand, in the more classical literature of statistical machine learning, many models have sequential Bayesian update rules that yield the same learning outcome as the batch training, i.e., they are completely immune to catastrophic forgetting. However, they are often overly simple to model complex real-world data. In this work, we adopt the meta-learning paradigm to combine the strong representational power of neural networks and simple statistical models' robustness to forgetting. In our novel meta-continual learning framework, continual learning takes place only in statistical models via ideal sequential Bayesian update rules, while neural networks are meta-learned to bridge the raw data and the statistical models. Since the neural networks remain fixed during continual learning, they are protected from catastrophic forgetting. This approach not only achieves significantly improved performance but also exhibits excellent scalability. Since our approach is domain-agnostic and model-agnostic, it can be applied to a wide range of problems and easily integrated with existing model architectures.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 31 of its 45 references that are in the map. First posted on arXiv 29 May 2024.
Builds on
31 of 45 references.
References · 31
- 2017Attention Is All You Needcited by 59,932
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2020Denoising Diffusion Probabilistic Modelscited by 20,851
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2017Prototypical Networks for Few-shot Learningcited by 3,001
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2020Rethinking Attention with Performerscited by 1,584
- 2018On First-Order Meta-Learning Algorithmscited by 1,003
- 2020Efficient Transformers: A Surveycited by 784
19 more
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 734
- 2016MS-Celeb-1M: A Dataset and Benchmark for Large-Scale Face Recognitioncited by 621
- 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
- 2018Conditional Neural Processescited by 421
- 2019Orthogonal Gradient Descent for Continual Learningcited by 361
- 2017Variational Continual Learningcited by 335
- 2018Neural Processescited by 307
- 2022Exploring Length Generalization in Large Language Modelscited by 204
- 2019Meta-Learning Representations for Continual Learningcited by 189
- 2019Online Meta-Learningcited by 137
- 2019Fast and Flexible Multi-Task Classification Using Conditional Neural Adaptive Processescited by 131
- 2018Meta-Learning Probabilistic Inference For Predictioncited by 108
- 2020Optimal Continual Learning has Perfect Memory and is NP-hardcited by 86
- 2020Learning to Continually Learncited by 82
- 2018Meta-Learning Priors for Efficient Online Bayesian Regressioncited by 47
- 2021Reproducibility Report: La-MAML: Look-ahead Meta Learning for Continual Learningcited by 42
- 2019A Unifying Bayesian View of Continual Learningcited by 38
- 2023When Meta-Learning Meets Online and Continual Learning: A Surveycited by 12
- 2023Recasting Continual Learning as Sequence Modelingcited by 11
Built on by
Citing papers per year: 2025: 3; 2026: 5.
8 papers.
- 2025Distilling Reinforcement Learning Algorithms for In-Context Model-Based Planningcited by 12
- 2025When Continue Learning Meets Multimodal Large Language Model: A Surveycited by 8
- 2025Learning to Evolve: Bayesian-Guided Continual Knowledge Graph Embeddingcited by 2
- 2026Beyond Sharpness: A Flatness Decomposition Framework for Efficient Continual Learningcited by 0
- 2026Finding Structure in Continual Learningcited by 0
- 2026Task Switching Without Forgetting via Proximal Decouplingcited by 0
- 2026Scaling few-shot spoken word classification with generative meta-continual learningcited by 0
- 2026Does language matter for spoken word classification? A multilingual generative meta-learning approachcited by 0
- 2026Does language matter for spoken word classification? A multilingual generative meta-learning approach13 May 2026
- 2026Scaling few-shot spoken word classification with generative meta-continual learning13 May 2026
- 2026Task Switching Without Forgetting via Proximal Decoupling20 Apr 2026
- 2026Finding Structure in Continual Learning4 Feb 2026
- 2026Beyond Sharpness: A Flatness Decomposition Framework for Efficient Continual Learning12 Jan 2026
- 2025Learning to Evolve: Bayesian-Guided Continual Knowledge Graph Embedding4 Aug 2025
- 2025When Continue Learning Meets Multimodal Large Language Model: A Survey27 Feb 2025
- 2025Distilling Reinforcement Learning Algorithms for In-Context Model-Based Planning26 Feb 2025