Clustering-based Domain-Incremental Learning
Christiaan Lamers, Rene Vidal, Nabil Belbachir, Niki van Stein, Thomas, Baeck, Paris Giampouras

TL;DR
This paper introduces a clustering-based approach for domain-incremental learning that effectively mitigates catastrophic forgetting without requiring task change information, enhancing existing methods like A-GEM and OGD.
Contribution
It proposes a novel online clustering method that enables task-agnostic continual learning, addressing a key challenge in domain-incremental settings where task boundaries are unknown.
Findings
Effective counteraction of catastrophic forgetting in domain-incremental learning
Task-agnostic versions of A-GEM and OGD outperform existing methods
Demonstrated superior performance on real datasets
Abstract
We consider the problem of learning multiple tasks in a continual learning setting in which data from different tasks is presented to the learner in a streaming fashion. A key challenge in this setting is the so-called "catastrophic forgetting problem", in which the performance of the learner in an "old task" decreases when subsequently trained on a "new task". Existing continual learning methods, such as Averaged Gradient Episodic Memory (A-GEM) and Orthogonal Gradient Descent (OGD), address catastrophic forgetting by minimizing the loss for the current task without increasing the loss for previous tasks. However, these methods assume the learner knows when the task changes, which is unrealistic in practice. In this paper, we alleviate the need to provide the algorithm with information about task changes by using an online clustering-based approach on a dynamically updated finite pool…
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
