- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Geometric Gradient Rectification Prompting (GGRP) for noise-robust adaptation of vision-language models. GGRP combines EMA-based textual prototypes, optimal transport over a batch-adaptive class support to generate rectified targets, and an assignment-margin gate that balances cross-entropy on rectified targets with MAE on observed labels. Experiments evaluate the method on multiple datasets with synthetic label noise and on Food101N with naturally noisy labels.
Critical strengths
1.The paper is generally well organized, with a clear progression from problem analysis to methodology and empirical evaluation.
2.The experimental evaluation is reasonably extensive, covering multiple datasets, noise types, and corruption rates, together with component ablations and hyperparameter sensitivity analyses.
Critical weaknesses
1.The methodological novelty is questionable. NLPrompt already uses optimal transport to partition examples and applies CE and MAE to different subsets. The performance gains over the strongest competing method are also generally modest, particularly compared with the more substantial improvements emphasized over NLPrompt.
2.The roles and necessity of individual components is not sufficient. The “Silenced Gradient Recovery” subsection introduces the margin-based gate, while the “Hybrid Optimization Objective” subsection incorporates that gate into the CE/MAE objective. These are closely related parts of the same mechanism, but their presentation is somewhat repetitive and does not adequately explain why this particular combination is preferable to simpler alternatives.
Questions for authors
Other weaknesses: 1.The connection between the theoretical analysis and the proposed method remains incomplete. The analysis correctly shows that MAE and GCE attenuate gradients when the target-class probability is low. However, this established property does not directly justify the specific support-selection, target-rectification, and thresholding mechanisms introduced by GGRP. The recovery analysis is conditional on OT providing a correct target with a sufficiently large gate, leaving the reliability of this condition largely unresolved.
2.Some notation and diagnostic definitions are ambiguous. The observed label is defined as tilde y in line 238, while the generic class index is expressed as (c) in eq.7. More importantly, Equation (5) defines rejection through membership in a noisy subset, whereas GGRP uses continuous weighting. The paper should clarify how rejection is defined for GGRP in Figure 1 and whether this measure is directly comparable across methods.
3.Hyperparameter robustness and practical selection remain insufficiently demonstrated. The method introduces several hyperparameters, while the reported sensitivity studies examine individual choices on single datasets rather than establishing that a common configuration transfers reliably across datasets and noise conditions.
4.The related work discussion is too limited to establish the paper’s position. A more thorough discussion should cover classical sample-weighting and robust-loss approaches, optimal-transport-based noisy-label learning methods, and robust prompt tuning for VLMs.
Other questions: 1.Some CoOp results appear to coincide with those reported in the NA-MVP paper, whereas other baseline results differ. Could the authors clarify which results are reproduced and which are taken from prior publications? If the evaluation protocols differ, will this introduce unfairness?
2.How are the gating thresholds and other hyperparameters selected?