Salient Frequency-aware Exemplar Compression for Resource-constrained Online Continual Learning
Junsu Kim, Suhyun Kim
Abstract
Online Class-Incremental Learning (OCIL) enables a model to learn new classes from a data stream. Since data stream samples are seen only once and the capacity of storage is constrained, OCIL is particularly susceptible to Catastrophic Forgetting (CF). While exemplar replay methods alleviate CF by storing representative samples, the limited capacity of the buffer inhibits capturing the entire old data distribution, leading to CF. In this regard, recent papers suggest image compression for better memory usage. However, existing methods raise two concerns: computational overhead and compression defects. On one hand, computational overhead can limit their applicability in OCIL settings, as models might miss learning opportunities from the current streaming data if computational resources are budgeted and preoccupied with compression. On the other hand, typical compression schemes demanding low computational overhead, such as JPEG, introduce noise detrimental to training. To address these issues, we propose Salient Frequency-aware Exemplar Compression (SFEC), an efficient and effective JPEG-based compression framework. SFEC exploits saliency information in the frequency domain to reduce negative impacts from compression artifacts for learning. Moreover, SFEC employs weighted sampling for exemplar elimination based on the distance between raw and compressed data to mitigate artifacts further. Our experiments employing the baseline OCIL method on benchmark datasets such as CIFAR-100 and Mini-ImageNet demonstrate the superiority of SFEC over previous exemplar compression methods in streaming scenarios.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 68e6d0d1-dfd6-4186-9f05-1a9b074098b3Cited by top-tier papers1
Ask how each one uses itBuilds on17
- Dark Experience for General Continual Learning: a Strong, Simple BaselinePietro Buzzega, Matteo Boschini, Angelo Porrello, Davide Abati et al.NeurIPS 2020 · 1,494 citations
- New Insights on Reducing Abrupt Representation Change in Online Continual LearningLucas Caccia, Rahaf Aljundi, Nader Asadi, Tinne Tuytelaars et al.ICLR 2022 · 279 citations
- SS-IL: Separated Softmax for Incremental LearningHongjoon Ahn, Jihwan Kwak, Subin Lim, Hyeonsu Bang et al.ICCV 2021 · 209 citations
- Online Continual Learning through Mutual Information MaximizationYiduo Guo, Bing Liu, Dongyan ZhaoICML 2022 · 139 citations
- Amplitude-Phase Recombination: Rethinking Robustness of Convolutional Neural Networks in Frequency DomainGuangyao Chen, Peixi Peng, Li Ma, Jia Li et al.ICCV 2021 · 132 citations
Related papers
- Tensor Decomposition Based Memory-Efficient Incremental LearningYuhang Li, Guoxu Zhou, Zhenhao Huang, Xinqi Chen et al.ICML 2025
- F-OAL: Forward-only Online Analytic Learning with Fast Training and Low Memory Footprint in Class Incremental LearningHuiping Zhuang, Yuchen Liu, Run He, Kai Tong et al.NeurIPS 2024 · 17 citations
- Autoencoder-Based Hybrid Replay for Class-Incremental LearningMilad Khademi Nori, Il-Min Kim, Guanghui WangICML 2025
- Summarizing Stream Data for Memory-Constrained Online Continual LearningJianyang Gu, Kai Wang, Wei Jiang, Yang YouAAAI 2024 · 30 citations
- Task-Adaptive Saliency Guidance for Exemplar-Free Class Incremental LearningXialei Liu, Jiang-Tian Zhai, Andrew D. Bagdanov, Ke Li et al.CVPR 2024 · 4 citations
