Noise-Tolerant Coreset-Based Class Incremental Continual Learning
Edison Mucllari, Aswin Raghavan, Zachary Alan Daniels
TL;DR
This work investigates the robustness of class-incremental continual learning (CIL) when training data are corrupted by label noise or uncorrelated instance noise. It derives a bound for CRUST under additive instance noise and develops two noise-tolerant replay strategies, Continual CRUST and Continual Cosine-CRUST, to build robust replay buffers in a continual setting. Through extensive experiments on five diverse datasets, the authors show that the proposed methods substantially outperform traditional memory-based baselines in terms of final accuracy and forgetting under noise, while preserving high coreset purity. The results highlight the practical potential of noise-tolerant coresets for reliable continual adaptation in vision systems across domains, including medical imaging and remote sensing.
Abstract
Many applications of computer vision require the ability to adapt to novel data distributions after deployment. Adaptation requires algorithms capable of continual learning (CL). Continual learners must be plastic to adapt to novel tasks while minimizing forgetting of previous tasks.However, CL opens up avenues for noise to enter the training pipeline and disrupt the CL. This work focuses on label noise and instance noise in the context of class-incremental learning (CIL), where new classes are added to a classifier over time, and there is no access to external data from past classes. We aim to understand the sensitivity of CL methods that work by replaying items from a memory constructed using the idea of Coresets. We derive a new bound for the robustness of such a method to uncorrelated instance noise under a general additive noise threat model, revealing several insights. Putting the theory into practice, we create two continual learning algorithms to construct noise-tolerant replay buffers. We empirically compare the effectiveness of prior memory-based continual learners and the proposed algorithms under label and uncorrelated instance noise on five diverse datasets. We show that existing memory-based CL are not robust whereas the proposed methods exhibit significant improvements in maximizing classification accuracy and minimizing forgetting in the noisy CIL setting.
