- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper introduces a framework called "Latent Parity-Check Tokens" (LPCT), which incorporates concepts from cryptographic parity checks to detect alterations in the intermediate representations of Transformers, thereby providing explicit verifiability. LPCT augments semantic tokens by constructing a small number of protected parity-check tokens using a structured sparse connection pattern. When intermediate patch tokens are corrupted, the model recomputes the expected parity-check tokens based on the corrupted representations. Experiments conducted on CIFAR-100, Tiny ImageNet-200, and preliminary ImageNet-1K datasets evaluated the model's response to corruption—primarily random token erasure—affecting intermediate patch tokens in Vision Transformers (ViTs). The authors compared LPCT against standard ViTs, corruption-robust ViTs, register tokens, and NNCL. The results demonstrate that LPCT achieves strong AUROC performance in corruption detection while maintaining highly competitive classification robustness. In my view, the paper's primary contribution lies in leveraging cryptographic principles to enhance reconstruction or robustness, thereby introducing an effective approach for monitoring the latent states of Transformers.
Critical strengths
-
Introduction of Transformer intermediate state verification based on coding theory: The paper establishes a clear analogy between parity-check codes and Transformer representations—protected verification tokens impose structured consistency constraints on intermediate semantic tokens; any violation of these constraints generates a distinct "syndrome," thereby enabling the detection and localization of data corruption. This perspective offers profound insight, transcending traditional robustness objectives; conventional methods typically focus solely on maintaining downstream task accuracy without assessing the reliability of intermediate representations.
-
Leveraging the same structured verification token mechanism, LPCT not only identifies potential data corruption and determines which tokens are unreliable but also supports reconstruction in the event of token erasure failures. Experimental results demonstrate that the method achieves near-perfect corruption detection while maintaining competitive classification robustness.
Critical weaknesses
-
Limited practical relevance of the fault model. The paper mainly studies random intermediate-token erasure, a highly controlled setting that appears distant from common ViT failure modes in practice. Stronger evaluation should consider input-level image degradation, occlusion, missing regions, or signal loss, as well as more natural downstream tasks such as image restoration or inpainting. The paper should also more systematically evaluate LPCT’s impact on standard, uncorrupted inference, including accuracy and computational cost.
-
The experimental evidence is insufficient. Although the core idea is insightful, the evidence is largely limited to zero-token erasure. The paper should evaluate unknown error locations, nonzero perturbations, and more realistic fault types, and demonstrate whether detection and localization meaningfully improve downstream decisions or recovery. It should also better characterize sensitivity to architecture and training hyperparameters.
-
The writing and presentation need substantial improvement. Statistical reporting is inconsistent: some results include standard deviations while others do not. Detailed statistics could be moved to the appendix, while the main text focuses on the most important results. Figure 1 occupies considerable space but provides limited information and does not communicate the mechanism clearly; Figure 2 also has low information density and could be condensed or moved to the appendix. The overall use of main-text space is inefficient, particularly around the conclusion; the AI use statement should be shortened or relocated if permitted by the venue policy. More broadly, the current presentation does not adequately support the paper’s experimental claims.
Questions for authors
Requests for Clarification
- Could the authors provide a more robust justification for the practical significance of the "random intermediate-token erasure" method? In what real-world deployment scenarios would this specific failure model arise? Why is this model more applicable than alternatives such as input-level degradation, occlusion, missing visual regions, or feature corruption caused by transmission?
- Beyond classification accuracy on clean data, how does LPCT affect the standard (undistorted) inference process? Specific aspects to consider include calibration, latency, memory footprint, and robustness against common input corruptions. Addressing this is crucial for evaluating whether the verification mechanism imposes a significant cost in standard deployment scenarios.
Suggestions for Revision The concept is highly insightful; with more comprehensive experimental validation and a significantly improved presentation, it has the potential to gain widespread recognition. It is recommended that the authors: design experiments based on realistic scenarios; place the most critical decision-relevant results—which support the paper's core claims—in the main text while moving detailed statistics to the appendix; and redesign figures to increase information density, avoiding the use of AI-generated art for main figures. The current paper does not fully utilize the allotted nine-page limit; adopting a more rigorous and engaging presentation style would be highly beneficial.