Generative Kernel Continual learning
Mohammad Mahdi Derakhshani, Xiantong Zhen, Ling Shao, Cees G., M. Snoek

TL;DR
This paper introduces generative kernel continual learning, combining generative models with kernels to eliminate memory dependence, improve efficiency, and enhance classification performance in continual learning tasks.
Contribution
It proposes a novel approach that uses generative models to produce samples for kernel learning, reducing memory needs and task interference while boosting accuracy.
Findings
Achieves comparable accuracy to memory-intensive methods with less memory.
Demonstrates significant accuracy gains on SplitCIFAR100.
Provides a scalable, efficient continual learning framework.
Abstract
Kernel continual learning by \citet{derakhshani2021kernel} has recently emerged as a strong continual learner due to its non-parametric ability to tackle task interference and catastrophic forgetting. Unfortunately its success comes at the expense of an explicit memory to store samples from past tasks, which hampers scalability to continual learning settings with a large number of tasks. In this paper, we introduce generative kernel continual learning, which explores and exploits the synergies between generative models and kernels for continual learning. The generative model is able to produce representative samples for kernel learning, which removes the dependence on memory in kernel continual learning. Moreover, as we replay only on the generative model, we avoid task interference while being computationally more efficient compared to previous methods that need replay on the entire…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning
