Incremental Learning with Repetition via Pseudo-Feature Projection

Benedikt Tscheschner, Eduardo Veas, Marc Masana
2/27/2025
cs.LGcs.AIcs.CV

No official code found. Best implementation: Tsebeb/cvww_cir_horde (0 stars, MIT, last commit 2025-02-17).

Abstract

Incremental Learning scenarios do not always represent real-world inference use-cases, which tend to have less strict task boundaries, and exhibit repetition of common classes and concepts in their continual data stream. To better represent these use-cases, new scenarios with partial repetition and mixing of tasks are proposed, where the repetition patterns are innate to the scenario and unknown to the strategy. We investigate how exemplar-free incremental learning strategies are affected by data repetition, and we adapt a series of state-of-the-art approaches to analyse and fairly compare them under both settings. Further, we also propose a novel method (Horde), able to dynamically adjust an ensemble of self-reliant feature extractors, and align them by exploiting class repetition. Our proposed exemplar-free method achieves competitive results in the classic scenario without repetition, and state-of-the-art performance in the one with repetition.

View on arXivView PDF

Code Implementations(1)

MIT
00PythonJan 22, 20251 years agoMIT

Cite this paper

@article{tscheschner2025incremental,
  title  = {Incremental Learning with Repetition via Pseudo-Feature Projection},
  author = {Benedikt Tscheschner and Eduardo Veas and Marc Masana},
  year   = {2025},
  eprint = {2502.19922},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.19922v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.19922.svg)](https://codeofpaper.com/paper/2502.19922)

Discussion