mlsanityData to 7 Oct 2026

Continual Learning: Forget-free Winning Subnetworks for Video Representations

arXiv 2312.11973 ↗First posted 19 Dec 2023cs.CV cs.AI cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Inspired by the Lottery Ticket Hypothesis (LTH), which highlights the existence of efficient subnetworks within larger, dense networks, a high-performing Winning Subnetwork (WSN) in terms of task performance under appropriate sparsity conditions is considered for various continual learning tasks. It leverages pre-existing weights from dense networks to achieve efficient learning in Task Incremental Learning (TIL) and Task-agnostic Incremental Learning (TaIL) scenarios. In Few-Shot Class Incremental Learning (FSCIL), a variation of WSN referred to as the Soft subnetwork (SoftNet) is designed to prevent overfitting when the data samples are scarce. Furthermore, the sparse reuse of WSN weights is considered for Video Incremental Learning (VIL). The use of Fourier Subneural Operator (FSO) within WSN is considered. It enables compact encoding of videos and identifies reusable subnetworks across varying bandwidths. We have integrated FSO into different architectural frameworks for continual learning, including VIL, TIL, and FSCIL. Our comprehensive experiments demonstrate FSO's effectiveness, significantly improving task performance at various convolutional representational levels. Specifically, FSO enhances higher-layer performance in TIL and FSCIL and lower-layer performance in VIL.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 97 of its 148 references that are in the map. First posted on arXiv 19 Dec 2023.

Builds on

97 of 148 references.

References · 97

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  4. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
  5. 2017Mask R-CNNcited by 7,259
  6. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  7. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  8. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  9. 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,806
  10. 2019DeepSDF: Learning Continuous Signed Distance Functions for Shape Representationcited by 2,682
  11. 2021Convex optimizationcited by 2,479
  12. 2016Learning without Forgettingcited by 2,465
38 more
  1. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
  2. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  3. 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,214
  4. 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
  5. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  6. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  7. 2023Align your Latents: High-Resolution Video Synthesis with Latent Diffusion Modelscited by 1,465
  8. 2016Progressive Neural Networkscited by 1,332
  9. 2016Real-Time Single Image and Video Super-Resolution Using an Efficient Sub-Pixel Convolutional Neural Networkcited by 1,199
  10. 2017Continual Learning with Deep Generative Replaycited by 1,152
  11. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  12. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  13. 2018Learning Implicit Fields for Generative Shape Modelingcited by 1,060
  14. 2018Efficient Lifelong Learning with A-GEMcited by 1,044
  15. 2021Learning to Prompt for Continual Learningcited by 938
  16. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
  17. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  18. 2014Show and Tell: A Neural Image Caption Generatorcited by 877
  19. 2019Decoupling Representation and Classifier for Long-Tailed Recognitioncited by 806
  20. 2019Large Scale Incremental Learningcited by 727
  21. 2020Neural Operator: Graph Kernel Network for Partial Differential Equationscited by 722
  22. 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
  23. 2020GRAF: Generative Radiance Fields for 3D-Aware Image Synthesiscited by 688
  24. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
  25. 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 635
  26. 2019Segmentation Transformer: Object-Contextual Representations for Semantic Segmentationcited by 573
  27. 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
  28. 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 446
  29. 2021Neural Operator: Learning Maps Between Function Spacescited by 413
  30. 2019Online Continual Learning with Maximally Interfered Retrievalcited by 376
  31. 2021DER: Dynamically Expandable Representation for Class Incremental Learningcited by 355
  32. 2021Gradient Projection Memory for Continual Learningcited by 338
  33. 2019Learn to Grow: A Continual Structure Learning Framework for Overcoming Catastrophic Forgettingcited by 302
  34. 2019On Tiny Episodic Memories in Continual Learningcited by 299
  35. 2021DyTox: Transformers for Continual Learning with DYnamic TOken eXpansioncited by 291
  36. 2021NeRV: Neural Representations for Videoscited by 255
  37. 2020Few-Shot Class-Incremental Learningcited by 249
  38. 2022S-Prompts Learning with Pre-trained Transformers: An Occam's Razor for Domain Incremental Learningcited by 246

50 most cited of 97 All 97 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 2; 2026: 1.

5 papers.