CLIMB: Centroid-Based Hierarchical Memory for Online Continual Self-Supervised Learning

Julien Lefebvre, Stefan Duffner, Mathieu Lefort
6/30/2026
cs.CVcs.AI

No official code found. Best implementation: lefebvju/climb (0 stars, last commit 2026-06-30).

Abstract

Online Continual Self-Supervised Learning (OCSSL) aims to learn representations from a continuous stream of unlabeled data, without knowledge of task boundaries and under memory constraints. Existing methods rely either on replay buffers that exploit latent space structure, or on regularization alone. We present CLIMB (Continual Learning with Intelligent Memory Bank), which combines both simultaneously. Our method introduces a hierarchical centroid-based memory, bounded in total number of stored images, combined with knowledge distillation on replayed examples to limit representation drift. The memory groups similar images into centroids, providing hard-to-discriminate examples for contrastive learning while covering the diversity of observed distributions. Experiments on Split CIFAR-100 and Split ImageNet-100, on standard benchmarks from the state-of-the-art as well as a new protocol with irregular task distributions show that CLIMB outperforms state-of-the-art OCSSL methods.

View on arXivView PDF

Code Implementations(1)

lefebvju/climbCommunity71%

Official code for paper "CLIMB: Centroid-Based Hierarchical Memory for Online Continual Self-Supervised Learning" [Accepted CoLLAs 2026]

00Jun 30, 20263 months ago

Similar Papers

Cite this paper

@article{lefebvre2026climb,
  title  = {CLIMB: Centroid-Based Hierarchical Memory for Online Continual Self-Supervised Learning},
  author = {Julien Lefebvre and Stefan Duffner and Mathieu Lefort},
  year   = {2026},
  eprint = {2606.31275},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.31275v1}
}

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/2606.31275.svg)](https://codeofpaper.com/paper/2606.31275)

Discussion