- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
AGI-TPT adds a one-sided squared-hinge penalty on pairwise text-feature cosines to test-time prompt tuning. Its stopping level is motivated by attainable spherical-code separation for the class count and feature dimension, with certified levels used in the more difficult regime. The paper analyzes the limited ability of one-step comparisons to distinguish geometric objectives and evaluates calibration, accuracy, and preservation of class geometry under sustained online adaptation.
Critical strengths
The distinction between one-step strength effects and sustained changes in class geometry is a useful insight, and the paper backs it up with matched-strength controls. I also like the idea of stopping the separation penalty for pairs that have reached the chosen level, since the goal is to preserve useful class relationships while avoiding collapse. The online experiments, component comparisons, and label-shift tests give the method a much stronger empirical case than a one-step calibration result alone would. The paper also makes a real effort to spell out the limits of the free-feature theory and to show cases where spreading classes can hurt.
Critical weaknesses
-
Could we separate the pairwise force from the actual update a bit more clearly? Proposition 10 gives a nonzero pairwise derivative below the attainable level, but at a regular simplex those tangent contributions can cancel, leaving the regularizer's total gradient at zero. I'm therefore not quite sure whether the 'persistent offset' in S1.1 means a nonzero loss value or a gradient that keeps moving the features. Checking that small example and showing the actual prompt-space regularizer gradient along one existing online run would help connect the stopping argument to the observed stability; this doesn't require a new general convergence guarantee for prompts.
-
I was a little unsure how the fixed-random-direction control in S5.3 gets to an override mass of 0.58. With a nonnegative scale, only coordinates where the direction opposes the entropy gradient can ever be overridden, so scaling a data-independent symmetric random direction still gives an expected maximum mass of 0.5. A particular direction can exceed 0.58, so I'm not saying the reported run is impossible. Could you explain how directions are sampled or selected when they cannot reach the target, and report the mass actually reached? That would make this specific matched-strength comparison much easier to interpret.
-
Could we double-check the EuroSAT reachability row in Table S11? If its columns describe the same initial and final configurations, the initial mean cosine of 0.74, final maximum of 0.10, and 47% of pairs below the level imply a loss-ratio upper bound of about 0.53 * (0.10 + 1/9)^2 / (0.74 + 1/9)^2 = 0.0326, whereas the table gives 0.046. I may be missing a difference in how the columns are aggregated, so it would help to explain that or recompute them from the same Gram matrices. This matters because the table is one of the main links between the free-feature theory and what the shared prompt actually reaches.
Questions for authors
For the three points above, could you clarify the meaning of the persistent offset and the simplex cancellation case, the sampling rule and achieved strength of the fixed random direction, and the aggregation used for the EuroSAT reachability row? Those clarifications would help me assess the mechanism and its supporting diagnostics.