REVIEW 10 cited by
Continual Learning with Pre-Trained Models: A Survey
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Nowadays, real-world applications often face streaming data, which requires the learning system to absorb new knowledge as data evolves. Continual Learning (CL) aims to achieve this goal and meanwhile overcome the catastrophic forgetting of former knowledge when learning new ones. Typical CL methods build the model from scratch to grow with incoming data. However, the advent of the pre-trained model (PTM) era has sparked immense research interest, particularly in leveraging PTMs' robust representational capabilities. This paper presents a comprehensive survey of the latest advancements in PTM-based CL. We categorize existing methodologies into three distinct groups, providing a comparative analysis of their similarities, differences, and respective advantages and disadvantages. Additionally, we offer an empirical study contrasting various state-of-the-art methods to highlight concerns regarding fairness in comparisons. The source code to reproduce these evaluations is available at: https://github.com/sun-hailong/LAMDA-PILOT
Forward citations
Cited by 10 Pith papers
-
LTLZinc: a Benchmarking Framework for Continual Learning and Neuro-Symbolic Temporal Reasoning
LTLZinc generates image-based temporal reasoning and continual learning benchmarks from LTLf formulas over MiniZinc constraints, and experiments show existing methods often fail.
-
Dynamic Mixture of Progressive Parameter-Efficient Expert Library for Lifelong Robot Learning
A lifelong robot learning method that mixes a growing library of LoRA-style experts with a context router and replays router coefficients to achieve forward transfer with near-zero forgetting.
-
Forward-Only Continual Learning
FoRo achieves strong continual learning accuracy and low forgetting on CIFAR-100, ImageNet-R, and CUB-200 using only forward updates, via CMA-ES prompt tuning and a recursive knowledge encoding matrix.
-
LifelongPR: Lifelong point cloud place recognition based on sample replay and prompt learning
LifelongPR combines information-amount-based replay selection with prompt learning to reduce catastrophic forgetting in lifelong point cloud place recognition.
-
CL-LoRA: Continual Low-Rank Adaptation for Rehearsal-Free Class-Incremental Learning
CL-LoRA adds a fixed random-orthogonal shared LoRA branch for cross-task knowledge and task-specific LoRA branches with block-wise weights, improving rehearsal-free class-incremental learning accuracy at low parameter cost.
-
Miles: Metric Learning with Expandable Subspace for Pre-Trained Model-Based Class-Incremental Learning
MILES adds per-task lightweight adapters and sub-networks to a frozen pre-trained ViT, with distance regularization, and reports top accuracy on six class-incremental benchmarks.
-
OrthoPhys: Physically Plausible Video Generation with Orthogonal-View Geometry Guidance
Generating synchronized four-view orthogonal foreground videos with geometry-enhanced attention, then using them as rigid guidance, improves physical realism in video generation over direct 2D methods.
-
Continual Speech Learning with Fused Speech Features
Gated fusion of frozen Whisper layers improves continual learning on six speech tasks, with the double-stage variant best overall.
-
SplitLoRA: Balancing Stability and Plasticity in Continual Learning Through Gradient Space Splitting
SplitLoRA picks the LoRA update subspace size from previous-task gradient singular values using a hyperparameter alpha, and freezes the projection to keep updates in that subspace.
-
Token Factory: Efficiently Integrating Diverse Signals into Large Recommendation Models
Token Factory transforms traditional signals into soft tokens for efficient integration and compression into Large Recommendation Models, avoiding prompt length explosion while enhancing performance.
Discussion (0). Continue with ORCID to comment.