PROL : Rehearsal Free Continual Learning in Streaming Data via Prompt Online Learning

M. Anwar Ma'sum, Mahardhika Pratama, Savitha Ramasamy, Lin Liu, Habibullah Habibullah +1 more
7/16/2025
cs.LGcs.AIcs.CV

Official code: anwarmaxsum/PROL (0 stars, MIT, last commit 2026-03-03).

Abstract

The data privacy constraint in online continual learning (OCL), where the data can be seen only once, complicates the catastrophic forgetting problem in streaming data. A common approach applied by the current SOTAs in OCL is with the use of memory saving exemplars or features from previous classes to be replayed in the current task. On the other hand, the prompt-based approach performs excellently in continual learning but with the cost of a growing number of trainable parameters. The first approach may not be applicable in practice due to data openness policy, while the second approach has the issue of throughput associated with the streaming data. In this study, we propose a novel prompt-based method for online continual learning that includes 4 main components: (1) single light-weight prompt generator as a general knowledge, (2) trainable scaler-and-shifter as specific knowledge, (3) pre-trained model (PTM) generalization preserving, and (4) hard-soft updates mechanism. Our proposed method achieves significantly higher performance than the current SOTAs in CIFAR100, ImageNet-R, ImageNet-A, and CUB dataset. Our complexity analysis shows that our method requires a relatively smaller number of parameters and achieves moderate training time, inference time, and throughput. For further study, the source code of our method is available at https://github.com/anwarmaxsum/PROL.

View on arXivView PDF

Code Implementations(1)

anwarmaxsum/PROLOfficial100%
MIT
00PythonMay 16, 20257 months agoMIT

Similar Papers

Cite this paper

@article{masum2025prol,
  title  = {PROL : Rehearsal Free Continual Learning in Streaming Data via Prompt Online Learning},
  author = {M. Anwar Ma'sum and Mahardhika Pratama and Savitha Ramasamy and Lin Liu and Habibullah Habibullah and Ryszard Kowalczyk},
  year   = {2025},
  eprint = {2507.12305},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.12305v1}
}

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

Discussion