Sample Compression for Continual Learning
원문 초록
Continual learning algorithms aim to learn from a sequence of tasks, making the training distribution non-stationary. The majority of existing continual learning approaches in the literature rely on heuristics and do not provide learning guarantees for the continual learning setup. In this paper, we present a new method called 'Continual Pick-to-Learn' (CoP2L), which is able to retain the most representative samples for each task in an efficient way. The algorithm is adapted from the Pick-to-Learn algorithm, rooted in the sample compression theory. This allows us to provide high-confidence upper bounds on the generalization loss of the learned predictors, numerically computable after every update of the learned model. We also empirically show on several standard continual learning benchmarks that our algorithm is able to outperform standard experience replay, significantly mitigating catastrophic forgetting.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.