Clustering-based Domain-Incremental Learning
IEEE/CVF International Conference on Computer Vision Workshops (ICCVW), pp. 3376–3384
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 of samples or gradients. We thereby successfully counteract catastrophic forgetting in one of the hardest settings, namely: domain-incremental learning, a setting for which the problem was previously unsolved. We showcase the benefits of our approach by applying these ideas to projection-based methods, such as A-GEM and OGD, which lead to task-agnostic versions of them. Experiments on real datasets demonstrate the effectiveness of the proposed strategy and its promising performance compared to state-of-the-art methods.
Authors 6
-
Affiliation as printed
NORCE,Grimstad,Norway,4879
-
Affiliation as printed
University of Pennsylvania,Institute for Data Engineering and Science,Philadelphia,USA
Institute for Data Engineering and Science, University of Pennsylvania, Philadelphia, USA
-
Affiliation as printed
NORCE,Grimstad,Norway,4879
-
Affiliation as printed
Leiden Institute of Advanced Computer Science,Leiden,The Netherlands,2333 CA
-
Affiliation as printed
Leiden Institute of Advanced Computer Science,Leiden,The Netherlands,2333 CA
-
Affiliation as printed
Johns Hopkins University,Baltimore,MD,US,21218
Cited by 19 stored of 20
19 results
No patents citing this paper on Lens.org (checked 2026-10-11).
References 50
-
W2963559848details pending0citations
-
W2963588172details pending0citations
-
W2964189064details pending0citations
-
W4295883599details pending0citations
-
W6738602802details pending0citations
-
W6741087337details pending0citations
-
W2982701845details pending0citations
-
W4286900503details pending0citations
-
W6743688258details pending0citations
-
W6756756258details pending0citations
-
W6763462227details pending0citations
-
W6764247177details pending0citations