Temporal Adaptation and Maintenance
CL
In brief — site editorial, not from the paper
Learns a sequence of tasks over time while trying not to forget earlier ones — the central difficulty being catastrophic forgetting.
Definition
CL addresses the stability-plasticity trade-off [108, 136]: how to accumulate knowledge across sequential tasks or shifting distributions without overwriting previously learned representations. Its defining coordinate is D4 (Persistence): Bounded Cumulative, Unbounded Cumulative—a deliberate architectural commitment to knowledge accumulation rather than replacement—which is the main axis that separates CL from Retraining (, Ad-hoc Permanent, Scheduled Permanent) despite their identical D1 (Mechanism) and D3 (Data Requirements) profiles. The bounded variant corresponds to sequential acquisition over a finite, pre-enumerable task set (TIL, ); the unbounded variant corresponds to open-ended streaming adaptation over an indefinite sequence of distributions (DIL, ). This cumulative persistence coordinate is operationally consequential: the open-ended modification trajectory of Unbounded Cumulative fundamentally breaks the assumptions of discrete, periodic regression testing, because the model's behavioral state is never stable—it is continuously accumulating new representational commitments. At the LLM tier, CL encompasses three sequential stages—continued pre-training, domain-adaptive pre-training, and continual FT [178]—each carrying distinct D3 (Data Requirements) and D5 (Scope) profiles. The D5 (Scope) coordinate (Partial) reflects that production CL deployments at scale almost always apply constrained, parameter-isolated updates (adapters, selective layer freezing) rather than whole-model retraining, precisely to limit the forgetting surface. CL's cumulative persistence necessitates continuous behavioral drift monitoring rather than periodic snapshot regression testing; each task or distribution boundary must be logged as a discrete lifecycle event with its own targeted stability evaluation verifying that prior-task performance has not regressed beyond a predefined tolerance.
Verbatim from the paper — Temporal Adaptation and Maintenance
Nearest profiles
TIL (0.25), DIL (0.33), FT (partial) (0.50), SSL / CPT (0.53), Retraining (0.53)
Computed from the taxonomy data (Gower distance over all six dimensions)
References
- [108] James Kirkpatrick et al. 2017. Overcoming catastrophic forgetting in neural networks. Proceedings of the National Academy of Sciences
- [136] Michael McCloskey, and Neal J. Cohen 1989. Catastrophic Interference in Connectionist Networks: The Sequential Learning Problem. Academic Press
- [178] Haizhou Shi et al. 2025. Continual Learning of Large Language Models: A Comprehensive Survey. ACM Comput. Surv.
Numbered as in the paper
Cite this row
CL — six-dimensional profile D1: parametric-update D2: continual-adaptation D3: sequential-incremental D4: bounded-cumulative, unbounded-cumulative D5: partial D6: dl, fm, llm, mllm Source: arXiv:2608.06246Compare with another technique Find in the explorer