- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
PKC extends replay-based continual learning by constructing a path between each sample’s label distribution and stored prediction. A training-only conditioner generates predictions along this path, with label supervision at each node and a consistency loss between neighboring nodes. Experiments with ResNet and pretrained ViT backbones report improved accuracy and reduced forgetting.
Critical strengths
-
The method reuses backbone features across path nodes and removes the conditioner at test time, keeping inference costs unchanged.
-
The experiments cover both training from scratch and pretrained models, with sizable reported gains on CIFAR-100.
Critical weaknesses
-
The loss function of PKC seems overly complicated. Besides the two proposed path losses, it also combines several existing components, including LODE, DER++, teacher distillation, and anchor refresh. This makes it difficult to determine how much of the performance improvement actually comes from PKC itself. More direct ablation studies are needed to isolate its contribution.
-
The overall objective contains six loss terms, but some hyperparameters, such as α and η in the ResNet setting, are not clearly reported, while β varies across datasets. The hyperparameter settings are not sufficiently transparent, and a more systematic sensitivity analysis would help improve reproducibility.
-
The importance of the path smoothness term is not fully convincing. Removing it reduces accuracy from 45.16% to 43.93%, whereas removing the fidelity term drops accuracy to 40.36%. This suggests that most of the gains may come from multi-node fidelity supervision rather than the path smoothness mechanism emphasized in the paper.
Questions for authors
-
The theoretical analysis does not match the training objective: the smoothness penalty used in practice differs from the one analyzed. How do the theoretical results apply to the implemented loss? More importantly, how does stability along the conditioning path translate into less forgetting across tasks?
-
The ablations do not isolate the contribution of the path component from teacher distillation and memory updates. How much of the improvement remains when the path component is removed but all other settings are kept unchanged? This baseline is needed to identify where the gains come from.
-
Does PKC use known task boundaries or session-level class information in the Si-Blurry experiments? The algorithm requires task boundaries for teacher updates and class information to distinguish old from new classes, but it is unclear how these are obtained in a blurry stream. Please clarify whether the baselines have access to the same information.