- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper defines an update’s “functional risk” as the inner product between the protected-task loss gradient and the optimizer’s proposed parameter update, which approximates the change in that loss. The paper separates prediction error into sampling noise, stale gradient estimates, and higher-order effects. Its central insight is that detecting harmful updates can be difficult while reducing their damage can be easier: the proposed updates are nearly orthogonal to protected gradients, making their effects difficult to estimate, but a correction along a sufficiently aligned gradient estimate can still help. The authors introduce Dynamic Functional Risk Control (DFRC), which periodically refreshes protected gradients and minimally adjusts updates that violate estimated constraints. Across two models and three orders of four classification tasks, DFRC-MC improves average accuracy by 1.06 percentage points and reduces forgetting by 1.45 points relative to sequential LoRA, with additional retention benefits when combined with MBF.
Critical strengths
The paper provides a clear explanation of why noisy estimates can support useful corrections even when they cannot reliably classify individual updates as harmful. Assessing the actual optimizer proposal is well motivated because AdamW’s momentum and adaptive scaling can change the effect implied by the raw gradient. The mechanism studies strengthen the argument through independent reference and evaluation sets, comparisons with larger reference sets, and equal-norm random-direction controls, which support the importance of the protected-gradient direction. The authors also report counterexamples and failed hypotheses transparently. Finally, DFRC improves retention without materially reducing current-task acquisition in the reported experiments, and its compatibility with MBF suggests practical value as an additional controller.
Critical weaknesses
I think your conclusion describes the weaknesses the best, particularly the "DFRC’s 256-example memory has not been compared with replay of the same examples"
Questions for authors
The paper notes that DFRC’s 256-example memory has not been compared with replay of the same examples. I would be interested in seeing this comparison if results become available during the rebuttal period.