LGCVSep 26, 2024

Task-recency bias strikes back: Adapting covariances in Exemplar-Free Class Incremental Learning

arXiv:2409.18265v213 citationsh-index: 16Has Code
Originality Incremental advance
AI Analysis

This addresses incremental learning challenges for AI systems that need to learn continuously without storing past data, representing an incremental improvement.

The paper tackled the problem of adapting covariance matrices and mitigating task-recency bias in Exemplar-Free Class Incremental Learning, resulting in state-of-the-art performance on popular benchmarks and datasets.

Exemplar-Free Class Incremental Learning (EFCIL) tackles the problem of training a model on a sequence of tasks without access to past data. Existing state-of-the-art methods represent classes as Gaussian distributions in the feature extractor's latent space, enabling Bayes classification or training the classifier by replaying pseudo features. However, we identify two critical issues that compromise their efficacy when the feature extractor is updated on incremental tasks. First, they do not consider that classes' covariance matrices change and must be adapted after each task. Second, they are susceptible to a task-recency bias caused by dimensionality collapse occurring during training. In this work, we propose AdaGauss -- a novel method that adapts covariance matrices from task to task and mitigates the task-recency bias owing to the additional anti-collapse loss function. AdaGauss yields state-of-the-art results on popular EFCIL benchmarks and datasets when training from scratch or starting from a pre-trained backbone. The code is available at: https://github.com/grypesc/AdaGauss.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes