Logits Replay + MoClip: Stabilized, Low-Cost Post-Training with Minimal Forgetting
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) often face a trade-off in post-training: improvements on specialized domains frequently come at the expense of general capabilities. Existing solutions attempt to mitigate this tension via regularization, selective parameter updates, or data-centric replay, but each imposes significant costs in computation, data access, or adaptability. Recent work has shown that training signals can be compressed to subsets of logits without severe accuracy loss, suggesting a path toward efficient adaptation. However, naive truncation destabilizes optimization and exacerbates forgetting. We introduce Logits Replay + MoClip, a two-stage framework that compresses supervision in the logit space and stabilizes optimization at the update level. In Stage 0, we record dynamic Top-K token subsets that cover a probability threshold, always including the gold label. In Stage 1, we replay these compact subsets to compute exact renormalized losses, avoiding full softmax computation and implicitly regularizing. To ensure stability, we design MoClip, an optimizer that caps gradient-momentum rotation and applies an arctan2-based rescaling of updates. Empirically, our method improves domain performance on Communication Technology (CT) and NL2SQL tasks while mitigating forgetting on general benchmarks (MMLU, BBH, GPQA, MATH), and reduces training cost by over 40%. Together, these contributions offer a scalable, architecture-agnostic path for domain adaptation of LLMs without sacrificing generalization.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 34 references that are in the map. First posted on arXiv 10 Oct 2025.
Builds on
27 of 34 references.
References · 27
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2016Learning without Forgettingcited by 2,465
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2017Continual Learning with Deep Generative Replaycited by 1,152
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
- 2017Measuring Catastrophic Forgetting in Neural Networkscited by 359
- 2023Orthogonal Subspace Learning for Language Model Continual Learningcited by 296
- 2023Continual Pre-training of Language Modelscited by 194
- 2019Meta-Learning Representations for Continual Learningcited by 189
15 more
- 2023Mitigating the Alignment Tax of RLHFcited by 181
- 2020Recall and Learn: Fine-tuning Deep Pretrained Language Models with Less Forgettingcited by 169
- 2024Continual Learning for Large Language Models: A Surveycited by 144
- 2024Mitigating Catastrophic Forgetting in Large Language Models with Self-Synthesized Rehearsalcited by 114
- 2024Revisiting Catastrophic Forgetting in Large Language Model Tuningcited by 93
- 2021MoCL: Data-driven Molecular Fingerprint via Knowledge-aware Contrastive Learning from Molecular Graphcited by 65
- 2020CPR: Classifier-Projection Regularization for Continual Learningcited by 62
- 2025Spurious Forgetting in Continual Learning of Language Modelscited by 47
- 2024Rehearsal-Free Modular and Compositional Continual Learning for Language Modelscited by 26
- 2024HFT: Half Fine-Tuning for Large Language Modelscited by 18
- 2024MoFO: Momentum-Filtered Optimizer for Mitigating Forgetting in LLM Fine-Tuningcited by 13
- 2025How to Alleviate Catastrophic Forgetting in LLMs Finetuning? Hierarchical Layer-Wise and Element-Wise Regularizationcited by 13
- 2025Parameter-Efficient Continual Fine-Tuning: A Surveycited by 11
- 2025Mixture-of-Retrieval Experts for Reasoning-Guided Multimodal Knowledge Exploitationcited by 6
- 2025Full-Parameter Continual Pretraining of Gemma2: Insights into Fluency and Domain Knowledgecited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.