Doubly Perturbed Task Free Continual Learning
Not on the map. Why?
Abstract (arXiv)
Task Free online continual learning (TF-CL) is a challenging problem where the model incrementally learns tasks without explicit task information. Although training with entire data from the past, present as well as future is considered as the gold standard, naive approaches in TF-CL with the current samples may be conflicted with learning with samples in the future, leading to catastrophic forgetting and poor plasticity. Thus, a proactive consideration of an unseen future sample in TF-CL becomes imperative. Motivated by this intuition, we propose a novel TF-CL framework considering future samples and show that injecting adversarial perturbations on both input data and decision-making is effective. Then, we propose a novel method named Doubly Perturbed Continual Learning (DPCL) to efficiently implement these input and decision-making perturbations. Specifically, for input perturbation, we propose an approximate perturbation method that injects noise into the input data as well as the feature vector and then interpolates the two perturbed samples. For decision-making process perturbation, we devise multiple stochastic classifiers. We also investigate a memory management scheme and learning rate scheduling reflecting our proposed double perturbations. We demonstrate that our proposed method outperforms the state-of-the-art baseline methods by large margins on various TF-CL benchmarks.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 49 of its 63 references that are in the map. First posted on arXiv 20 Dec 2023.
Builds on
49 of 63 references.
References · 49
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2018Experience Replay for Continual Learningcited by 1,095
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
37 more
- 2018Efficient Lifelong Learning with A-GEMcited by 1,058
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 742
- 2019Large Scale Incremental Learningcited by 732
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 694
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
- 2019Three scenarios for continual learningcited by 614
- 2017Exploring Generalization in Deep Learningcited by 600
- 2019Gradient based sample selection for online continual learningcited by 571
- 2019A Simple Baseline for Bayesian Uncertainty in Deep Learningcited by 560
- 2020Bayesian Deep Learning and a Probabilistic Perspective of Generalizationcited by 480
- 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 434
- 2019Online Continual Learning with Maximally Interfered Retrievalcited by 379
- 2021Rainbow Memory: Continual Learning with a Memory of Diverse Samplescited by 273
- 2017Improving the Adversarial Robustness and Interpretability of Deep Neural Networks by Regularizing their Input Gradientscited by 236
- 2018Task-Free Continual Learningcited by 221
- 2017Incremental Learning of Object Detectors without Catastrophic Forgettingcited by 208
- 2019Compacting, Picking and Growing for Unforgetting Continual Learningcited by 207
- 2018Robustness via curvature regularization, and vice versacited by 175
- 2020Using Hindsight to Anchor Past Knowledge in Continual Learningcited by 161
- 2019Adversarial Robustness through Local Linearizationcited by 146
- 2019Scalable and Order-robust Continual Learning with Additive Parameter Decompositioncited by 125
- 2020Continual Learning with Node-Importance based Adaptive Group Sparse Regularizationcited by 105
- 2021AFEC: Active Forgetting of Negative Transfer in Continual Learningcited by 73
- 2021Flattening Sharpness for Dynamic Gradient Projection Memory Benefits Continual Learningcited by 72
- 2021Online Continual Learning on Class Incremental Blurry Task Configuration with Anytime Inferencecited by 67
- 2020CPR: Classifier-Projection Regularization for Continual Learningcited by 62
- 2020Gradient-based Editing of Memory Examples for Online Task-free Continual Learningcited by 62
- 2022Beyond Not-Forgetting: Continual Learning with Backward Knowledge Transfercited by 59
- 2019Task Agnostic Continual Learning via Meta Learningcited by 53
- 2015A Unified Gradient Regularization Family for Adversarial Examplescited by 43
- 2022A simple but strong baseline for online continual learning: Repeated Augmented Rehearsalcited by 32
- 2022Improving Task-free Continual Learning by Distributionally Robust Memory Evolutioncited by 31
- 2021Formalizing the Generalization-Forgetting Trade-off in Continual Learningcited by 24
- 2022Task-Free Continual Learning via Online Discrepancy Distance Learningcited by 22
- 2023New Insights for the Stability-Plasticity Dilemma in Online Continual Learningcited by 16
Built on by
Citing papers per year: 2025: 5.
5 papers.
- 2025Localized Concept Erasure for Text-to-Image Diffusion Models Using Training-Free Gated Low-Rank Adaptationcited by 33
- 2025Concept Pinpoint Eraser for Text-to-image Diffusion Models via Residual Attention Gatecited by 16
- 2025STAR: Stability-Inducing Weight Perturbation for Continual Learningcited by 8
- 2025Continual Multiple Instance Learning with Enhanced Localization for Histopathological Whole Slide Image Analysiscited by 2
- 2025Continual Learning with Support Boundary Experience Blendingcited by 0
- 2025Continual Learning with Support Boundary Experience Blending31 Jul 2025
- 2025Continual Multiple Instance Learning with Enhanced Localization for Histopathological Whole Slide Image Analysis3 Jul 2025
- 2025Concept Pinpoint Eraser for Text-to-image Diffusion Models via Residual Attention Gate28 Jun 2025
- 2025Localized Concept Erasure for Text-to-Image Diffusion Models Using Training-Free Gated Low-Rank Adaptation16 Mar 2025
- 2025STAR: Stability-Inducing Weight Perturbation for Continual Learning3 Mar 2025