mlsanityData to 7 Oct 2026

Practical Continual Forgetting for Pre-trained Vision Models

arXiv 2501.09705 ↗First posted 16 Jan 2025cs.CV cs.AI cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

For privacy and security concerns, the need to erase unwanted information from pre-trained vision models is becoming evident nowadays. In real-world scenarios, erasure requests originate at any time from both users and model owners, and these requests usually form a sequence. Therefore, under such a setting, selective information is expected to be continuously removed from a pre-trained model while maintaining the rest. We define this problem as continual forgetting and identify three key challenges. (i) For unwanted knowledge, efficient and effective deleting is crucial. (ii) For remaining knowledge, the impact brought by the forgetting procedure should be minimal. (iii) In real-world scenarios, the training samples may be scarce or partially missing during the process of forgetting. To address them, we first propose Group Sparse LoRA (GS-LoRA). Specifically, towards (i), we introduce Low-Rank Adaptation (LoRA) modules to fine-tune the Feed-Forward Network (FFN) layers in Transformer blocks for each forgetting task independently, and towards (ii), a simple group sparse regularization is adopted, enabling automatic selection of specific LoRA groups and zeroing out the others. To further extend GS-LoRA to more practical scenarios, we incorporate prototype information as additional supervision and introduce a more practical approach, GS-LoRA++. For each forgotten class, we move the logits away from its original prototype. For the remaining classes, we pull the logits closer to their respective prototypes. We conduct extensive experiments on face recognition, object detection, and image classification and demonstrate that our method manages to forget specific classes with minimal impact on other classes. Codes have been released on https://github.com/bjzhb666/GS-LoRA.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 103 of its 152 references that are in the map. First posted on arXiv 16 Jan 2025.

Builds on

103 of 152 references.

References · 103

  1. 2017Attention Is All You Needcited by 59,932
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2020Language Models are Few-Shot Learnerscited by 32,199
  4. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  5. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  6. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  7. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  8. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  9. 2023Segment Anythingcited by 8,158
  10. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  11. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
  12. 2023BLIP-2: Bootstrapping Language-Image Pre-training with Frozen Image Encoders and Large Language Modelscited by 6,069
38 more
  1. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  3. 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
  4. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  5. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  6. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  7. 2020Deformable DETR: Deformable Transformers for End-to-End Object Detectioncited by 3,410
  8. 2017Prototypical Networks for Few-shot Learningcited by 3,001
  9. 2016Learning without Forgettingcited by 2,465
  10. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
  11. 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
  12. 2016Matching Networks for One Shot Learningcited by 2,246
  13. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,221
  14. 2022Visual Prompt Tuningcited by 1,674
  15. 2022Conditional Prompt Learning for Vision-Language Modelscited by 1,427
  16. 2016Progressive Neural Networkscited by 1,332
  17. 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
  18. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
  19. 2017Continual Learning with Deep Generative Replaycited by 1,152
  20. 2017Learning to Compare: Relation Network for Few-Shot Learningcited by 1,139
  21. 2017Deep Image Priorcited by 1,097
  22. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
  23. 2018Experience Replay for Continual Learningcited by 1,074
  24. 2019Machine Unlearningcited by 1,020
  25. 2021Learning to Prompt for Continual Learningcited by 938
  26. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
  27. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  28. 2021Membership Inference Attacks From First Principlescited by 839
  29. 2019Large Scale Incremental Learningcited by 727
  30. 2021GPT Understands, Toocited by 715
  31. 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 635
  32. 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 599
  33. 2021Knowledge Neurons in Pretrained Transformerscited by 590
  34. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  35. 2018Progress & Compress: A scalable framework for continual learningcited by 516
  36. 2019Certified Data Removal from Machine Learning Modelscited by 512
  37. 2014Learning Face Representation from Scratchcited by 451
  38. 2019Making AI Forget You: Data Deletion in Machine Learningcited by 447

50 most cited of 103 All 103 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 3.

4 papers.