mlsanityData to 14 Oct 2026

Doubly Perturbed Task Free Continual Learning

arXiv 2312.13027 ↗First posted 20 Dec 2023cs.LG cs.CVcited by 5

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

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  4. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  5. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
  6. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  7. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  8. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
  9. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
  10. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  11. 2018Experience Replay for Continual Learningcited by 1,095
  12. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
37 more
  1. 2018Efficient Lifelong Learning with A-GEMcited by 1,058
  2. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
  3. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
  4. 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 742
  5. 2019Large Scale Incremental Learningcited by 732
  6. 2017Lifelong Learning with Dynamically Expandable Networkscited by 694
  7. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
  8. 2019Three scenarios for continual learningcited by 614
  9. 2017Exploring Generalization in Deep Learningcited by 600
  10. 2019Gradient based sample selection for online continual learningcited by 571
  11. 2019A Simple Baseline for Bayesian Uncertainty in Deep Learningcited by 560
  12. 2020Bayesian Deep Learning and a Probabilistic Perspective of Generalizationcited by 480
  13. 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 434
  14. 2019Online Continual Learning with Maximally Interfered Retrievalcited by 379
  15. 2021Rainbow Memory: Continual Learning with a Memory of Diverse Samplescited by 273
  16. 2017Improving the Adversarial Robustness and Interpretability of Deep Neural Networks by Regularizing their Input Gradientscited by 236
  17. 2018Task-Free Continual Learningcited by 221
  18. 2017Incremental Learning of Object Detectors without Catastrophic Forgettingcited by 208
  19. 2019Compacting, Picking and Growing for Unforgetting Continual Learningcited by 207
  20. 2018Robustness via curvature regularization, and vice versacited by 175
  21. 2020Using Hindsight to Anchor Past Knowledge in Continual Learningcited by 161
  22. 2019Adversarial Robustness through Local Linearizationcited by 146
  23. 2019Scalable and Order-robust Continual Learning with Additive Parameter Decompositioncited by 125
  24. 2020Continual Learning with Node-Importance based Adaptive Group Sparse Regularizationcited by 105
  25. 2021AFEC: Active Forgetting of Negative Transfer in Continual Learningcited by 73
  26. 2021Flattening Sharpness for Dynamic Gradient Projection Memory Benefits Continual Learningcited by 72
  27. 2021Online Continual Learning on Class Incremental Blurry Task Configuration with Anytime Inferencecited by 67
  28. 2020CPR: Classifier-Projection Regularization for Continual Learningcited by 62
  29. 2020Gradient-based Editing of Memory Examples for Online Task-free Continual Learningcited by 62
  30. 2022Beyond Not-Forgetting: Continual Learning with Backward Knowledge Transfercited by 59
  31. 2019Task Agnostic Continual Learning via Meta Learningcited by 53
  32. 2015A Unified Gradient Regularization Family for Adversarial Examplescited by 43
  33. 2022A simple but strong baseline for online continual learning: Repeated Augmented Rehearsalcited by 32
  34. 2022Improving Task-free Continual Learning by Distributionally Robust Memory Evolutioncited by 31
  35. 2021Formalizing the Generalization-Forgetting Trade-off in Continual Learningcited by 24
  36. 2022Task-Free Continual Learning via Online Discrepancy Distance Learningcited by 22
  37. 2023New Insights for the Stability-Plasticity Dilemma in Online Continual Learningcited by 16

Built on by

Cited by year

Citing papers per year: 2025: 5.

5 papers.