Pith. sign in

REVIEW 12 cited by

Scaling Laws for Forgetting When Fine-Tuning Large Language Models

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 2401.05605 v1 pith:TT3DJBMZ submitted 2024-01-11 cs.CL cs.LG

Scaling Laws for Forgetting When Fine-Tuning Large Language Models

classification cs.CL cs.LG
keywords forgettingfine-tuningnumberwhenfine-tunedlanguagelargelaws
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We study and quantify the problem of forgetting when fine-tuning pre-trained large language models (LLMs) on a downstream task. We find that parameter-efficient fine-tuning (PEFT) strategies, such as Low-Rank Adapters (LoRA), still suffer from catastrophic forgetting. In particular, we identify a strong inverse linear relationship between the fine-tuning performance and the amount of forgetting when fine-tuning LLMs with LoRA. We further obtain precise scaling laws that show forgetting increases as a shifted power law in the number of parameters fine-tuned and the number of update steps. We also examine the impact of forgetting on knowledge, reasoning, and the safety guardrails trained into Llama 2 7B chat. Our study suggests that forgetting cannot be avoided through early stopping or by varying the number of parameters fine-tuned. We believe this opens up an important safety-critical direction for future research to evaluate and develop fine-tuning schemes which mitigate forgetting

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 12 Pith papers

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

  1. The Intruder Threshold: A Spectral Law for LoRA Fine-Tuning

    cs.LG 2026-07 accept novelty 7.0

    A parameter-free per-layer critical LoRA strength from the rectangular spiked-deformation transform on the measured spectrum of W predicts intruder onset and forgetting, and a derived spike budget cuts forgetting 62% ...

  2. Learning, Fast and Slow: Towards LLMs That Adapt Continually

    cs.LG 2026-05 unverdicted novelty 7.0

    Fast-Slow Training uses context optimization as fast weights alongside parameter updates as slow weights to achieve up to 3x better sample efficiency, higher performance, and less catastrophic forgetting than standard...

  3. MemSFT: Mitigating Alignment Tax with an External Parametric Memory

    cs.LG 2026-07 conditional novelty 6.0

    MemSFT attaches a retriever-imitating 8B memory plus a word-level router to frozen Qwen3 backbones, boosting domain scores by ~36 points while holding general-benchmark averages essentially flat, where full SFT loses ...

  4. Learning, Fast and Slow: Towards LLMs That Adapt Continually

    cs.LG 2026-05 unverdicted novelty 6.0

    Fast-Slow Training combines slow parameter updates with fast context optimization to achieve up to 3x better sample efficiency, higher performance, less forgetting, and preserved plasticity in continual LLM learning.

  5. PLATE: Plasticity-Tunable Efficient Adapters for Geometry-Aware Continual Learning

    cs.LG 2026-02 conditional novelty 6.0

    PLATE constructs frozen weight-derived bases B and Q and trains only a small core A, reducing catastrophic forgetting during data-free continual fine-tuning.

  6. Routing-Based Continual Learning for Multimodal Large Language Models

    cs.LG 2025-11 unverdicted novelty 6.0

    Routing architecture for MLLMs enables continual learning with constant compute, matching multi-task learning performance and supporting cross-modal transfer.

  7. One Student, Many Teachers: Multi-Task On-Policy Distillation via Soft-Prompt Privileged Context

    cs.LG 2026-06 conditional novelty 5.0

    Soft-prompt teachers, each a small set of learnable tokens on a frozen backbone, can replace full fine-tuning as on-policy distillation supervisors and compose across tasks into a single student.

  8. ECA: Efficient Continual Alignment for Open-Ended Image-to-Text Generation

    cs.CV 2026-06 unverdicted novelty 5.0

    ECA introduces continual alignment with MoQ, FeDEx, and DR for exemplar-free incremental learning in open-ended image-to-text generation, evaluated on four new benchmarks showing reduced forgetting.

  9. The Future of Facts: Tracing the Factual Generation-Verification Gap

    cs.CL 2026-05 unverdicted novelty 5.0

    Empirical tracing across model families shows verification precedes and outlasts generation for facts, with updates producing simultaneous verification of old and new answers.

  10. Fine-Tuning Without Forgetting via Loss-Adaptive Learning Rates

    cs.LG 2026-05 unverdicted novelty 5.0

    FINCH is a loss-adaptive learning-rate schedule that reduces forgetting by 93% on average during LLM fine-tuning while matching standard task performance across several benchmarks.

  11. Can Muon Fine-tune Adam-Pretrained Models?

    cs.LG 2026-05 unverdicted novelty 4.0

    Constraining fine-tuning updates with LoRA mitigates performance degradation when switching from Adam to Muon on pretrained models.

  12. Teaching LLMs Brazilian Healthcare: Injecting Knowledge from Official Clinical Guidelines

    cs.CL 2026-05 unverdicted novelty 4.0

    A 14B model trained on synthetic data from Brazilian clinical guidelines outperforms larger LLMs on new benchmarks for Brazilian healthcare protocols.