- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2(+1)
- Soundness
- 2
Read review
Paper summary
The paper formulates continual learning as sequential multi-task optimization. It stores information about past losses to balance conflicting tasks, with theoretical results for quadratic losses and quadratic upper bounds.
Critical strengths
- The paper allows tasks to have different minimizers and directly addresses the resulting trade-offs. This is a more realistic setting than assuming all tasks share a common optimum.
- The method specifies what historical information needs to be retained. For linear regression, its recursive updates recover the joint-training solution without storing past samples, and the storage requirement does not grow with the number of tasks.
Critical weaknesses
-
The experimental comparison uses different resource budgets. PMF-CL fits each task-local model to convergence, while the baselines train for one epoch. On Sequential MNIST, it also uses about 16 times as much memory as ER. This makes it hard to tell how much of the improvement comes from the method itself.
-
The experiments are limited to synthetic linear regression and a linear classifier on Sequential MNIST. They do not show how performance changes with the number of tasks, model dimension, or degree of task conflict.
-
Eq. (7) and Algorithm 3 omit the normalization factor in the new-task terms, whereas Eq. (15) includes it. With unequal task sizes, this changes the effective task weights and can prevent recovery of the stated joint-training solution.
Questions for authors
-
How does PMF-CL compare with ER and DER when they receive the same total memory budget and are allowed to train to convergence?
-
How do the authors ensure that the synthetic tasks have no common minimizer, and how does PMF-CL perform as the conflict between tasks increases?