- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
RE-LoRA studies rehearsal-free class-incremental learning with a frozen pretrained backbone. It trains a residual LoRA alongside a frozen historical adapter, then compresses their summed update to a fixed rank using truncated SVD. At inference, PGTR uses frozen-backbone class prototypes to infer a task and masks all logits outside that task. The paper evaluates this combination on four benchmarks and analyzes the weight approximation error introduced by compression.
Critical strengths
-
The residual-and-compression procedure is simple and maintains a fixed deployed adapter rank without replay or an auxiliary regularization loss.
-
The experiments span several datasets, task splits, and pretrained backbones, and report parameter, storage, and inference costs.
-
The ablations expose the large effect of task routing and compare prototypes from frozen and adapted features.
Critical weaknesses
-
The headline accuracy primarily reflects task routing rather than the proposed adapter mechanism. Before PGTR, final class-incremental accuracy is 39.26% on ImageNet-R and 29.37% on ImageNet-A; with PGTR, it becomes 90.72% and 66.50%. PGTR exploits the benchmark’s known class-to-task partition to restrict every prediction to one task. Without applying the same router to the baselines, the reported comparisons do not establish an advantage in continual adaptation or retention.
-
HKC is a standard fixed-rank approximation of the summed updates, not an objective designed to preserve old-task behavior. Its Frobenius-norm guarantee does not imply an accuracy guarantee, and adding HKC to RAL does not improve final task-identified accuracy on either ImageNet-R or ImageNet-A. The evidence supports its role in controlling adapter size more clearly than its claimed role in preventing forgetting.
-
The dependence on routing limits the conclusions. The paper reports perfect task identification, but Figure 6 shows aggregated prototype similarities rather than per-sample routing errors. Its behavior under different class groupings, unequal task sizes, or imperfect task identification is unclear; PGTR also requires approximately an additional backbone pass.
Questions for authors
-
How do all main baselines perform with the identical PGTR router?
-
What are PGTR’s per-sample task-identification errors under alternative class-to-task partitions, and how quickly does final accuracy degrade when routing is imperfect?
-
How does HKC change old-task accuracy immediately before and after compression across different rank budgets?