Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 36 min ago
PreprintCC BY 4.0arXiv

Why Constrained Updates Still Forget: A Functional-Path Analysis of Continual SFT

Abstract

Supervised fine-tuning adapts language models to specialized tasks but can disrupt previously acquired behavior. Existing approaches constrain parameters, gradients, or replay objectives, yet the connection between the protected object, the intervening trajectory, and retained outputs remains unclear. We develop a functional-path account that decomposes old-loss changes along realized updates into the controlled direction, gradient staleness, probe mismatch, and finite-step effects. The account yields a conditional refresh budget and identifies the restoring direction supplied by informative replay. Matched QLoRA interventions separate constraint granularity from placement before or after Adam: placement strongly affects retention across the studied code-label audits, whereas the granularity interaction depends on the endpoint. Checkpointed generation separates endpoint recovery from higher sampled-path accuracy, and matched replay schedules reveal loss exposure concealed by final scores. A sequential-task comparison extends this distinction to backward transfer: subspace regularization and projection improve average retention while trading off different old tasks; supervised replay protects both more consistently in this setting. Additional response interfaces distinguish content gains from exact-response retention. These findings connect update-level protection to task-wise behavior and motivate mitigation through explicit functional anchors, trajectory evaluation, and joint old/new auditing.

Related

  1. Geometry-Aware Multi-Objective Optimization: Norm-Constrained Oracles with Entropic Weight Updates
    El Mahdi Chayti, Alireza Mirrokni, Martin Jaggi
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  2. Learning Conditional Expectation Operators via Functional Newton Updates
    Thiago Ramos, Alek Fröhlich, Daniel Perazzo +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. Fast Functional Clustering via Closed-Form Covariance Updates
    Yu Wang, Jiaze Guo, Yao Chen +2
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. Why Forget-Only Unlearning Needs Memorization
    Luka Radić, Vikrant Singhal, Amartya Sanyal
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Adapt or Forget: Provable Tradeoffs Between Adam and SGD in Nonstationary Optimization
    Sharan Sahu, Abir Sarkar, Cameron J. Hogan +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{ma2026constrained,
  title = {{Why Constrained Updates Still Forget: A Functional-Path Analysis of Continual SFT}},
  author = {Qingsen Ma and Dianyun Wang and Jiahong Liu and Irwin King},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.30191},
  eprint = {2610.30191},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.30191},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Why Constrained Updates Still Forget: A Functional-Path Analysis of Continual SFT
AU  - Qingsen Ma
AU  - Dianyun Wang
AU  - Jiahong Liu
AU  - Irwin King
PY  - 2026
DA  - 2026/10/21
PB  - arXiv
DO  - 10.48550/arxiv.2610.30191
UR  - https://arxiv.org/abs/2610.30191
AB  - Supervised fine-tuning adapts language models to specialized tasks but can disrupt previously acquired behavior. Existing approaches constrain parameters, gradients, or replay objectives, yet the connection between the protected object, the intervening trajectory, and retained outputs remains unclear. We develop a functional-path account that decomposes old-loss changes along realized updates into the controlled direction, gradient staleness, probe mismatch, and finite-step effects. The account yields a conditional refresh budget and identifies the restoring direction supplied by informative replay. Matched QLoRA interventions separate constraint granularity from placement before or after Adam: placement strongly affects retention across the studied code-label audits, whereas the granularity interaction depends on the endpoint. Checkpointed generation separates endpoint recovery from higher sampled-path accuracy, and matched replay schedules reveal loss exposure concealed by final scores. A sequential-task comparison extends this distinction to backward transfer: subspace regularization and projection improve average retention while trading off different old tasks; supervised replay protects both more consistently in this setting. Additional response interfaces distinguish content gains from exact-response retention. These findings connect update-level protection to task-wise behavior and motivate mitigation through explicit functional anchors, trajectory evaluation, and joint old/new auditing.
ER  -