- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper analyzed the subspace protection and neuron recycling in task-free continual learning. This work combines fixed-rank subspace protection with neuron recycling and designed the CN-ImageNet and CN-Procgen pipelines for long-term task reproduction at non-fixed intervals. This paper is clearly written and the experiments are thorough. Experiments show that this method performs well on the ConvNet task in CN-ImageNet.
Critical strengths
- This paper analyzed the subspace protection and neuron recycling in task-free continual learning. The author investigates the impact between forgetting and plasticity; this research has practical implications for long-term non-stationary learning.
- Compared with existing methods, this paper identifies two mechanisms about subspace saturation and persistent neuron dormancy, and explain why different countermeasures are required, it’s meaningful. What's more, the experimental results provide strong evidence.
Critical weaknesses
- In development stream author choose rank=2 as optimal protection rank, but in main experiments use rank=4. Although the author explains it in Appendix, but this choice still reduces the independence between hyperparameter select and final evaluation. It’s recommended the author confirm the main conclusions still apply when using rank = 2.
- In Table I for CN-ImageNet, FRSP+ReDo achieves an R0 of 0.053, which is lower than AdamW's 0.066 and much lower than other stronger preservation methods such as OWM and GPM; the authors note that "memory is not guaranteed." Authors are suggested to jointly analyze plasticity and memory retention.
Questions for authors
- Why does the headline CN-ImageNe not use k=2? If k=2 was exclusively used, would all key paired claims, factorial conclusions, and layer-selection conclusions remain intact?
- For CN-Procgen, is it possible to design a layer-selection rule that ignores the main schedules altogether (e.g., one that selects the first block based on dev-stream overlap or early online stats only) and evaluates it all at once on the new set of third-group schedules?
- CN-Procgen runs only one initialization per schedule. If we add at least 3–5 seeds per schedule, will the paired/clustered CIs for whole-trunk, first-block, and ReDo continue to support the cross-domain design principles given in the main text?
6 comments
Dear Reviewer hDon,
Thank you again for the time you have given to our submission. To make the changes easier to find, we have re-uploaded the revision with the added and revised text marked in green. Among the changes, your concerns led us to confirm the main conclusions at k=2, the rank selected on the development stream, and to analyze plasticity and memory jointly (Appendix F.1).
If time allows before the discussion closes on November 18 (AoE), we would be grateful to hear whether our response addresses your concerns and whether you have any further comments that could improve the paper. If anything remains unclear, we would be glad to clarify it.
Best regards,
The authors
Dear Reviewer hDon,
Following your suggestion, we analyzed plasticity and memory jointly, and we would like to point to one result. As you noted, some baselines have a higher first-batch recall than FRSP+ReDo. Figure 8 of the revision shows that each of them has a lower plasticity. With all layers protected at rank 32, FRSP+ReDo is above AdamW in both quantities.
We hope this is helpful and would be happy to address any further questions or comments. We sincerely thank you for your time and review.
Best regards,
The authors
We thank the reviewer for the questions, which made the paper more rigorous. The rank and the rule that selects the protected block now come from the development stream alone, and the main conclusions hold.
Q1 and W1.
We agree that a k=4 headline setting weakened the independence of selection and evaluation, so the headline setting now uses k=2, the rank chosen by the development rule. The protection main effect on P and the gain in P of protection added to self-normalized resets (+0.004, was +0.007) move into the tie margin (Section 6.2). No other row changes its sign or verdict. Protection still raises P only with recycling, since the interaction stays positive on 10 of 10 schedules.
W2.
As you point out, the R0 of FRSP+ReDo is below those of AdamW, OWM and GPM, so the table splits it into denominator and numerator (R0 subtracts chance, 0.2, from each). Against AdamW the first-batch accuracy is level (higher on 5 of 15 pairs, interval including 0) and the end-of-visit accuracy is higher, so the lower R0 is a denominator effect of learning more, not a loss of memory. AdamW also lies inside the Pareto front of P and R0 (Figure 8). OWM does remember more (higher first-batch accuracy on all 15 pairs) at the cost of end-of-visit accuracy and P, a genuine trade-off that the amount of protection sets within FRSP+ReDo. Protecting all layers at a higher rank raises R0, with the first-batch accuracy itself rising, and lowers P. The revision adds this analysis as Appendix F.1 and states the joint result in the conclusion.
Q2.
Following your suggestion, the rule protects the IMPALA block with the highest overlap on neural networks trained on the development stream, the first block regardless of the learner. We evaluated it once on schedules 10 to 14, unused in the submission, with three initializations. As on schedules 0 to 9, the first block it selects can be called neither better nor worse than ReDo, since both intervals include 0. Whole-trunk protection, the setting selected on the development stream, is again below ReDo in New game with an interval excluding 0, so it appears to learn unseen games less well. The revision adds the rule to Section 6.3 and the table as Table 14 (Appendix F.2).
Q3.
As requested, each schedule now has three initializations. For learning new games the principle holds. In New game the whole trunk is below both ReDo and the first block with intervals excluding 0, so protecting less shared layers appears to lower the learning of unseen games, and restricting protection to the most shared first block appears to reduce this deficit. In overall return (P) the whole trunk is below ReDo on schedules 0 to 9 but not on 10 to 14, where the interval includes 0. The revision therefore updates Table 3 with three initializations and narrows the statement of Section 6.3 on CN-Procgen to the deficit in learning new games.