- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
GeoCoCo compresses visual tokens for ultra-high-resolution remote sensing MLLMs without retraining the target model. It learns a codebook of low-dimensional image descriptors and a spatial co-occurrence mapping offline. At inference, connected regions guide aggregation of the original model's visual features. Planning runs on the CPU in parallel with GPU visual encoding.
The experiments across six MLLMs and three benchmarks show competitive accuracy with reduced latency.
Critical strengths
-
Separating compression planning from model features addresses a practical bottleneck in long visual sequences. The descriptors determine grouping while the original visual features retain the semantic representation.
-
The parallel execution benefit is directly measured. Table 8b reduces prefill from 1724 to 1141 ms and end-to-end latency from 3964 to 3294 ms under the same compression configuration.
-
Evaluation covers six MLLMs, multiple model families, and three remote sensing benchmarks. This supports the usefulness of the complete system beyond a single backbone.
-
The appendix includes descriptor, merging, budget, and resolution studies. It also reports low-resolution slowdowns, providing useful evidence about when the method helps.
Critical weaknesses
-
The novelty is not adequately established against closely related work. Visual BPE already learns merging rules from quantized symbols and spatial statistics [1, 2, 3]. SPiT separates content-aware tokenization from feature extraction [4], and PixelPrune makes compression decisions from pixels before visual encoding [5]. GeoCoCo differs by using a lightweight prior to aggregate features from a frozen MLLM, but these omitted connections narrow its methodological novelty. The contribution beyond combining established ideas needs a clearer justification.
-
The co-occurrence contribution is not cleanly isolated. Table 15 reports 48.9% accuracy for appearance-only merging and 49.7% for GeoCoCo, but the appearance-only control also removes the distance threshold. The comparison therefore changes both the merging rule and the appearance constraint. Since the learned co-occurrence prior is central to the method, this confound materially weakens the evidence for its contribution.
-
The main matched-budget comparisons focus on general compression methods. UHR-BAT appears as a separate model in Table 5, while the regional compression mechanism of DualComp is not directly compared. These results do not establish the advantage over the closest remote sensing approaches under comparable settings. Such a comparison would help determine the value of the proposed prior beyond regional aggregation itself.
-
The efficiency contribution has a narrower scope than the maximum reduction suggests. The 73.1% reduction is relative to an uncompressed model. On Qwen2.5-VL-7B, the gains over FastV are 6.7% in prefill and 7.2% end-to-end. Planning still takes about 650 ms, and smaller inputs become slower. These limitations are reported, but they make the practical advantage dependent on sufficient GPU work to hide CPU planning.
[1] From Pixels to Tokens: Byte-Pair Encoding on Quantized Visual Modalities. ICLR 2025.
[2] Unified Multimodal Understanding via Byte-Pair Visual Encoding. ICCV 2025.
[3] Multidimensional Byte Pair Encoding: Shortened Sequences for Improved Visual Data Generation. ICCV 2025.
[4] A Spitting Image: Modular Superpixel Tokenization in Vision Transformers. ECCV 2024 Workshop.
[5] PixelPrune: Pixel-Level Adaptive Visual Token Reduction via Predictive Coding. arXiv 2026.
Questions for authors
-
Please clarify the methodological contribution relative to [1, 2, 3, 4, 5]. What does the learned symbol mapping add beyond established visual BPE and content-aware regional tokenization?
-
Can the co-occurrence and appearance-only variants be compared with the same appearance constraint, codebook, final symbol count, and online pipeline? How stable is the resulting accuracy difference across evaluation samples or another existing experimental setting?
-
Can the closest compatible regional compression method be evaluated on the same backbone and token budget? If direct transfer is not feasible, please explain the relevant differences in model requirements and computation.
5 comments
Response to Reviewer VRYZ (Part 2/3)
[Weakness 3: The main matched-budget comparisons focus on general compression methods. UHR-BAT appears as a separate model in Table 5, while the regional compression mechanism of DualComp is not directly compared. These results do not establish the advantage over the closest remote sensing approaches under comparable settings. Such a comparison would help determine the value of the proposed prior beyond regional aggregation itself.]
-
Thank you for raising this concern. Table 3 directly compares training-free, plug-and-play token compression methods using the same backbone and matched visual token budgets to ensure fairness and comparability. UHR-BAT and GeoLLaVA-8K employ specialized remote sensing model designs rather than serving as general-purpose, plug-and-play compression modules. We therefore compare them as standalone remote sensing MLLMs in Table 5.
-
Regarding the comparison with DualComp [6], we would like to clarify that its publicly available implementation does not yet provide a complete end-to-end host-model adapter. Consequently, it cannot be directly evaluated under the same MLLM backbone, token budget, and evaluation pipeline as GeoCoCo for a controlled comparison. We additionally compare GeoCoCo with the results reported by DualComp on Qwen2.5-VL-7B at the same compression ratio:
Method Avg. Acc. (%) Compression Ratio GeoCoCo 49.0 10.24× DualComp 47.9 10.24× Note. DualComp results are reported in its original paper. Both use Qwen2.5-VL-7B at same compression ratios.
In this comparison, GeoCoCo outperforms DualComp by 1.1 percentage points. We would be happy to include this comparison in the revised manuscript.
[Weakness 4: The efficiency contribution has a narrower scope than the maximum reduction suggests. The 73.1% reduction is relative to an uncompressed model. On Qwen2.5-VL-7B, the gains over FastV are 6.7% in prefill and 7.2% end-to-end. Planning still takes about 650 ms, and smaller inputs become slower. These limitations are reported, but they make the practical advantage dependent on sufficient GPU work to hide CPU planning.]
- Thank you for raising this concern. Regarding the comparison with FastV, the fastest baseline, we would like to clarify that GeoCoCo achieves larger efficiency gains on other MLLM backbones. Table 3 shows that GeoCoCo reduces prefill time by 20.9% and 24.9% relative to FastV on InternVL3-8B and GeoLLaVA-8K, respectively, while also achieving higher accuracy. These results demonstrate GeoCoCo’s favorable accuracy–latency trade-off across different backbones.
- Regarding CPU planning time, CPU planning and GPU visual encoding can execute concurrently in GeoCoCo. CPU planning time therefore does not directly translate into additional inference waiting time, which is a key advantage of our framework. As shown in Table 8b, although CPU planning takes 650 ms, its independence from MLLM features allows it to overlap with 960 ms of GPU visual encoding. Under the same compression configuration, parallel execution reduces prefill time from 1724 to 1141 ms (−33.8%) and end-to-end latency from 3964 to 3294 ms (−16.9%), demonstrating the practical efficiency benefits of parallel planning. We analyze the latency increase at lower resolutions in Appendix C.3 and Table 14. This behavior is consistent with GeoCoCo’s focus on UHR remote sensing imagery: when the input contains fewer visual tokens, GPU visual encoding is too short to fully hide CPU planning overhead. As input resolution and visual token count increase, CPU–GPU parallel execution can more effectively hide planning overhead, while visual token compression reduces the cost of subsequent LLM processing.
[Question 1: Please clarify the methodological contribution relative to [1, 2, 3, 4, 5]. What does the learned symbol mapping add beyond established visual BPE and content-aware regional tokenization?]
-
Thank you for your question. We would like to clarify that the cited works differ fundamentally from GeoCoCo. To our knowledge, GeoCoCo is the first training-free framework for UHR remote sensing to use input images instead of high-dimensional MLLM features for visual token compression planning. This design decouples compression planning from MLLM feature computation and enables their parallel execution. Its core contribution is therefore not image tokenization, BPE, or image patch pruning. Please refer to our response to Weakness 1 for further details.
-
Regarding the learned symbol mapping, it does not redesign visual tokenization as visual BPE and content-aware regional tokenization do. Instead, it encodes cross-image co-occurrence statistics into a reusable regional compression prior to improve grouping quality and reduce online planning overhead.
Response to Reviewer VRYZ (Part 3/3)
[Question 2: Can the co-occurrence and appearance-only variants be compared with the same appearance constraint, codebook, final symbol count, and online pipeline? How stable is the resulting accuracy difference across evaluation samples or another existing experimental setting?]
- Thank you for your question. We additionally evaluated appearance-only merging using the same appearance distance threshold, codebook, final symbol count, and online pipeline as GeoCoCo, and assess the statistical significance for their accuracy difference. Under these matched settings, GeoCoCo achieves 0.8 percentage points higher accuracy, with a confidence interval that excludes zero. This supports the independent contribution of the co-occurrence prior and the statistical significance of the improvement. Please refer to our response to Weakness 2 for further details.
[Question 3:Can the closest compatible regional compression method be evaluated on the same backbone and token budget? If direct transfer is not feasible, please explain the relevant differences in model requirements and computation.]
- Thank you for your question. We provide an additional accuracy comparison between GeoCoCo and the results reported by DualComp on Qwen2.5-VL-7B at the same compression ratio. GeoCoCo outperforms DualComp by 1.1 percentage points. Please refer to our response to Weakness 3 for further details.
Thank you for taking the time to read our comments. If we have addressed your concerns, we sincerely hope you can reconsider and improve your evaluation of our work. If you have any other questions, we look forward to further discussions with you. We sincerely await your reply.
Warm regards,
All Authors of the Paper
[1] From Pixels to Tokens: Byte-Pair Encoding on Quantized Visual Modalities. ICLR 2025.
[2] Unified Multimodal Understanding via Byte-Pair Visual Encoding. ICCV 2025.
[3] Multidimensional Byte Pair Encoding: Shortened Sequences for Improved Visual Data Generation. ICCV 2025.
[4] A Spitting Image: Modular Superpixel Tokenization in Vision Transformers. ECCV 2024 Workshop.
[5] PixelPrune: Pixel-Level Adaptive Visual Token Reduction via Predictive Coding. arXiv 2026.
[6] Semantic-Geometric Dual Compression: Training-Free Visual Token Reduction for Ultra-High-Resolution Remote Sensing Understanding. ECCV 2026.
Response to Reviewer VRYZ (Part 1/3)
Dear Reviewer VRYZ,
Thank you for your thoughtful and thorough review of our manuscript. We truly appreciate the time and effort you dedicated to understanding our work, and your constructive comment. Below, we respond to each of the suggestions you raised. We hope our clarifications address your concerns and provide a clearer understanding of the contributions and empirical evidence of GeoCoCo.
[Weakness 1: The novelty is not adequately established against closely related work. The contribution beyond combining established ideas needs a clearer justification.]
[Weakness 2: The co-occurrence contribution is not cleanly isolated. Table 15 reports 48.9% accuracy for appearance-only merging and 49.7% for GeoCoCo, but the appearance-only control also removes the distance threshold. The comparison therefore changes both the merging rule and the appearance constraint. Since the learned co-occurrence prior is central to the method, this confound materially weakens the evidence for its contribution.]
Thank you for pointing this out. As stated in the contributions in the Introduction and in Section 3, GeoCoCo’s core contribution is to eliminate the dependence of compression planning on MLLM feature computation, thereby reducing overhead. The co-occurrence prior improves regional grouping quality within this framework; it is not a prerequisite for representation decoupling or parallel execution. To clarify its contribution, we additionally evaluate the appearance-only variant using the same appearance distance threshold, codebook, final symbol count, and online pipeline, and assess the statistical significance of its accuracy difference from GeoCoCo:
Note. Δ Acc. denotes the accuracy difference between GeoCoCo and the ablated variant. The 95% confidence interval is computed using paired bootstrap resampling on XLRS-Bench-lite with Qwen2.5-VL-7B at 80% token compression. Both methods use the same appearance distance threshold.
Under these matched settings, GeoCoCo outperforms appearance-only merging by 0.8 percentage points, with a 95% confidence interval that excludes zero. This provides further evidence for the independent contribution of the co-occurrence prior and the statistical significance of the improvement. We would be happy to include this result in the revised manuscript.