arXiv AI

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

arXiv:2606. 31275v1 Announce Type: cross 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.

arXiv AI
Jul 14

Lifelong Representations: A Survey on Continual Self-Supervised Learning for Vision Models

arXiv:2607. 09785v1 Announce Type: cross Abstract: Traditionally, continual learning has assumed access to labeled data, yet many real-world applications -- such as lifelong robotics -- require models to adapt continuously from unlabeled streams.

By Sergi Masip, Alicja Dobrzeniecka, Jonathan Swinnen, Joachim Collin, Bart{\l}omiej Twardowski, Szymon {\L}ukasik, Tinne Tuytelaars
arXiv Machine Learning
Aug 31

Unsupervised Continual Learning with Growing Self-Organizing Maps and Synthetic Replay

The paper introduces a generative continual learning framework that uses growing self‑organizing maps (GSOMs) enhanced with learned distributional statistics and encoder‑decoder models for class‑incremental learning. GSOM units store mean, variance, and covariance estimates to synthesize replay samples, enabling exemplar‑free training without raw data or explicit task boundaries. Experiments on multiple benchmarks show that the unsupervised method competes with supervised memory‑based approaches and outperforms memory‑free baselines, especially in single‑class incremental scenarios, and provides baseline results for TinyImageNet and MiniImageNet.

By Pujan Thapa, Alexander Ororbia, Travis Desell
arXiv Machine Learning
Sep 17

Leveraging Complementary Embeddings for Replay Selection in Continual Learning with Small Buffers

The paper introduces Multiple Embedding Replay Selection (MERS), a graph‑based method that combines supervised and self‑supervised embeddings to improve sample selection for replay buffers in continual learning. MERS replaces traditional buffer selection modules and demonstrates consistent performance gains over state‑of‑the‑art strategies, especially in low‑memory settings. Experiments on CIFAR‑100 and TinyImageNet show that MERS outperforms single‑embedding baselines without adding model parameters or increasing replay volume, making it a practical, drop‑in enhancement for replay‑based continual learning.

By Danit Yanowsky, Daphna Weinshall
arXiv Machine Learning
Aug 31

Class Incremental Continual Learning with Self-Organizing Maps and Synthetic Replay

The paper presents a generative continual learning framework that extends self‑organizing maps (SOMs) with learned distributional statistics and encoder–decoder models for class‑incremental learning. By storing running means, variances, and covariances for each SOM unit, the method can generate synthetic samples for replay without storing raw data, enabling exemplar‑free learning. Experiments on CIFAR‑10, CIFAR‑100, and TinyImageNet show competitive or superior performance compared to state‑of‑the‑art memory‑based and memory‑free methods, and the approach also allows easy visualization and post‑training generative use.

By Pujan Thapa, Alexander Ororbia, Travis Desell
arXiv AI
Aug 20

Forgetting, plasticity, and co-observation: a third facet of continual learning

The paper argues that catastrophic forgetting and loss of plasticity alone cannot explain why naive sequential training underperforms offline joint training. It introduces data co-observation as a third factor, showing that observing training data together consistently improves performance across supervised and self-supervised settings. The study also reinterprets common continual learning methods, suggesting that memory replay’s success stems from restoring co-observation benefits rather than merely mitigating forgetting.

By Timm Hess, Abhishek Jha, Gido M. van de Ven, Tinne Tuytelaars
arXiv Computer Vision
Aug 28

Parameter Efficient Continual Learning for Sparse Event-Based Transformers

The paper introduces sLoTh, a parameter‑efficient continual learning framework for sparse event‑based vision transformers. sLoTh freezes the backbone and limits plasticity to low‑rank attention updates (seLoRA) and shared neuronal threshold modulation, updating less than 1% of parameters without replay buffers. Experiments on CIFAR‑100, Tiny‑ImageNet, ImageNet‑100, and ImageNet‑R show competitive rehearsal‑free performance across up to 100 tasks while achieving roughly 6.5× lower energy consumption than dense vision transformers.

By Vaishnavi Nagabhushana, Kartikay Agrawal, Ayon Borthakur
Hugging Face Trending Papers
Aug 27

Parameter Efficient Continual Learning for Sparse Event-Based Transformers

The paper introduces sLoTh, a parameter‑efficient continual learning framework for sparse event‑based vision transformers. By freezing the backbone and limiting plasticity to low‑rank attention updates (seLoRA) and shared neuronal threshold modulation, sLoTh adapts to new tasks while updating less than 1% of the parameters and avoiding replay buffers. Experiments on CIFAR‑100, Tiny‑ImageNet, ImageNet‑100, and ImageNet‑R show competitive rehearsal‑free performance across up to 100 tasks and achieve roughly 6.5× lower energy consumption than dense vision transformers.