Sample Compression for Self Certified Continual Learning
Not on the map. Why?
Abstract (arXiv)
Continual learning algorithms aim to learn from a sequence of tasks. In order to avoid catastrophic forgetting, most existing approaches rely on heuristics and do not provide computable learning guarantees. In this paper, we introduce Continual Pick-to-Learn (CoP2L), a method grounded in sample compression theory that retains representative samples for each task in a principled and efficient way. This allows us to derive non-vacuous, numerically computable upper bounds on the generalization loss of the learned predictors after each task. We evaluate CoP2L on standard continual learning benchmarks under Class-Incremental and Task-Incremental settings, showing that it effectively mitigates catastrophic forgetting. It turns out that CoP2L is empirically competitive with baseline methods while certifying predictor reliability in continual learning with a non-vacuous bound.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 49 of its 84 references that are in the map. First posted on arXiv 13 Mar 2025.
Builds on
49 of 84 references.
References · 49
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2016Learning without Forgettingcited by 2,496
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2016Progressive Neural Networkscited by 1,361
- 2017Continual Learning with Deep Generative Replaycited by 1,158
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
- 2018Experience Replay for Continual Learningcited by 1,095
37 more
- 2018Efficient Lifelong Learning with A-GEMcited by 1,058
- 2021Learning to Prompt for Continual Learningcited by 944
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
- 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
- 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 722
- 2019Online Continual Learning with Maximally Interfered Retrievalcited by 379
- 2016Expert Gate: Lifelong Learning with a Network of Expertscited by 372
- 2019Orthogonal Gradient Descent for Continual Learningcited by 369
- 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 192
- 2023Revisiting Class-Incremental Learning with Pre-Trained Models: Generalizability and Adaptivity are All You Needcited by 184
- 2023A Unified Continual Learning Framework with General Parameter-Efficient Tuningcited by 125
- 2021Avalanche: an End-to-End Library for Continual Learningcited by 124
- 2021Online Coreset Selection for Rehearsal-based Continual Learningcited by 117
- 2024Expandable Subspace Ensemble for Pre-Trained Model-Based Class-Incremental Learningcited by 117
- 2020Tighter risk certificates for neural networkscited by 112
- 2020A Theoretical Analysis of Catastrophic Forgetting through the NTK Overlap Matrixcited by 103
- 2022How catastrophic can catastrophic forgetting be in linear regression?cited by 81
- 2023Theory on Forgetting and Generalization of Continual Learningcited by 72
- 2020Generalisation Guarantees for Continual Learning with Orthogonal Gradient Descentcited by 68
- 2021Reproducibility Report: La-MAML: Look-ahead Meta Learning for Continual Learningcited by 42
- 2023Avalanche: A PyTorch Library for Deep Continual Learningcited by 33
- 2022Analysis of Catastrophic Forgetting for Random Orthogonal Transformation Tasks in the Overparameterized Regimecited by 29
- 2017Less-forgetful Learning for Domain Expansion in Deep Neural Networkscited by 27
- 2023Compression, Generalization and Learningcited by 21
- 2023CL-MASR: A Continual Learning Benchmark for Multilingual ASRcited by 17
- 2021Provable Lifelong Learning of Representationscited by 15
- 2022Provable and Efficient Continual Representation Learningcited by 14
- 2024Contrastive Continual Learning with Importance Sampling and Prototype-Instance Relation Distillationcited by 11
- 2024Theoretical Insights into Overparameterized Models in Multi-Task and Replay-Based Continual Learningcited by 11
- 2020Batch-level Experience Replay with Review for Continual Learningcited by 10
- 2021Self-Bounding Majority Vote Learning Algorithms by the Direct Minimization of a Tight PAC-Bayesian C-Boundcited by 8
- 2022A Note on the Chernoff Bound for Random Variables in the Unit Intervalcited by 7
- 2022Navigating Memory Construction by Global Pseudo-Task Simulation for Continual Learningcited by 4
- 2024Sample Compression Unleashed: New Generalization Bounds for Real Valued Lossescited by 4
- 2018On the Perceptron's Compressioncited by 3
- 2024Data-dependent and Oracle Bounds on Forgetting in Continual Learningcited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.