- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper argues that consistency regularization for scalar regression is underspecified, since matching two views does not say which task information to preserve. Based on the linear readout, it separates what to match (the scalar prediction, or features with the readout and a label-residual direction projected out) from the target source (the online model or an EMA encoder). Three instances result: output consistency, output consistency with an EMA source, and angular consistency on the projected features. One instance is chosen per dataset, by validation where a validation split exists. With 250 labels, RGC reports the best mean results on UTKFace and Yelp and is competitive on BVCC. Crossover experiments suggest that the right consistency object depends on the task.
Critical strengths
-
The crossover experiments carry a useful message. The best consistency object depends on the task. On BVCC, where both views share the same audio segment, feature consistency beats output consistency in every seed. On Yelp, unprotected feature consistency instead collapses the representation, with effective rank falling from about 45 to below 4.
-
The method is also simple, adding no parameters or inference cost. Matched continuations from a shared checkpoint make the within-codebase comparisons credible.
Critical weaknesses
-
The technical contribution is smaller than the framing suggests. By the authors’ own description, C is ordinary weak–strong output consistency and TC is Mean-Teacher-like. On BVCC, T receives identical waveforms in both views, making it essentially dropout-based feature consistency with two directions projected out. Label protection improves MAE by only 0.0038 (Table 8), and without an unprojected control, it is unclear whether the readout geometry matters. The propositions are elementary and leave the choice of instance to validation.
-
The empirical gains are fragile. On Yelp and BVCC, the differences from the strongest baselines are within seed noise, and with 50 labels on UTKFace, RGC clearly trails SSR-RCUS. On UTKFace-250, C beats the reported Pi-Model and Mean Teacher by about 3.3 and 2.7 MAE despite being closely related to them. This gap likely reflects pipeline choices, but the baselines were copied rather than re-run.
Questions for authors
-
How do the UTKFace results change if checkpoints are selected on held-out training data, and did the copied baselines use the same selection convention?
-
The Yelp collapse in Figures 4 and 5 uses the readout-only variant. Why this variant, and does the label-protected T also collapse?
-
On BVCC, how does T compare with unprojected feature cosine consistency under the same views? This would show whether the readout geometry matters.
-
If Pi-Model and Mean Teacher are re-run in your pipeline with identical settings, how much of their roughly 3.3 and 2.7 MAE gaps to C remains?