- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes Dynamic-V2C, a concept bottleneck framework that combines clustered visual prototypes, influence-based model editing, and continual vocabulary expansion. A frozen CLIP backbone provides patch features, while a trainable projection predicts prototype activations. Data removal updates both the projection and the linear classifier, including a correction for the resulting change in concept activations. Concept removal masks selected classifier inputs and updates the remaining weights. For continual learning, an influence-based signal triggers vocabulary expansion, while historical activation covariance attenuates updates along previously active directions. The paper evaluates classification, editing efficiency, output-level membership leakage, spurious-correlation debugging, and task-aware continual learning.
Critical strengths
The framework addresses a practical maintenance problem. Updating a concept projection can change the inputs seen by the classifier, so explicitly accounting for that representation shift is sensible. Connecting editing to vocabulary expansion also gives the framework a coherent use case beyond a static classification model.
The paper makes several useful scope distinctions and includes relevant checks. It explicitly describes its privacy result as output/head-level editing, acknowledges that visual clusters are not guaranteed to be semantically pure concepts, and identifies the continual-learning setting as task-aware. The appendix includes component ablations, removal-ratio experiments, a larger-backbone test, and a feature-space privacy probe. These are appropriate checks, although the concerns below limit how confidently I can interpret the results.
Critical weaknesses
The source of Table 2’s results needs clarification. Four central F1 scores exactly match Hu et al.’s published Editable CBM results, and the runtimes closely match after conversion from minutes to seconds. Yet this submission describes three-seed reimplementations on an A100, while the earlier paper reports an RTX 3090 setup and distinguishes concept-label editing from data removal. This correspondence does not establish what happened, but it needs a concrete explanation because these results support the headline 131-fold speedup.
Similar aggregate performance does not establish fidelity to retraining. Nearly identical F1 or accuracy can hide substantial differences in individual predictions, and the unedited model already has similar test utility. The RMIA experiment is useful, but needs a retrained-model reference under the same attack. A direct ablation of the representation-shift correction and prediction-level comparisons on removed, retained, and test examples would make the editing claim more convincing.
Questions for authors
Can you explain the numerical correspondence with Hu et al.’s concept-label editing results? Please provide per-seed results, timing logs, and the exact configuration for Table 2. Please distinguish any inherited reference values from newly measured results, and clarify why these values appear under a data-removal protocol here.
How closely does the edited model match the retrained model on individual predictions? Similar overall F1 scores do not necessarily mean that the models behave similarly. Please compare their predictions and confidence scores on removed, retained, and test examples, include retraining in the RMIA comparison, and test the editing procedure with the representation-shift correction disabled.
Could you clarify the exactness claim following Theorem 1? The update uses curvature from the original training objective, but removing examples generally changes that curvature. Even for strictly convex quadratic losses, a single update using the original curvature need not recover the exact retrained solution. Please distinguish the valid local derivative from the approximation used for complete removal.
What exactly is done in the CelebA debugging experiment, and what does the reported runtime include? Section 5.5 describes ranking examples and penalizing routes, while Section 4.2.2 describes masking and zeroing concept columns. Please explain which procedure produces Table 3, how the routes are selected, and whether timing includes route selection, curvature refresh, and classifier correction. For the DFR comparison, please separate feature extraction and initial training from the debugging update itself.