Catastrophic forgetting is the loss of prior capabilities during sequential training on new tasks. In post-training, supervised fine-tuning (SFT) can gain target-task performance while moving probability mass away from earlier capabilities; on-policy RL is presented as retaining more while achieving comparable or higher target-task gains. section 15.2.2
The proposed mechanism is the direction of KL divergence. SFT corresponds to forward KL, KL(π★ || πθ), and learns from target-distribution samples. RL corresponds to reverse KL, KL(πθ || π★), sampling from the current policy while optimizing reward with a reference-policy KL penalty. Forward KL must cover the target distribution and can pull mass from an old mode; reverse KL can move a new mode toward reward without disturbing the old one. section 15.2.2
Figure 15.1 Forgetting dynamics for forward KL (SFT) versus reverse KL (RL). The “old” mode represents prior knowledge, and the “new” mode represents the target task. Forward KL stretches the policy to cover the target and pulls mass away from the old mode (top right), whereas reverse KL shifts the new mode toward the target without disturbing the old mode (bottom right). From Chen et al. (2025), with permission of the author.
Compare the two distribution-shift patterns: forward KL stretches policy mass toward the target, whereas reverse KL shifts the new mode while preserving the old mode. section 15.2.2
A practical account of lower forgetting in online RL emphasizes policy drift:
- Among high-reward solutions, on-policy RL is biased toward policies closer in KL divergence to the initial policy. section 15.2.3
- Prior-task forgetting strongly correlates with KL distance between the trained and initial policies, even when that distance is measured on new-task inputs. section 15.2.3
- On-policy rather than offline sampling accounts for the reported generalization difference; negative gradients do not show a discernible additional effect. section 15.2.3
This makes KL drift from the base model a diagnostic for retention risk during specialization. Additional regularizers can preserve general language-modeling quality, including mixed pretraining gradients, negative log-likelihood on winning completions, reward-model margin losses, and reward-weighted DPO variants. section 15.2.3 section 15.4
Figure 15.2 Bias toward KL-minimal solutions reduces forgetting. (Left) Among policies that solve the new task, RL converges to those closest in KL to the base model. (Right) This KL bias yields higher prior-task retention at matched new-task performance compared to SFT. From Shenfeld, Pari, and Agrawal (2026). License CC-BY.
Inspect the trade-off at matched new-task performance: policies nearer the base model in KL retain more prior-task performance than SFT alternatives. section 15.2.3


