- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper investigates whether informative-token grouping explains the effectiveness of content-aware scanning in vision SSMs. By disentangling Grouping, Information, Locality, and Position through controlled experiments, the authors challenge the conventional proximity hypothesis and propose an information-based explanation of scan-order performance.
Critical strengths
- Insightful experimental methodology. The paper's main contribution is its systematic separation of four interacting factors, grouping, information, locality, and position, rather than attributing performance improvements solely to token proximity. The factorial experiments and input-channel controls are particularly valuable.
- Comprehensive and transparent analysis. The authors provide extensive controlled experiments, including random permutations, oracle leakage analysis, scan-convolution removal, and causal/bidirectional comparisons. The proposed evaluation protocol is useful for future research.
Critical weaknesses
1. The proximity hypothesis may oversimplify existing content-aware scanning mechanisms.
Several underlying insights have been established in prior work, which the paper cites but does not sufficiently distinguish from its own contributions. QuadMamba (NeurIPS 2024) and MaIR (CVPR 2025) already emphasize spatial locality preservation; REOrder (NeurIPS 2025) demonstrates that ordering effectiveness depends on model- and task-specific properties; and Mamba-Reg (CVPR 2025) reveals positional sensitivity in Vision Mamba.
More fundamentally, H1 assumes that improvement depends solely on informative-token proximity. However, Content-Aware Mamba (ICLR 2026) groups content-similar tokens, not necessarily high-importance tokens. CFAR-based importance sorting does not reproduce this mechanism. Therefore, rejecting H1 may demonstrate the failure of an oversimplified hypothesis rather than invalidate the actual mechanisms of existing content-aware scanning methods.
2. The strongest improvements depend on oracle information rather than practical scanning methods.
In Figure 5, ground-truth ordering improves performance by +8.03 dB, whereas the supervised CNN scorer achieves only +0.69 dB and CFAR sorting degrades performance by −0.45 dB. The same information delivered through an input channel performs comparably or better.
Although oracle leakage is explicitly acknowledged and appropriately used for diagnostic experiments, the large oracle gains do not establish that practical content-aware scanning offers comparable benefits. The evidence supporting the proposed mechanism under deployable scanning strategies remains relatively limited.
3. The simplified testbed limits the generalizability of the conclusions.
Despite 1,108 trained models, the experiments primarily rely on a 0.69M-parameter SSM backbone, 32×32 inputs, and synthetic sparse restoration. The baseline learns the synthetic task relatively weakly, and longer training provides little improvement. The radar and natural-image controls are useful, but do not replace validation on representative Vision SSM architectures.
Consequently, it remains unclear whether the observed mechanisms generalize to established content-aware methods such as CAM or MambaIRv2. The conclusions appear broader than the experimental evidence supports.
4. The interpretation of “Information” in H3 needs greater precision.
For an input-derived permutation π = f(X), the ordering introduces no additional Shannon information beyond X. Its benefit instead concerns how effectively the backbone can access information already present in the input.
Furthermore, the factorial experiments manipulate selected-set spacing and selection precision, whereas Equation (1) measures grouping over the true informative set. At zero precision, both configurations report approximately zero true-support grouping gain, so this control does not demonstrate that substantially changing informative-token grouping has no effect without information.
The positive-precision matched comparisons remain valuable, but the proposed information-based explanation should distinguish target-related selection accuracy, realized grouping, and information accessibility.
Questions for authors
- How does the proposed H1 capture semantic-similarity-based grouping in existing methods, particularly CAM, rather than importance-based sorting alone?
- Can the authors clarify how the large oracle gains support the practical relevance of the proposed mechanism, given the relatively modest improvements from deployable scorers?
- Can the main conclusions be validated using an established, well-trained content-aware Vision SSM?
- Can the authors distinguish information-theoretic information, selection precision, and backbone accessibility, and clarify the zero-precision grouping control?
2 comments
We sincerely thank you again for your time and thoughtful review of our submission.
We apologize that our response was posted relatively late in the discussion period, and we understand this may have left you with limited time to review it. As the discussion period closes tomorrow, we would be most grateful if you could let us know whether our response has sufficiently addressed your concerns.
If any concerns remain, we would be happy to address them before the deadline. If they have been resolved, we would appreciate it if you could consider reflecting this.
Thank you for your consideration.
Response - similarity grouping, oracle vs. deployable gains, validation, and terminology
Thank you for a clear summary and for judging the soundness concerns fixable. The revision addresses each of them.
W1 / Q1 (H1 oversimplifies; CAM groups similar tokens). We agree. Section 2 now labels H1 as the strong form we formalise and states that its failure leaves room for a local effect of grouping. An importance sort does not reproduce similarity grouping, so we added it in both settings: k-means clusters of the local mean and standard deviation (MambaIRv2/CAM-style), with tokens ordered by cluster.
Section 9 now separates what is known from what we add. Known: locality preservation (QuadMamba, MaIR), the dependence of the best order on model and task (REOrder), and positional artefacts in Vision Mamba (Mamba-Reg). Added: random-permutation, locality, leakage and input-channel controls for per-image orders, and the anchor measured as a distance from a state reset.
W2 / Q2 (oracle gains vs. deployable scorers). We agree that the oracle gains say nothing about what deployable orders gain; ground-truth orders measure what the target information is worth. The deployable evidence is:
So a content-aware order helps by roughly as much as its scorer adds information the backbone does not already use. The protocol (Section 10) measures this with a random permutation, the same map as an input channel, and leakage controls.
W3 / Q3 (validation on an established content-aware SSM). Partially. We could not train the official CAM or MambaIRv2 code during the discussion. Instead we added a MambaIR-style network with a 3×3 depthwise convolution in every block, a four-direction scan and channel attention, trained on DIV2K denoising for up to 12k steps (Section 8). We also repeated the core testbed comparisons at 3.96M parameters (Appendix I).
This is not a validation on an established, fully trained model. Section 10 states this limitation, and the title and abstract now state the controlled scope.
W4 / Q4 (information, precision, accessibility; zero precision). We agree on both points.