- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper points out that adding new classes can change old predictions even with frozen old parameters, and refers to this as insertion-induced class-competition interference. The paper proposes CAPE framework for few-shot class registration, which providing finite-sample control of old-to-new interference over an old-class calibration frame. It instantiates registration-specific CAPE-BF and amortized cross-registration CCPL as two scorer regimes for CAPE. Extensive experiments are conducted on 900 development episodes and two held-out populations, which supports separating learned conflict ranking from per-registration risk certification.
Critical strengths
1.The paper demonstrates a clear motivation. It points out that the fixing the model parameters does not necessarily mean that the model's decision remains unchanged when new classes are added, and refers to this as insertion-induced class-competition interference.
2.The paper is well structured, and the proposed CAPE is sound, with two scoring regimes instantiated as CAPE-BF and CCPL.
3.The paper presents a sound theoretical analysis. Extensive experiments are conducted across 900 development episodes and two held-out populations.
Critical weaknesses
1.CAPE maintains the calibration frame for old classes. As new registrations accumulate and the number of old classes grows incrementally, the calibration frame may expand, leading to increasing storage costs.
2.CAPE sets a limited number of old-class calibration anchors. As the number of old classes increases, the calibration information allocated to each old class may become fewer. Therefore, conflict between new registration and individual old classes may not be sufficiently reflected, thereby weakening the ability to protect existing old classes.
3.CAPE-BF uses a 10-D passive block, and CCPL uses the full 17-D conflict representation. Each dimension is computed based on frozen DINOv3 and CLIP features, which incurs additional computational overhead. Additionally, for CAPE-BF, this may introduce additional time costs for each registration.
4.The primary aim of paper is to control old-to-new errors. However, the experiments in the main paper focus primarily on new-class utility, and as can be seen in Figure 1(C), the proposed method results in a higher harm05 value than BiMC.
Questions for authors
1.Regarding Weakness 1 and 2, as new registrations accumulate incrementally, could the authors explain whether maintaining the calibration frame for old classes incurs increasing storage costs, and whether the potential reduction in candidate anchors for each old class might affect the ability to protect old classes?
2.Regarding Weakness 3, could the authors explain whether the conflict representation in CAPE-BF and CCPL would introduce additional computational and time costs?
3.Regarding Weakness 4, given that the primary aim is to control old-to-new errors, could the authors explain why the experiments focus primarily on new-class utility?
2 comments
Official Comment by Authors
Dear Reviewer,
Thank you once again for your valuable comments on our submission. As the discussion phase is approaching its end, we would like to kindly confirm whether we have sufficiently addressed all of your concerns. Should there be any remaining questions requiring further clarification, please do not hesitate to let us know.
We sincerely look forward to your feedback.
Reply to reviewer yiv7
Thank you for the encouraging assessment and the concrete questions, which helped us make the deployment side of the paper more precise. We address them in order.
Q1 / W1 — Storage cost of the calibration frame as classes accumulate.
Storage grows linearly with the number of old classes, while each registration scores at most 530 anchors. The frame stores a fixed number of labelled feature rows per old class (27 in our protocol), so it grows with the old label set like the classifier itself. Each registration scores at most 530 anchors, drawn by stratified sampling without replacement from the frame, so the scoring cost of a registration does not grow with the frame.
Q1 / W2 — Fewer anchors per old class as classes grow.
The certificate is an aggregate guarantee over the old classes, and the design-exact budget uses the per-class design. With 530 anchors, an old class receives about 26 anchors with 20 old classes, 18 with 30, 13 with 40 and 7 with 80. The certified quantity weights every class by its share of the design, and the FP budget computes its tail class by class from that design, so thinner strata are accounted for exactly rather than approximated. A class-wise guarantee would need class-wise budgets: at ε = 2%, at least 149 anchors per class to certify zero violations.
Q2 / W3 — Computational overhead of the conflict representation.
Given features, CCPL arbitrates in 0.72 ms per registration on a Jetson Nano, about 11× faster than CAPE-BF (8.02 ms; Appendix H). This is the measured arbitration layer of vanilla CCPL; removing per-registration fitting is what makes it fast, and the serialized MLP is 46,732 bytes (634 bytes for CCPL-Linear). Aligned CCPL-FP runs the same ranker together with BiMC's proposal and margin. Most conflict dimensions use a second frozen encoder (DINOv3), which adds one forward pass per candidate query and per anchor and sits outside these latency numbers. The design-exact budget is an offline cost. It depends only on the anchor design, so it is solved once per design and cached: a first solve takes a median of 14 s (p90 144 s), and building the cache for all 303 development designs took about 20.9 h (Appendix K). Registrations with a cached design read the budget directly.
Q3 / W4 — Why focus on new-class utility, and how does old-class protection compare?
Our objective is to retain more correct new-class predictions under a fixed, certified old-to-new risk constraint. The certificate controls interference with existing classes, while new-class utility measures how effectively the registered classes are recognized under that constraint.
Our new matched-proposal comparison provides direct evidence of this benefit. Under the same BiMC proposal, final-draw anchors, and FP certification budget, aligned CCPL improves new-class utility from 87.37% to 89.76% (+2.39pp) across 900 development episodes. The empirical old-to-new migration rate remains comparable (0.53% versus 0.55%), as does the mean old-class accuracy change (+5.28pp versus +5.26pp). The descriptive harm05 measure is 15.8% versus 14.8%.
The benefit is particularly clear on held-out FGVC Aircraft. Evaluated once without further retraining, aligned CCPL improves certified new-class utility from 32.36% to 42.52% (+10.16pp), while also reducing harm05 from 10.0% to 9.3%. These results demonstrate the practical value of learned conflict ranking: more correct new-class predictions can be retained without relaxing the per-registration certification guarantee.
Thank you for your support of this work; we are glad to discuss any further questions.