- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This work studies how visual information is utilized across LLM layers in VLMs. Through layer-wise causal masking, the authors identify a depth boundary separating early visual-information transport from later spatial readout. Based on this observation, they propose two methods: Depth-Weighted Attention (DWA), which aggregates attention patterns across decoder layers to localize informative regions for high-resolution re-encoding, and Adaptive Visual Resolution (AVR), which allocates more visual tokens to earlier layers while restricting visual-token access in later layers. The experiments report improved performance on several fine-grained visual reasoning benchmarks under the authors’ proposed token-budget setting.
Critical strengths
None.
Critical weaknesses
-
The manuscript suffers from weak logical flow and insufficiently polished presentation. For example, the 1st paragraph of the Introduction jumps from a specific example to broad claims about localization and perception without establishing the reasoning clearly. The Abstract is also unusually fragmented in multiple paragraphs, and several methodological details are missing for reliable reproduction.
-
The practical motivation of the proposed approach is not convincing. Modern Qwen-VL models already support dynamic-resolution image encoding, raising the question of why relevant regions need to be identified through the LLM decoder and then re-encoded at higher resolution. Although the authors argue that this avoids spending visual tokens on answer-irrelevant regions, DWA itself introduces substantial additional overhead: it requires two LLM prefill passes (one for localization and one for answering), extracting layer-wise attention maps prevents the use of FlashAttention, and the ridge-regression localizer should be fitted separately for different VLM families. The paper therefore lacks a convincing end-to-end analysis showing that the proposed token allocation actually provides a favorable accuracy–efficiency trade-off over the native dynamic-resolution mechanism.
-
The efficiency claim of AVR is overstated and not supported by actual runtime measurements. In the reported implementation, discarded visual tokens are only masked by adding a (-10^4) bias to their attention logits, while the token tensors remain at their original length. Therefore, no actual token reduction or computational saving is realized during inference. Consequently, the Abstract’s claim that AVR uses “only 14–18% of visual-token computation” is misleading without a physical token-removal implementation and corresponding wall-clock runtime measurements.
-
The method has a serious reproducibility issue. The main text states that the (2L+7)-dimensional feature vector includes rank, neighbourhood, and geometry features and explicitly refers to Appendix B for their definitions. However, Appendix B does not provide the concrete definitions of these additional features. Since these features are directly used by the ridge regressor to determine crop scores, omitting their exact formulation makes the proposed method impossible to reproduce faithfully from the paper alone.
-
The experimental section lacks direct comparisons with the competing methods discussed in Related Work. The main results primarily compare DWA/AVR against uncropped equal-budget VLM backbones, rather than representative existing approaches. As a result, the experiments demonstrate improvements over the authors’ own baselines, but do not establish whether the proposed methods are actually competitive with existing visual cropping or token-pruning approaches under matched settings.
-
The claimed 600-token compute budget raises reproducibility concerns across different VLM architectures. The main results treat 600 visual tokens as an equal-compute reference, while the appendix only states that images are bicubically resized toward a target token count and that the closest realized count is retained within a tolerance. However, models such as LLaVA-OV-7B and InternVL3-8B employ fixed-resolution vision encoders, even though their preprocessing pipelines may dynamically partition an image into multiple tiles. Their resulting visual-token counts are therefore constrained by model-specific tiling and tokenization schemes rather than being freely adjustable through image resizing. The paper does not explain how a 600-token budget (or the two approximately 300-token passes used by DWA) is actually realized for these models, nor does it report the realized token counts or tiling configurations. This makes the claimed matched-compute comparison difficult to verify.
Questions for authors
See the weaknesses.