Analysis of Overparameterization in Continual Learning under a Linear Model
원문 초록
Autonomous machine learning systems that learn many tasks in sequence are prone to the catastrophic forgetting problem. Mathematical theory is needed in order to understand the extent of forgetting during continual learning. As a foundational step towards this goal, we study continual learning and catastrophic forgetting from a theoretical perspective in the simple setting of gradient descent with no explicit algorithmic mechanism to prevent forgetting. In this setting, we analytically demonstrate that overparameterization alone can mitigate forgetting in the context of a linear regression model. We consider a two-task setting motivated by permutation tasks, and show that as the overparameterization ratio becomes sufficiently high, a model trained on both tasks in sequence results in a low-risk estimator for the first task. As part of this work, we establish a non-asymptotic bound of the risk of a single linear regression task, which may be of independent interest to the field of double descent theory.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Questioning Representational Optimism in Deep Learning: The Fractured Entangled Representation Hypothesis
LifelongPR: Lifelong knowledge fusion for point cloud place recognition based on replay and prompt learning
Rethinking Query-based Transformer for Continual Image Segmentation
Addressing Imbalanced Domain-Incremental Learning through Dual-Balance Collaborative Experts
PSAT: Pediatric Segmentation Approaches via Adult Augmentations and Transfer Learning
Remember Past, Anticipate Future: Learning Continual Multimodal Misinformation Detectors
토론
이 논문과 연결된 포럼 글이 아직 없습니다.