- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies the price of sequential task updates in continual learning. The authors build on independently task sampling procedure and an overparameterized linear regression model. Theoretically, they prove that distribution-level forgetting and population loss converge to the same stationary limit, with the gap between them vanishing at rate of O(1/T). They further decompose the limiting loss into the unavoidable loss caused by task conflicts and an additional sequential price. They also analyze a fixed-strength, population-curvature EWC regularizer and show that, in the strong-regularization regime, the stationary excess loss decreases at rate of O(1/\lambda). Experiments on real dates provide quantitative and qualitative support, respectively, for the predicted sequential price and its reduction.
Critical strengths
I think the main contribution of this paper lies in its theoretical insights. The authors assess the cost of sequential learning and characterize its asymptotic behavior. They distinguish the unavoidable loss caused by conflicting tasks from the excess loss introduced by sequential exact fitting. This unavoidable loss, or minimal achieved loss, provides a lower bound, giving a meaningful benchmark for evaluating sequential learning. The results clarify how task curvature and long-run parameter fluctuations contribute to persistent error, and identify homogeneous curvature conditions under which sequential exact fitting incurs twice the loss of joint training. The EWC analysis further shows how regularization can reduce the stationary excess loss. While the dependence will decay slowly.
Critical weaknesses
The main limitation is that the theoretical insights rely on linear models, quadratic loss, independent task sampling, and exact per-task optimization. Although it is a standard starting point, I am not sure whether the findings hold in complex settings. It will be interesting to provide a more detailed discussion of how violations of these assumptions affect the results and the technical difficulties involved in extending the theory.
Questions for authors
In the EWC analysis, it assumes that the population curvature is known. While sample curvature is typically used in application. Could the authors clarify the rate of estimation error vanishes. how this error affects the theoretical results and finite-sample performance? Would the resulting rates depend jointly on the sample size and lambda.
The paper specifically focuses on EWC. Would similar findings hold for other penalties
Revised manuscript: assumptions and extensions
We have substantially revised the manuscript to clarify the assumptions behind each result and address the scope questions you raised. Section 6 now explains which conclusions depend on linearity, quadratic loss, independent task sampling, and the specific update rule. Section 2.3 shows how real Jester ratings, with a natural encoding and training procedure, satisfy the theoretical assumptions, while Appendix G examines finite-step nonlinear training and discusses where the linear-model predictions cease to hold. Regarding estimated curvature, we clarify that the full Jester user population defines our experimental task distribution, so its population curvature is available exactly; our earlier response separately addresses estimation from independent tasks and the joint dependence on sample size and regularization strength. Appendix E.4 also explains how the stationary calculations extend to other fixed positive-definite quadratic penalties, including an independently estimated curvature matrix held fixed during training. Throughout the main text, we have made the motivation and interpretation of the results more explicit. We would appreciate your assessment of whether these revisions and our earlier response address your questions.