mlsanityData to 7 Oct 2026

Learning to Predict Gradients for Semi-Supervised Continual Learning

arXiv 2201.09196 ↗First posted 23 Jan 2022cs.LG cs.CVcited by 7

Not on the map. Why?

Abstract (arXiv)

A key challenge for machine intelligence is to learn new visual concepts without forgetting the previously acquired knowledge. Continual learning is aimed towards addressing this challenge. However, there is a gap between existing supervised continual learning and human-like intelligence, where human is able to learn from both labeled and unlabeled data. How unlabeled data affects learning and catastrophic forgetting in the continual learning process remains unknown. To explore these issues, we formulate a new semi-supervised continual learning method, which can be generically applied to existing continual learning models. Specifically, a novel gradient learner learns from labeled data to predict gradients on unlabeled data. Hence, the unlabeled data could fit into the supervised continual learning method. Different from conventional semi-supervised settings, we do not hypothesize that the underlying classes, which are associated to the unlabeled data, are known to the learning process. In other words, the unlabeled data could be very distinct from the labeled data. We evaluate the proposed method on mainstream continual learning, adversarial continual learning, and semi-supervised learning tasks. The proposed method achieves state-of-the-art performance on classification accuracy and backward transfer in the continual learning setting while achieving desired performance on classification accuracy in the semi-supervised learning setting. This implies that the unlabeled images can enhance the generalizability of continual learning models on the predictive ability on unseen data and significantly alleviate catastrophic forgetting. The code is available at urlhttps://github.com/luoyan407/gradprediction.git.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 53 of its 104 references that are in the map. First posted on arXiv 23 Jan 2022.

Builds on

53 of 104 references.

References · 53

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  4. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  5. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  6. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  7. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  8. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  9. 2021Convex optimizationcited by 2,479
  10. 2016Xception: Deep Learning with Depthwise Separable Convolutionscited by 2,320
  11. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
  12. 2016Matching Networks for One Shot Learningcited by 2,246
38 more
  1. 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
  2. 2017Gradient Episodic Memory for Continual Learningcited by 1,871
  3. 2013Fine-Grained Visual Classification of Aircraftcited by 1,701
  4. 2020Big Self-Supervised Models are Strong Semi-Supervised Learnerscited by 1,375
  5. 2016Progressive Neural Networkscited by 1,332
  6. 2019Self-training with Noisy Student improves ImageNet classificationcited by 1,304
  7. 2017Continual Learning with Deep Generative Replaycited by 1,152
  8. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
  9. 2018Efficient Lifelong Learning with A-GEMcited by 1,044
  10. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
  11. 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 816
  12. 2019Large Scale Incremental Learningcited by 727
  13. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
  14. 2016Learning to learn by gradient descent by gradient descentcited by 616
  15. 2019Three scenarios for continual learningcited by 610
  16. 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
  17. 2020Meta Pseudo Labelscited by 372
  18. 2017Variational Continual Learningcited by 335
  19. 2019Lookahead Optimizer: k steps forward, 1 step backcited by 333
  20. 2017How to Escape Saddle Points Efficientlycited by 284
  21. 2019Variational Adversarial Active Learningcited by 284
  22. 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 181
  23. 2020Understanding the Role of Training Regimes in Continual Learningcited by 177
  24. 2019Class-incremental Learning via Deep Model Consolidationcited by 172
  25. 2017Learning from Noisy Labels with Distillationcited by 160
  26. 2020Using Hindsight to Anchor Past Knowledge in Continual Learningcited by 160
  27. 2018Deep Co-Training for Semi-Supervised Image Recognitioncited by 145
  28. 2020Adversarial Continual Learningcited by 140
  29. 2016Decoupled Neural Interfaces using Synthetic Gradientscited by 135
  30. 2022Class-Incremental Continual Learning into the eXtended DER-versecited by 121
  31. 2019Overcoming Catastrophic Forgetting with Unlabeled Data in the Wildcited by 111
  32. 2019Dual Student: Breaking the Limits of the Teacher in Semi-supervised Learningcited by 103
  33. 2020Continual Learning in Low-rank Orthogonal Subspacescited by 99
  34. 2020Not All Unlabeled Data are Equal: Learning to Weight Data in Semi-supervised Learningcited by 53
  35. 2019Semi-Supervised Learning by Augmented Distribution Alignmentcited by 30
  36. 2017A Generic Approach for Escaping Saddle pointscited by 13
  37. 2019Generating Accurate Pseudo-labels in Semi-Supervised Learning and Avoiding Overconfident Predictions via Hermite Polynomial Activationscited by 13
  38. 2018Tangent-Normal Adversarial Regularization for Semi-supervised Learningcited by 10

50 most cited of 53 All 53 (JSON)

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 3.

7 papers.