Beyond Static Models: An Evolving Framework for Continual Learning in Large Language Models across Training Stages
Organizations: Zhejiang Lab, Hangzhou 311100, China
Abstract
Continual learning (CL) has emerged as a pivotal paradigm to enable large language models (LLMs) to dynamically adapt to evolving knowledge and sequential tasks while mitigating catastrophic forgetting, a critical limitation of the static pre-training paradigm inherent to modern LLMs. This paper presents a comprehensive overview of CL methodologies tailored for LLMs, structured around three core training stages: continual pre-training, continual fine-tuning, and continual alignment. Beyond the canonical taxonomy of rehearsal-, regularization-, and architecture-based methods, we further subdivide each category by its distinct forgetting mitigation mechanisms and conduct a rigorous comparative analysis of the adaptability and critical improvements of traditional CL methods for LLMs. In doing so, we explicitly highlight core distinctions between LLM CL and traditional machine learning, particularly with respect to scale, parameter efficiency, and emergent capabilities. Our analysis covers essential evaluation metrics, including forgetting rates and knowledge transfer efficiency, along with emerging benchmarks for assessing CL performance. While current methods show promising results, fundamental challenges persist in achieving seamless knowledge integration, and we identify key open problems and future directions for the field.
Figures & tables
| Paradigm | Storage | Training | Inference | Main Advantage |
| Rehearsal | High (buffers or stored samples) | Medium (joint replay updates) | No extra latency | Most direct mitigation of forgetting; strong fusion potential [ 70 , 22 ] |
| Regularization | Low (masks or importance statistics) | Medium (constraint-based updates) | No extra latency | Stable parameter budget; works without stored data [ 45 , 46 ] |
| Architecture-based | Medium (growing task-specific modules) | Low (module-focused updates) | Small extra latency | Strong isolation; near-zero forgetting potential; best suited for fine-tuning scale [ 78 , 40 ] |
| Hybrid (MoE/PEFT) | Medium (experts, adapters, or routing) | Low (sparse PEFT-style updates) | Adaptive (router-dependent) | Scalable LLM adaptation; high flexibility via sparse activation [ 51 , 105 ] |
| Paper | Rehearsal | Data augmentation | Process optimization | Architecture-based | Base model |
| Fujii et al. [22] | ✓ | ✗ | ✗ | ✗ | LLaMA2 |
| Cui et al. [13] | ✓ | ✗ | ✗ | ✗ | LLaMA-2 7B/13B |
| Que et al. [64] | ✓ | ✗ | ✗ | ✗ | Qwen-1.5 |
| Zheng et al. [104] | ✓ | ✗ | ✗ | ✗ | LLaMA2 |
| Gu et al. [23] | ✓ | ✗ | ✗ | ✗ | LLaMA architecture |
| Xi et al. [91] | ✓ | ✗ | ✗ | ✗ | LLaMA-3 8B/70B |
| Paper | Rehearsal | Regularization-based | Architecture-based | Base model |
| Scialom et al. [70] | ✓ | ✗ | ✗ | T0 |
| Mok et al. [59] | ✓ | ✓ | ✗ | BART |
| Zhao et al. [102] | ✓ | ✗ | ✓ | T5, LLaMA-2 |
| Wang et al. [78] | ✗ | ✗ | ✓ | T5-large |
| Razdaibiedina et al. [67] | ✗ | ✗ | ✓ | T5, BERT |
| Wang et al. [84] | ✗ | ✗ | ✓ | BERT |
| Method | Long Sequence Benchmark | SuperNatural Instructions | Average | |||||||
| Order 1 | Order 2 | Order 3 | Order 4 | AP↑ | F.Ra↓ | |||||
| AP↑ | F.Ra↓ | AP↑ | F.Ra↓ | AP↑ | F.Ra↓ | AP↑ | F.Ra↓ | |||
| SeqLoRA | 34.48 | 44.92 | 55.79 | 19.84 | 7.30 | 47.60 | 7.03 | 47.97 | 26.15 | 40.08 |
| IncLoRA | 37.79 | 40.91 | 58.00 | 15.60 | 12.33 | 41.93 | 16.65 | 36.56 | 31.19 | 33.75 |
| LFPT5 | 66.62 | 14.57 | 67.40 | 13.20 | 39.03 | 10.87 | 29.70 | 20.72 | 50.69 | 14.84 |
| EWC | 43.24 | 23.66 | 46.25 | 32.90 | 15.32 | 26.78 | 18.19 | 30.28 | 30.75 | 28.41 |
| Method | Type | Base Model | Mechanism | Key Idea |
| COPR [ 96 ] | RL-free | DPO-based | C | Regularizes current preference learning with optimal-policy targets from prior stages |
| LEMoE [ 77 ] | RL-free | MoE-based | I | Expert routing with consistency constraints to isolate preference-specific modules |
| BaFT [ 57 ] | RL-free | LLM | I | Input-conditioned module composition with expert freezing for selective alignment editing |
| CPPO [ 97 ] | RL (PPO) | PPO-based | C | Extends PPO with retention-aware weighting to balance policy improvement and stability |
| LifeAlign [ 54 ] | RL (PPO) | LLM | F | Memory-augmented focalized preference optimization; consolidates preference traces over time |
| LANCET [ 98 ] | RL-free | LLM | C | Traces undesirable behaviors to influential training data and applies targeted corrections |
| Benchmark | Stage | # Tasks | Domain | Forgetting metric | Notes | Open-ended |
| MMLU + GSM8K | CPT | 2+ | General/Math | AP, F.Ra | Widely used as CPT retention gauges | No |
| TRACE [ 79 ] | CFT | 8 | Multi-domain | AP, F.Ra | Covers code, math, multilingual, domain tasks | Yes |
| CITB / InstrDialog++ [ 100 ] | CFT | 16 | Instructions | AP, F.Ra, BWT | Rich natural-language instruction stream | Yes |
| FUAR [ 34 ] | CFT | 3 | Knowledge | FUAR metric | Evaluates retention, update, and acquisition | No |
| Prog. Prompts (15-task) [ 67 ] | CFT | 15 | Text classif. | AP, F.Ra, BWT, FWT | Long sequence; widely adopted for comparison | No |
| StreamBench [ 87 ] | CFT/Agent | Stream | Multi-task | Improvement rate | Focuses on in-context online improvement | Yes |
| Collision mitigation | Isolation | Fusion | |
| Cont. pre-training | Data augmentation [ 25 , 92 ] ; process optimization [ 36 ] (C) | Adapter plugins [ 40 ] ; DGA/DAS [ 44 ] ; LLaMA-MoE [ 105 ] (I) | Rehearsal data mixing [ 22 , 13 , 64 ] (F) |
| Cont. fine-tuning | Regularization inside LoRA adapters [ 78 ] (C) | O-LoRA [ 78 ] ; Progressive Prompts [ 67 ] ; L2R [ 4 ] (I) | SAPT shared attention [ 102 ] ; InsCL replay [ 80 ] ; SSR [ 33 ] (F) |
| Cont. alignment | COPR [ 96 ] ; CPPO [ 97 ] ; LANCET [ 98 ] (C) | LEMoE [ 77 ] ; BaFT [ 57 ] (I) | LifeAlign memory consolidation [ 54 ] (F); — |
Continual Learning for LLMs
Continual learning for large language models studies how models absorb new knowledge and skills while retaining previously learned capabilities.
See all 231 papers