Skip to content

CPR for LLMs: Critical-Point Routing against Catastrophic Forgetting in Domain Adaptation

Aug 2026 · 0 citations · 33 references
Computer Science

TL;DR

This work proposes CPR (Critical-Point Routing), a token-level routing framework between a base model and its expert derivative, based on critical tokens where the base model fails but the expert succeeds, and achieves state-of-the-art across all settings.

Abstract

Supervised fine-tuning (SFT) is the de facto standard for adapting large language models (LLMs) to target domains, but it often degrades the model's general capabilities, a phenomenon known as catastrophic forgetting. Existing approaches typically modify the SFT loss to mitigate forgetting, but they inevitably operate along a domain-generality trade-off. In this work, we step outside this trade-off by decoupling the two capabilities at the model level: we keep the original base model for general capability, and selectively invoke the SFT expert only when domain-specific knowledge is required. Specifically, we propose CPR (Critical-Point Routing), a token-level routing framework between a base model and its expert derivative, based on critical tokens where the base model fails but the expert succeeds. We train a lightweight hierarchical router that estimates the expert-call probability per token, and pair it with a tailored inference procedure that combines momentum smoothing and threshold gating. Across diverse model-domain configurations, CPR achieves state-of-the-art across all settings, surpassing SFT expert by 1.4-5.5% in domain performance while recovering its general-capability drop from 3.4-14.5% to at most 0.5%, with minimal overhead from invoking the expert on only one-third of tokens.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

SFT-as-Context Mitigates Forgetting in Supervised Fine-Tuning

Supervised fine-tuning (SFT) equips large language models (LLMs) with specialized capabilities, but often comes at the cost of forgetting the general capabilities of their parent models (i.e., the pretrained models before fine-tuning). This trade-off is especially limiting for queries that require both specialized and...

Ke-Nan Tang, An-Dong Hua, Cheng-Xuan Qian et al. · 0 citations
Open access 2026

TDG-LoRA: Token-Level Dynamic Gating for Mitigating Catastrophic Forgetting

Parameter-efficient fine-tuning (PEFT), particularly Low-Rank Adaptation (LoRA), is widely used to adapt large language models (LLMs) to specialized downstream domains. However, although the pretrained backbone remains frozen, a domain-adapted LoRA branch may interfere with the model’s original representations and pred...

Shu-Shan Zhu, Shang-Qing Huang, Xing-Yuan Chen · 0 citations
#artificial intelligence Preprint Oct 2026

Where to Adapt Matters: Layer-Selective Fine-Tuning for Capability Retention

Parameter-efficient fine-tuning (PEFT) enables large language models (LLMs) to adapt to specialized tasks, but often at the cost of degrading general capabilities acquired during pretraining. Existing approaches primarily mitigate this trade-off through data replay or regularization, relying on additional data or expli...

Zhi-Qian Pang, Zi-Hong Sun, Qi Xie et al. · 0 citations
Conference Open access Sep 2026

A Survey of Joint Online-Offline Fine-tuning for Large Language Models

This work advocates for Joint Online-Offline Fine-Tuning as a superior paradigm that breaks the convention of restricting offline data to SFT and online data to RFT, and provides the first comprehensive survey focusing specifically on the synchronization of data provenance.

Tai-Hang Zhen, Guang Yang, Chen-Zhang Li et al. · 0 citations
#artificial intelligence Preprint Oct 2026

HuatuoGPT-3: RL-Only Domain Adaptation from Base Models

Domain adaptation aims to turn a general-purpose large language model (LLM) into an expert for a target domain. While the dominant SFT+RL pipeline offers a convenient cold start, it may reduce exploration diversity and introduces additional complexity through multi-stage optimization. These limitations motivate RL-only...

Junying Chen, Xin-Yuan Xie, Zi-Niu Li et al. · 0 citations
#artificial intelligence Preprint Sep 2026

SCX Router: Streaming Zero-Shot Model Selection with a Decoder-KV Classifier and a Real-World Task Ontology

A lightweight GLiClass-based router is introduced, a lightweight GLiClass-based router that assigns a suitability score to each inference-time model label without autoregressive generation, and a released 0.6B-parameter checkpoint combines a Qwen3 decoder with a shallow bidirectional scorer.

Ihor Stepanov, Aleksandr Smechov, Mykhailo Shtopko et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.