Looking Back on Learned Experiences For Class/task Incremental Learning
Mozhgan PourKeshavarz, Guoying Zhao, Mohammad Sabokrou
Abstract
Classical deep neural networks are limited in their ability to learn from emerging streams of training data. When trained sequentially on new or evolving tasks, their performance degrades sharply, making them inappropriate in real-world use cases. Existing methods tackle it by either storing old data samples or only updating a parameter set of deep neural networks, which, however, demands a large memory budget or spoils the flexibility of models to learn the incremented task distribution. In this paper, we shed light on an on-call transfer set to provide past experiences whenever a new task arises in the data stream. In particular, we propose a Cost-Free Incremental Learning (CF-IL) not only to replay past experiences the model has learned but also to perform this in a cost free manner. Towards this end, we introduced a memory recovery paradigm in which we query the network to synthesize past exemplars whenever a new task emerges. Thus, our method needs no extra memory for data buffering or network growing, besides calls the proposed memory recovery paradigm to provide past exemplars, named a transfer set in order to mitigate catastrophically forgetting the former tasks in the Incremental Learning (IL) setup. Moreover, in contrast with recently proposed methods, the suggested paradigm does not desire a parallel architecture since it only relies on the learner network. Compared to the state-of-the-art data techniques without buffering past data samples, CF-IL demonstrates significantly better performance on the well-known datasets whether a task oracle is available in test time (Task-IL) or not (Class-IL).
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Cited by top-tier papers8
- Online Hyperparameter Optimization for Class-Incremental LearningYaoyao Liu, Yingying Li, Bernt Schiele, Qianru SunAAAI 2023 · 47 citations
- A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental LearningDa-Wei Zhou, Qi-Wei Wang, Han-Jia Ye, De-Chuan ZhanICLR 2023 · 46 citations
- Task-Free Continual Learning via Online Discrepancy Distance LearningFei Ye, Adrian G. BorsNeurIPS 2022 · 43 citations
- Enhancing Knowledge Transfer for Task Incremental Learning with Data-free SubnetworkQiang Gao, Xiaojun Shan, Yuchen Zhang, Fan ZhouNeurIPS 2023 · 13 citations
- Learning "O" Helps for Learning More: Handling the Unlabeled Entity Problem for Class-incremental NERRuotian Ma, Xuanting Chen, Zhang Lin, Xin Zhou et al.ACL 2023 · 12 citations
Related papers
- Always Be Dreaming: A New Approach for Data-Free Class-Incremental LearningJames Seale Smith, Yen-Chang Hsu, Jonathan C. Balloch, Yilin Shen et al.ICCV 2021 · 208 citations
- 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
- Incremental Learning in Online ScenarioJiangpeng He, Runyu Mao, Zeman Shao, Fengqing ZhuCVPR 2020
- RECALL: Replay-based Continual Learning in Semantic SegmentationAndrea Maracani, Umberto Michieli, Marco Toldo, Pietro ZanuttighICCV 2021 · 148 citations
- Class-Incremental Learning via Dual AugmentationFei Zhu, Zhen Cheng, Xu-Yao Zhang, Cheng-Lin LiuNeurIPS 2021 · 256 citations
