mlsanityData to 14 Oct 2026

A Retention-Centric Framework for Continual Learning with Guaranteed Model Developmental Safety

arXiv 2410.03955 ↗First posted 4 Oct 2024cs.LG cs.AI math.OCcited by 4

Not on the map. Why?

Abstract (arXiv)

In real-world applications, learning-enabled systems often undergo iterative model development to address challenging or emerging tasks, which involve collecting new data, training a new model and validating the model. This continual model development process raises a significant issue that acquiring new or improving existing capabilities may inadvertently lose good capabilities of the old model, also known as catastrophic forgetting. While existing continual learning aims to mitigate catastrophic forgetting by trading off performance on previous tasks and new tasks to ensure good average performance, it often falls short in cost-sensitive applications, where failing to preserve essential established capabilities introduces unforeseen costs and risks and substantial expenses for re-improving these capabilities. To address this issue, we impose a requirement on learning systems to ensure that a new model strictly retains important capabilities of the old model while improving target-task performance, which we term model developmental safety. To ensure model developmental safety, we propose a retention-centric framework with data-dependent constraints, and study how to continually develop a pretrained CLIP model for acquiring new or improving existing capabilities of image classification. We propose an efficient constrained optimization algorithm with theoretical guarantees and use its insights to finetune the CLIP model with task-dependent heads for promoting the model developmental safety. Experiments on autonomous driving and scene recognition datasets validate the efficacy of our method.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 61 of its 86 references that are in the map. First posted on arXiv 4 Oct 2024.

Builds on

61 of 86 references.

References · 61

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  3. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  4. 2022Large Language Models are Zero-Shot Reasonerscited by 4,374
  5. 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,592
  6. 2022Emergent Abilities of Large Language Modelscited by 2,512
  7. 2016Learning without Forgettingcited by 2,496
  8. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  9. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  10. 2016Concrete Problems in AI Safetycited by 1,642
  11. 2021LAION-400M: Open Dataset of CLIP-Filtered 400 Million Image-Text Pairscited by 1,555
  12. 2016Progressive Neural Networkscited by 1,361
38 more
  1. 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,330
  2. 2017Continual Learning with Deep Generative Replaycited by 1,158
  3. 2018Experience Replay for Continual Learningcited by 1,095
  4. 2018Efficient Lifelong Learning with A-GEMcited by 1,058
  5. 2017Constrained Policy Optimizationcited by 983
  6. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
  7. 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
  8. 2018End-to-End Incremental Learningcited by 597
  9. 2018A Reductions Approach to Fair Classificationcited by 587
  10. 2023DecodingTrust: A Comprehensive Assessment of Trustworthiness in GPT Modelscited by 518
  11. 2018Reward Constrained Policy Optimizationcited by 417
  12. 2019Orthogonal Gradient Descent for Continual Learningcited by 369
  13. 2016Safe, Multi-Agent, Reinforcement Learning for Autonomous Drivingcited by 311
  14. 2019Learn to Grow: A Continual Structure Learning Framework for Overcoming Catastrophic Forgettingcited by 302
  15. 2021Co2L: Contrastive Continual Learningcited by 244
  16. 2017Overcoming Catastrophic Forgetting by Incremental Moment Matchingcited by 243
  17. 2018Task-Free Continual Learningcited by 221
  18. 2020Recovery RL: Safe Reinforcement Learning with Learned Recovery Zonescited by 175
  19. 2022A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learningcited by 154
  20. 2019Constrained Reinforcement Learning Has Zero Duality Gapcited by 151
  21. 2022Finetune like you pretrain: Improved finetuning of zero-shot vision modelscited by 150
  22. 2020Provably Efficient Safe Exploration via Primal-Dual Policy Optimizationcited by 134
  23. 2018Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goalscited by 103
  24. 2020Safe Reinforcement Learning via Curriculum Inductioncited by 74
  25. 2017OptLayer - Practical Constrained Optimization for Deep Reinforcement Learning in the Real Worldcited by 70
  26. 2022Safe Reinforcement Learning by Imagining the Near Futurecited by 67
  27. 2024The Neglected Tails in Vision-Language Modelscited by 63
  28. 2022Enforcing Hard Constraints with Soft Barriers: Safe Reinforcement Learning in Unknown Stochastic Environmentscited by 60
  29. 2021Recent Advances of Continual Learning in Computer Vision: An Overviewcited by 55
  30. 2024A Survey of Constraint Formulations in Safe Reinforcement Learningcited by 44
  31. 2022Provable Stochastic Optimization for Global Contrastive Learning: Small Batch Does Not Harm Performancecited by 43
  32. 2021Constrained Learning with Non-Convex Lossescited by 42
  33. 2021Adversarial Robustness with Semi-Infinite Constrained Learningcited by 39
  34. 2019Stochastic First-order Methods for Convex and Nonconvex Functional Constrained Optimizationcited by 38
  35. 2021DOPE: Doubly Optimistic and Pessimistic Exploration for Safe Reinforcement Learningcited by 35
  36. 2023The Ideal Continual Learner: An Agent That Never Forgetscited by 35
  37. 2019An Inexact Augmented Lagrangian Framework for Nonconvex Optimization with Nonlinear Constraintscited by 29
  38. 2022Finite-Sum Coupled Compositional Stochastic Optimization: Theory and Applicationscited by 27

50 most cited of 61 All 61 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

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

4 papers.