Pith. sign in

REVIEW 21 cited by

Continual Learning for Large Language 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

arxiv 2402.01364 v2 pith:YVC6JH55 submitted 2024-02-02 cs.CL cs.LG

classification cs.CLcs.LG
keywords llmscontinuallearningmodelslanguagelargeadaptationalignment
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Large language models (LLMs) are not amenable to frequent re-training, due to high training costs arising from their massive scale. However, updates are necessary to endow LLMs with new skills and keep them up-to-date with rapidly evolving human knowledge. This paper surveys recent works on continual learning for LLMs. Due to the unique nature of LLMs, we catalog continue learning techniques in a novel multi-staged categorization scheme, involving continual pretraining, instruction tuning, and alignment. We contrast continual learning for LLMs with simpler adaptation methods used in smaller models, as well as with other enhancement strategies like retrieval-augmented generation and model editing. Moreover, informed by a discussion of benchmarks and evaluation, we identify several challenges and future work directions for this crucial task.

Discussion (0). Sign in to comment.

Forward citations

Cited by 21 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. MasFACT: Continual Multi-Agent Topology Learning via Geometry-Aware Posterior Transfer

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    MasFACT transfers historical topology priors across tasks via Fused Gromov-Wasserstein optimal transport and PAC-Bayes conservative adaptation to reduce topology forgetting in continual multi-agent settings.

  2. How LLM Task-Adaptation Reshapes Alignment: A Multi-dimensional Study of Behavioral and Representational Drift

    cs.AI 2026-07 conditional novelty 6.0 of 10

    Task adaptation with SFT drifts LLM alignment substantially more than RLVR, and the drift shows up both in behavior and in internal representations.

  3. ReCoLoRA: Spectrum-Aware Recursive Consolidation for Continual LLM Fine-Tuning

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Spectrum-initialized LoRA with elbow ranks and recursive SVD consolidation of the effective weight beats rank-swept PEFT baselines on three of four 7–8B models in continual GLUE fine-tuning.

  4. Preconditioned Test-Time Adaptation for Out-of-Distribution Debiasing in Narrative Generation

    cs.CL 2026-03 unverdicted novelty 6.0 of 10

    CAP-TTA triggers context-aware preconditioned LoRA updates on high bias-risk OOD prompts to reduce toxicity in LLM narrative generation while preserving fluency and avoiding catastrophic forgetting.

  5. Bisecle: Binding and Separation in Continual Learning for Video Language Understanding

    cs.CV 2025-07 conditional novelty 6.0 of 10

    Bisecle reduces catastrophic forgetting and improves accuracy in sequential VideoQA learning using multi-directional auxiliary losses and contrastive prompt regularization.

  6. Table-r1: Self-supervised and Reinforcement Learning for Program-based Table Reasoning in Small Language Models

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Table-r1 combines a layout-transformation self-supervised task and a mix-paradigm GRPO stage so 7B/8B models outperform other small-model table reasoners and approach GPT-4o-level accuracy.

  7. Is Extending Modality The Right Path Towards Omni-Modality?

    cs.CL 2025-06 conditional novelty 6.0 of 10

    Fine-tuning LLMs on extra modalities improves some knowledge tasks but degrades reasoning and instruction-following; weighted model merging preserves language ability better than training one model on all modalities.

  8. Pitfalls in Evaluating Language Model Forecasters

    cs.LG 2025-05 accept novelty 6.0 of 10

    A systematic critique showing temporal leakage and extrapolation flaws can undermine claims that LLM forecasters match or beat humans.

  9. Mitigating Plasticity Loss in Continual Reinforcement Learning by Reducing Churn

    cs.LG 2025-05 conditional novelty 6.0 of 10

    Reducing churn in continual RL via C-CHAIN prevents NTK rank collapse and substantially improves learning across four benchmark suites.

  10. Continual Learning in Transition

    cs.LG 2026-08 accept novelty 5.0 of 10

    A tri-axial framework of When, Where, and How organizes the ongoing transition of continual learning from parameter-centric updates to system-level capability evolution.

  11. A Taxonomy of Cognitive Capability Gaps in Generative and Agentic AI

    cs.AI 2026-08 conditional novelty 5.0 of 10

    The paper organizes persistent AI limitations into a five-part taxonomy of cognitive capability gaps and proposes a conceptual ACIA architecture and cognition-centric metrics, none of which are validated.

  12. SOS-LoRA: Static Orthogonal-Subspace Low-Rank Adaptation with Fixed Multi-Scale Scaling

    cs.LG 2026-06 conditional novelty 5.0 of 10

    A LoRA update split into several fixed, differently-scaled low-rank experts with orthogonal input directions improves fine-tuning accuracy at the same parameter count.

  13. Retaining by Doing: The Role of On-Policy Data in Mitigating Forgetting

    cs.LG 2025-10 conditional novelty 5.0 of 10

    RL post-training forgets less than SFT because it trains on on-policy data; refreshing SFT data each epoch also reduces forgetting.

  14. SelfAug: Mitigating Catastrophic Forgetting in Retrieval-Augmented Generation via Distribution Self-Alignment

    cs.CL 2025-09 conditional novelty 5.0 of 10

    Adding a KL penalty between fine-tuned and original model logits on input tokens during RAG fine-tuning reduces catastrophic forgetting while preserving downstream performance.

  15. Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence

    cs.LG 2025-06 conditional novelty 5.0 of 10

    CorDA++ uses data-driven SVD to initialize LoRA adapters, adding per-layer covariance selection and rank allocation that reduce forgetting and speed convergence compared to LoRA, PiSSA, QLoRA, and other baselines.

  16. A Systematic Review of Poisoning Attacks Against Large Language Models

    cs.CR 2025-06 conditional novelty 5.0 of 10

    A systematic review that organizes 65 LLM poisoning papers into a threat model with four attack specifications and generalized metrics.

  17. Continual Speech Learning with Fused Speech Features

    cs.CL 2025-06 conditional novelty 5.0 of 10

    Gated fusion of frozen Whisper layers improves continual learning on six speech tasks, with the double-stage variant best overall.

  18. Enhancing Multimodal Continual Instruction Tuning with BranchLoRA

    cs.CL 2025-05 conditional novelty 5.0 of 10

    BranchLoRA reduces catastrophic forgetting in multimodal continual instruction tuning by using a shared LoRA matrix, task-specific branches, frozen experts, and learned task keys.

  19. Continual Learning for Generative AI: From LLMs to MLLMs and Beyond

    cs.LG 2025-06 conditional novelty 4.0 of 10

    A survey that categorizes continual learning methods for generative models into architecture-based, regularization-based, and replay-based paradigms across four model families.

  20. The Future of Continual Learning in the Era of Foundation Models: Three Key Directions

    cs.LG 2025-06 conditional novelty 4.0 of 10

    Continual learning should pivot from weight-update-based methods to continual compositionality and orchestration of foundation models and agents.

  21. Continuous Self-Improvement of Large Language Models by Test-time Training with Verifier-Driven Sample Selection

    cs.CL 2025-05 reject novelty 4.0 of 10

    A test-time training method that fine-tunes LoRA adapters on verifier-selected high-confidence pseudo-labels, reporting large gains on math benchmarks, but evaluated on the same queries it adapts on.

Pith tools