- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes PixelPrune, a method targeting high-resolution document and GUI scenarios that eliminates pixel-level redundancy via predictive coding prior to the vision encoder. Operating on pixel blocks aligned with the patch merger, the method predicts each block from its previously visited spatial neighbors, retaining only those that cannot be accurately predicted while preserving their original spatial coordinates. The exact matching mode requires no learned selector and guarantees exact pixel-level recoverability, whereas the near-exact matching mode further allows controlled reconstruction error. Experiments cover training-free document understanding, GUI question answering, GUI grounding adapted via knowledge distillation, and training with compressed inputs. The authors report a 3.0–4.2× TTFT speedup across two representative scenarios and an approximate 1.9× training speedup in the evaluated GUI training setup.
Critical strengths
-
Clear problem formulation supported by concrete bottleneck analysis. The paper targets the computational cost of visual encoding under high-resolution inputs rather than solely reducing the number of visual tokens fed into the LLM. As shown in Figure 2, at a resolution of 4096 × 4096, the vision encoder accounts for 86%, 72%, and 75% of total prefill latency for Qwen3-VL-2B, 4B, and 8B, respectively. This evidence effectively links input redundancy, computational bottlenecks, and the motivation for pre-ViT compression.
-
Simple, low-overhead method with strong accuracy under the default setting. The exact matching mode (τ = 0) requires no learned selector and does not rely on neural features or attention maps. Under a matched per-image token budget, PixelPrune achieves an average score of 68.3 across seven document understanding benchmarks on Qwen3-VL-2B, remaining close to Full (69.2) while outperforming all compared compression baselines. Matching the token budget on a per-image basis is a sound experimental design that controls for confounding factors more effectively than matching only dataset-level average retention ratios.
-
Practical inference latency and memory measurements beyond token counts or theoretical FLOPs. Table 5 reports selector overhead, ViT latency, TTFT, and KV cache memory alongside FLOPs. These empirical measurements provide direct evidence that pre-ViT compression translates into tangible system-level gains, strongly supporting the practical value of the proposed approach.
Critical weaknesses
-
Lack of quantitative comparison with IndexPrune, a closely related pre-ViT document compression method. Although IndexPrune is discussed in the Related Work section, it is not included in the experimental evaluation. The current experiments primarily compare against three post-ViT methods and two simple pre-ViT controls (Random and ConnComp), making it difficult to assess the practical advantages and trade-offs of the proposed predictive coding approach relative to this closely related baseline. A comparison on representative document benchmarks, or a clear explanation of why a fair comparison is infeasible, would help better establish the independent contribution of this work.
-
The task-level interpretation of pixel-level recoverability goes beyond the theoretical guarantee. Proposition 1 establishes that a deterministic decoder applying the same prediction rule can reconstruct the original pixels from the compressed representation. During inference, however, the retained patches are fed directly into the VLM without reconstructing the omitted patches. Therefore, pixel-level recoverability does not necessarily imply equivalent feature representations or information aggregation after pruning. In Section 4.3.1, the authors attribute the performance degradation on GUI grounding to the mismatch between full-token training and pruned inference rather than information loss. However, this causal interpretation does not directly follow from Proposition 1. Although knowledge distillation restores performance, this result alone does not establish the mismatch as the sole cause of degradation. The authors should distinguish pixel-level recoverability from task-level performance preservation and moderate the corresponding claims accordingly.
Questions for authors
-
Comparison with IndexPrune: Why was IndexPrune omitted from the experimental comparisons? Could the authors provide a comparison of accuracy, token retention ratio, and actual computational overhead on representative document benchmarks under the same backbone and input preprocessing settings? Such a comparison would help clarify the advantages and trade-offs of parameter-free predictive coding relative to learned text-saliency selection. If there are specific implementation or reproducibility challenges, please clarify.
-
Recoverability and the interpretation of performance degradation: Beyond the performance recovery observed after knowledge distillation, is there additional evidence supporting the attribution of GUI grounding degradation to the training–inference mismatch discussed in Section 4.3.1? In particular, can the authors distinguish the effects of sparse spatial layouts from other changes in feature representations and information aggregation caused by token deletion?
Dear Reviewer 3hX9,
As the discussion period is nearing its end, we would appreciate your feedback on our rebuttal. We have provided additional results on resolution reduction, more aggressive compression, and latency comparisons under matched token budgets in response to your questions.
Could you please let us know whether these results address your concerns, and which concerns, if any, remain unresolved? We would be happy to clarify further.
Thank you for your time and consideration.