- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Cross-stage Confusion Suppression (CCS) for exemplar-free class-incremental learning. It groups potentially confusing classes using prototype similarity and connected components, trains shared adapters using generated pseudo-samples, and applies weight subtraction and two-stage inference to improve cross-stage discrimination. Experiments on four benchmarks report improvements over the selected baselines.
Critical strengths
CCS provides a practical approach to improving discrimination between classes learned at different stages. Table 2 reports consistent improvements over the authors' baseline across all four benchmarks, suggesting that targeted refinement can be useful.
Critical weaknesses
1. The novelty is not sufficiently distinguished from prior work, and the omission of a key baseline is a significant concern. The distinction between catastrophic forgetting and cross-task confusion has already been explicitly investigated in [1], [2], and [3], weakening the novelty of the paper's motivation. While CCS introduces a specific mechanism for addressing this issue, its contribution relative to these existing studies could be more clearly established.
More importantly, the authors discuss the limitations of RSIAT [4] in Sec. 2 but omit it from Table 1. RSIAT reports 86.92% average accuracy and 82.75% final accuracy on ImageNet-R B0 Inc20, compared with 86.49% and 81.68% for CCS. Although these cross-paper results do not constitute a controlled comparison, they raise legitimate questions about the claimed superiority of CCS and make the omission particularly consequential.
2. The core mechanism and efficiency claims require stronger justification. The method combines established techniques, including graph-based grouping, weight-space subtraction, and gradient-based pseudo-sample generation. In particular, the assumption that subtracting shared adapter weights suppresses common semantic information lacks a theoretical guarantee, as acknowledged in Appendix B.4. Although Table 18 compares weight-level and feature-level subtraction, the existing ablations do not sufficiently isolate the benefit of differential adapter subtraction from simpler component-specific prediction refinement strategies.
Furthermore, CCS retains separate task-specific adapters and introduces additional shared adapters, resulting in growing parameter storage as tasks accumulate. Eq. (14) also requires task-specific feature evaluations during inference. While Tables 4 and 9 provide partial efficiency measurements, they do not establish cumulative parameter storage or end-to-end training and inference costs, particularly when pseudo-sample generation and repeated task-specific evaluations are considered. Consequently, the claimed efficiency advantage remains insufficiently substantiated.
References
[1] On the Importance of Cross-Task Features for Class-Incremental Learning.
[2] Resolving Task Confusion in Dynamic Expansion Architectures for Class Incremental Learning.
[3] Task Confusion and Catastrophic Forgetting in Class-Incremental Learning: A Mathematical Framework for Discriminative and Generative Modelings.
[4] Representation-Steered Incremental Adapter-Tuning for Class-Incremental Learning with Pre-Trained Models.
Questions for authors
- How are the historical rectified prototypes in Eq. (9) computed and updated without access to historical training samples? Are they estimated using the generated pseudo-samples, and are they recomputed as the shared adapters are optimized?
- What explains the differences between Table 1 and the three-seed results in Table 19? For example, VTAB final accuracy is 94.95% in Table 1 but 92.67 ± 0.97% in Table 19. Additionally, although Appendix A.3 reports dataset-specific similarity thresholds, what validation protocol was used to select them, and were test-set results involved in this selection?
- Can the authors provide a controlled comparison with RSIAT [4] using the same pretrained backbone checkpoint, class orders, random seeds, and evaluation protocol? This would help clarify whether CCS provides a consistent advantage over this closely related method.
- Can the authors isolate the benefit of differential adapter subtraction against a simpler component-specific reranker with comparable parameters and computational cost? Please also report cumulative parameter storage and end-to-end training and inference costs, including pseudo-sample generation, as the number of incremental tasks increases.