- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper investigates whether rapid contextual learning suppresses spectral representation learning in serial spectral–spatial classifiers. It distinguishes three quantities: spectral information accessible from the encoder, contextual reliance of the fitted classifier, and performance recoverable by retraining a head on the frozen encoder. A solvable logistic model establishes how contextual readout replication and learning rate can suppress spectral coefficient adaptation at a fixed training margin. Synthetic experiments show that slowing the head improves spectral accessibility and subsequent recovery at matched training loss, while the original classifier remains strongly context-dependent. However, the recovery ordering reverses at equal training updates. Experiments using measured spectra reproduce several suppression and reliance effects, but rate interventions have inconsistent benefits, and natural neighbourhoods show reliance without a detected relative accessibility deficit.
Critical strengths
-
The separation of accessibility, reliance, and recovery is experimentally meaningful.
-
The authors seriously test alternative interpretations.
-
The main theorem is precise within its stated assumptions.
-
The natural-context diagnostics provide useful counterevidence.
Critical weaknesses
-
The headline rate benefit is strongly dependent on the stopping rule. The slow-head model reaches loss 0.30 after roughly 33,934 updates, compared with 1,789 for the fast-head model. Continuing the fast model to loss 0.10 produces recovery accuracy of 0.843, exceeding the slow model’s 0.756 at loss 0.30 while requiring fewer updates. At 40,000 equal updates, recovery is 0.917 for the fast model versus 0.778 for the slow model. Matching loss is a legitimate scientific comparison, and the authors explicitly acknowledge these results. Nevertheless, the evidence establishes a difference between learning trajectories at selected fit levels, rather than a persistent advantage in representation quality. This substantially limits the significance of slowing the head as an intervention. A clearer account of the scientific or downstream reason to prioritize matched-loss recovery would strengthen the contribution.
-
The theorem does not capture the paper’s central accessibility–reliance separation. The theorem bounds the displacement of a spectral coefficient in a noiseless model with a fixed spectral readout. This is different from establishing an information or decodability deficit: whenever , the centre representation remains perfectly linearly decodable, irrespective of how small the coefficient is. Moreover, under the main theorem’s zero-aggregate-readout initialization, sufficiently slow contextual learning eventually removes contextual reliance at matched margin. The experimental learned heads instead remain context-reliant while accessibility improves. Appendix A explicitly recognizes this distinction, and the nonzero-initialization extensions address part of it, but no theoretical result explains the differential recoverability that anchors the empirical contribution. The theory therefore supplies a sufficient mechanism for suppressed adaptation, with a substantial gap to the observed representation phenomenon.
-
The measured-spectrum experiments establish constructed failure modes more strongly than a general explanation of natural spectral–spatial learning. The low-accessibility tissue experiments use whitening and artificial class-associated neighbour signals. These are useful controlled constructions, but they deliberately create the conditions needed for competition. The natural-neighbourhood experiments do not detect the corresponding relative encoder-accessibility deficit. More importantly, the proposed rate response does not consistently transfer across Pavia, Salinas, and HeiPorSPECTRAL. Neighbour-gradient blocking yields a large matched-loss benefit on tissue but does not reproduce its primary benefits on HeiPorSPECTRAL. The amplitude and route-share analyses also fail to provide a reliable predictor of intervention success. Thus, the paper establishes that the mechanism can occur, but offers limited explanatory power for when it occurs or when intervention helps.
-
Recovery to a weak comparator leaves important representation questions unresolved. On natural Pavia neighbourhoods, fresh-head recovery reaches approximately 0.629 macro-F1, matching the shuffled-context comparator’s 0.627. However, the raw-spectrum MLP reaches 0.911. Matching that comparator therefore establishes relative recovery under the chosen protocol, not that the encoder preserves the information needed for strong centre-spectrum classification. The authors appropriately investigate this with centre-only retraining and converged logistic regression. Those controls substantially strengthen the tissue findings, but leave the Pavia gap unresolved: centre-only nonlinear retraining remains budget-limited, and the linear comparison still shows a gap to raw-band features. This limits how confidently the natural-context results can locate the failure primarily in the head.
-
The conceptual novelty is narrower than the overall experimental volume suggests. Suppression of predictive features is established in Gradient Starvation. Separating classifier reliance from representation quality through retraining is central to Izmailov et al., and conditions under which representations fail to support later probing are studied by Ye et al.. The manuscript acknowledges these precedents. Its distinctive contribution is consequently the within-architecture module-rate intervention, the dependence of its ranking on the comparison point, and its investigation in spectral–spatial settings. Those are useful additions, but the inconsistent transfer and limited theoretical connection make their broader significance less established. A sharper statement of the new explanatory insight would help more than additional experimental variants.
Questions for authors
-
What makes matched training loss the scientifically decisive comparison? Given that continued fast-head training yields better recovery with fewer updates, which conclusion or downstream use specifically benefits from the matched-loss ordering? Can the existing checkpoints establish how consistently that ordering holds across common loss thresholds?
-
Can the theoretical model reproduce differential accessibility and recovery while both classifiers remain context-reliant? A minimal noisy extension or learned spectral readout would help connect coefficient adaptation to the paper’s principal empirical finding.
-
What evidence distinguishes neighbour-gradient competition from training-duration effects in the blocking experiment? The existing equal-update controls show an early negative effect and a later positive effect. Can trajectory-level measurements explain this transition and the contrasting HeiPorSPECTRAL result?
-
How much of the natural-Pavia recovery shortfall is attributable to the frozen representation? A converged centre-only nonlinear readout, compared with the same readout on raw spectra and shuffled-context encoders, would directly address the ambiguity left by Table 24.
-
What transferable prediction follows from the study beyond the controlled synthetic setting? Since initial accessibility and route share do not reliably predict the rate benefit, can the authors identify a supported condition for its occurrence, or explicitly frame the main contribution as a stopping-rule-sensitive empirical finding?
Dear Reviewer YWfS,
Can you please take a look at the authors' response and provide your further input? Thank you.
AC.