betaFeedback

WorksComputer Science

ResVision: Spectrum-Matched Resizing and Context-Preserving Inspection for Visual Reasoning

Abstract

Agentic visual reasoning improves vision-language models by selectively enlarging evidence without adding new scene content, but the benefit depends on whether fine structure remains accessible and whether local observations stay grounded in the full scene. We identify three recurring bottlenecks: high-frequency detail can be attenuated during visual-token formation; spatially distributed evidence can remain encoded yet difficult for the language model to retrieve; and isolated crops can weaken whole-detail correspondence through scale and positional mismatch. ResVision addresses these limitations with two complementary components. Spectrum-Matched Resizing (SMR) estimates image complexity and selects an adaptive global sampling scale, avoiding unnecessary enlargement on simple inputs while allocating more visual tokens to detail-rich images. Context-Preserving Inspection (CPI) returns each inspected crop together with the complete working view, preserving local detail and global context across tool turns. We evaluate Direct and Agentic variants on four frontier VLMs and 29 benchmarks spanning six visual-reasoning families. Complete ResVision (Agentic Base plus SMR plus CPI) is best for every model, improving by 3.36 to 4.94 points over Direct Base and 1.87 to 2.94 points over Agentic Base. These results show that adaptive visual sampling and context-preserving inspection address distinct, complementary constraints in multimodal reasoning.

Project Page: https://pevek.ai

Resources: GitHub · HuggingFace · ModelBlog

Figure 1. Accuracy across six benchmark families and four VLMs. ResVision denotes SMR in Direct mode and SMR+CPI in Agentic mode; values are three-run means.

Introduction

Agentic visual reasoning often improves the accuracy of vision-language models (VLMs) over direct inference through iterative visual inspection [3, 29, 46, 42, 18]. The model selects a region, enlarges it, examines the result, and decides where to inspect next. Yet these operations introduce no new scene content and merely change how existing pixels are presented to the model. This raises a fundamental question: how can changes in visual presentation substantially alter reasoning performance?

We investigate this puzzle through a systematic analysis of visual tokenization and its effects on downstream reasoning [13, 28, 12, 4, 36, 35, 5], identifying three mechanisms. Figure 2 illustrates the first two across Stages 1–3 of visual-token processing. When a full image is encoded, fine details may be attenuated within individual visual tokens, reflecting an Intra-Token Bandwidth Limit. By contrast, evidence distributed across neighboring tokens may remain encoded but difficult to retrieve during reasoning, resulting in a Contiguous-Token Retrieval Breakdown. Cropping and enlargement can alleviate both limitations by reallocating visual tokens to selected regions. However, image dimensions alone cannot determine the appropriate scale: a smooth photograph, a dense diagram, and a fine texture can have similar dimensions yet require different sampling densities [25, 44, 19].

Three mechanisms: (a) Where presentation enters the visual-token path, showing Input image, Stage 1 patch projection, Stage 2 contextualization, Stage 3 spatial merge, and Stage 4 LLM input, with SMR scale before tokenization and CPI preserve whole–detail context; (b) Intra-token attenuation; (c) Cross-token retrieval; (d) Whole–detail reference gap

Figure 2. Three mechanisms underlying the benefits and failures of agentic inspection. Fine details may be attenuated within visual tokens; distributed evidence may be difficult to retrieve; and isolated crops may weaken whole–detail correspondence. SMR targets evidence accessibility by adapting scale before tokenization, while CPI targets correspondence by retaining the complete working view with each inspected detail.

The third mechanism arises when a selected crop is re-encoded as an independent image at Stage 4. The crop has a new origin and scale, while surrounding objects, competing candidates, and spatial landmarks are excluded from the local view. This creates a potential Whole–Detail Reference Gap: the detail becomes easier to see but harder to locate within the full image, compare with alternatives, or interpret in context [32, 47]. A clearer crop can therefore lead to a less accurate answer than the complete image alone. Reliable agentic reasoning must make fine details accessible while preserving their correspondence to the full scene.

We introduce ResVision, a training-free framework that addresses these challenges through two complementary techniques. Spectrum-Matched Resizing (SMR) estimates each image’s fine-structure demand and selects the minimum global scale that places representative spatial frequencies within the visual-token passband under a bounded visual-token budget. Using the resulting working view, the VLM selects regions for closer inspection. Context-Preserving Inspection (CPI) returns each enlarged crop alongside the complete working view as separate, labeled image inputs. The crop provides local detail, while the complete view retains the spatial context and alternative evidence needed for interpretation. SMR adapts global sampling, the VLM selects where to inspect, and CPI maintains the full-image reference.

We evaluate these mechanisms through controlled diagnostics and downstream reasoning tasks. Mechanistic probes trace representations from patch projection to the positioned image blocks provided to the language model, revealing information attenuation, retrieval failure, and weakened whole–detail correspondence. Across four VLM families and 29 benchmarks, complete ResVision (Agentic Base+SMR+CPI) reaches a four-model mean Macro-29 of 75.93, improving by 3.88 points over Direct Base and 2.28 points over Agentic Base (VISTA). The gains hold for every model: 3.36–4.94 points over Direct Base and 1.87–2.94 points over Agentic Base. Focused component ablations on five diagnostic benchmarks further demonstrate the complementary contributions of SMR and CPI.

Our contributions are threefold. (1) We identify three mechanisms underlying agentic visual reasoning: Intra-Token Bandwidth Limit, Contiguous-Token Retrieval Breakdown, and Whole–Detail Reference Gap, explaining both the benefits and failure modes of local inspection. (2) We introduce SMR, which replaces fixed visual-token allocation with an image-adaptive rule that selects the minimum global scale needed to place representative spatial frequencies within the visual-token passband. (3) We introduce CPI, which pairs each selected crop with the complete working view, preserving a full-image reference for locating, comparing, and interpreting local evidence throughout multi-turn reasoning.

Diagnosing Visual-Token Bottlenecks

VLMs encode images into finite sequences of visual tokens before reasoning. We use Qwen 3.8-Flash-Next (Qwen 3.8) to trace visual evidence through tokenization and downstream reasoning, diagnosing three mechanisms along this path (Figure 2). Fine structure can be attenuated within individual tokens; evidence can remain encoded across neighboring tokens yet be difficult to retrieve; and an independently encoded crop can become harder to relate to the complete image. The first two mechanisms concern accessibility, explaining why changes in presentation can help without introducing new scene content. The third concerns correspondence, explaining why clearer local evidence can still yield a worse answer.

Intra-Token Bandwidth Limit

The first diagnostic examines whether the visual encoder preserves fine cues in a usable form. A narrow gap or small symbol can be present in the source image yet attenuated when compressed with surrounding texture during tokenization. This distinguishes information present in the image from information accessible to the model. Let qq denote the question, GG the complete input image, YY the answer, UsU_s isotropic resizing by a factor ss, and II mutual information. Deterministic resizing satisfies the data-processing bound

I(Y;Us(G)∣q)≤I(Y;G∣q).(1)I(Y;U_s(G)\mid q) \le I(Y;G\mid q). \tag*{(1)}

Different presentations of the same scene content can nevertheless yield different visual representations. Resizing changes how existing structure is sampled and allocated to visual tokens. For enlargement with s≥1s \ge1, a spatial frequency ff is presented at f/sf/s. If the encoder response A(⋅)A(\cdot) is non-increasing over [f/s,f][f/s,f], then

fscaled=f/s,A(f/s)≥A(f).(2)f_{\mathrm{scaled}} = f/s,\qquad A(f/s) \ge A(f). \tag*{(2)}

This motivates selecting a scale that moves fine structure into a frequency range the encoder represents more faithfully. We compare the Stage-1 patch projection with the Stage-3 final visual tokens using three probes (Figure 3). Amplitude retention. At Stage 3, T(f)T(f) decreases from 0.995 at DC to 0.447 at eight cycles per token, while the Stage-1 response remains substantially stronger. Linear recoverability. The recoverability cutoff of R2(f)R^2(f) shifts from above 16 cycles per token at Stage 1 to 0.77 at Stage 3. Spatial-phase sensitivity. Opposite-phase gratings remain well separated at Stage 1 at the tested frequencies above two cycles per token, whereas their Stage-3 distance is nearly zero. Together, these probes characterize an effective visual-token bandwidth: fine structure present in the input becomes attenuated, less linearly recoverable, and harder to distinguish in the final visual representation.

Fine-structure accessibility across visual encoding stages

Figure 3. Fine-structure accessibility across visual encoding stages. Probes on Qwen 3.8 compare Stage-1 patch projections with Stage-3 final visual tokens. (a) T(f)T(f) measures amplitude retention. (b) R2(f)R^2(f) measures linear recoverability. (c) Opposite-phase distance measures sensitivity to spatial arrangement. Together, the probes show reduced amplitude retention, linear recoverability, and phase sensitivity at high frequencies after full visual encoding.

Contiguous-Token Retrieval Breakdown

Evidence can remain encoded across neighboring visual tokens yet be difficult to assemble during reasoning. We examine how a coherent pattern is represented when it crosses a token boundary, and whether the model can use information distributed across the complete token grid. Figure 4 presents the boundary and counting probes.

Boundary sensitivity and count retrieval across visual tokens

Figure 4. Boundary sensitivity and count retrieval across visual tokens. (a) A fixed pattern moves from a token center toward its boundary. The position-normalized response is mirrored about the boundary, showing sensitivity to token grid alignment. (b) A trained linear readout recovers all evaluated counts from the frozen Stage-3 token grid, while the language model’s counting accuracy drops at and above one object per token.

Token-boundary response. We move the same pattern from a token center toward its boundary while holding appearance and scale fixed. Figure 4(a) plots the position-normalized response and mirrors the sweep about the boundary. At Stage 1, similarity to the token-centered pattern drops sharply as the pattern is divided across neighboring tokens. Stage-3 contextualization retains more of the cue, but the representation remains sensitive to grid alignment. The same structure is therefore represented differently when it lies within a token region and when it straddles a boundary. Resizing changes where structures fall on the token grid, linking presentation scale to this boundary sensitivity.

Encoded count versus retrieved count. We place K∈{6,8,10,12,15,18,20}K \in\{6, 8, 10, 12, 15, 18, 20\} objects across M=10M = 10 horizontal token positions. For each KK, we generate 60 strips, using 45 to train a diagnostic readout and 15 for evaluation. The VLM remains frozen. Its complete Stage-3 token grid is concatenated in spatial order, and a ridge-regularized linear classifier is trained to predict KK. We present the same evaluation images to the language model and measure exact-count accuracy and the probability assigned to the correct integer. The results are shown in Figure 4(b).

On the evaluation set, the trained readout recovers every count from the frozen Stage-3 grid. The language model’s exact-count accuracy is 93.3–100.0% for K/M<1K/M < 1, falls to 26.7% at K/M=1K/M = 1, and reaches 0% above that density. This readout–generation gap distinguishes encoded count information from the model’s ability to retrieve, organize, and enumerate it during generation. Together, the probes characterize a contiguous-token retrieval bottleneck and motivate adjusting presentation scale to improve how evidence is distributed over the token grid.

Whole–Detail Reference Gap

The third diagnostic examines whether an enlarged detail remains correctly associated with its source scene. Crop-and-zoom can alleviate the first two bottlenecks, but Qwen 3.8 processes the crop as a separate image at Stage 4, with its own scale and 2D rotary position frame. Surrounding landmarks and competing evidence are excluded from this local view. The resulting representation therefore changes both the visibility of the detail and its relationship to the complete image.

To describe the coordinate change, let crop BB have top-left source coordinate (r0,c0)(r_0, c_0), let (Δr,Δc)(\Delta r, \Delta c) be a point’s offset within BB, and let sloc≥1s_{\mathrm{loc}} \ge1 be the linear scale factor. In continuous image coordinates, the same source point has whole-image and crop-local coordinates

(r,c)whole=(r0+Δr,c0+Δc),(r,c)crop=(slocΔr,slocΔc).(3)(r, c)_{\mathrm{whole}} = (r_0 + \Delta r, c_0 + \Delta c), \\ (r, c)_{\mathrm{crop}} = (s_{\mathrm{loc}}\Delta r, s_{\mathrm{loc}}\Delta c). \tag*{(3)}

The crop resets the image origin and changes the source-pixel stride to 1/sloc1/s_{\mathrm{loc}} per output pixel. Position IDs specify locations within each image, while whole–detail correspondence requires relating the crop frame to the source frame. The model must establish this relation across separate image blocks and interaction turns.

We evaluate this correspondence on 50 BabyVision images. For each image, a selected crop is presented at scales from 1×1\times to 4×4\times, and the model is asked to ground its detail in the complete scene. Figure 5 compares three conditions: an isolated crop under scale mismatch, an isolated crop after positional reset, and the crop presented jointly with the complete image. At each scale, the local crop content is held fixed across conditions. Joint presentation maintains 72% grounding accuracy across all tested scales, whereas isolated

Figure 5. Whole–detail grounding with and without the complete image. On 50 BabyVision images, pairing the crop with the complete image maintains 72% grounding accuracy across the tested scales from 1× to 4×. Isolated crops achieve 40–58% accuracy at 1.5×–4×.

crops achieve 40–58% at 1.5×–4×. The complete view supplies landmarks, alternative candidates, and a spatial reference for interpreting the enlarged detail. A complementary representation-level diagnostic in the supplementary material shows that identical Stage-1 patch features diverge after contextual encoding and crop-local position assignment. These results motivate presenting every selected detail alongside the complete working view to maintain whole–detail correspondence.

The ResVision reasoning loop

Figure 6. The ResVision reasoning loop. Spectrum-Matched Resizing selects an image-adaptive global scale and constructs a fixed working view. The VLM selects a region for closer inspection, and Context-Preserving Inspection returns its enlarged crop alongside the complete working view as separate, labeled image inputs. The VLM uses both views to answer or select the next region.

Method

The diagnosis motivates two design requirements: adapt visual sampling to image structure and preserve the scene reference for each local observation. ResVision implements these requirements in a training-free framework. Before inference, Spectrum-Matched Resizing (SMR) constructs a fixed, image-adaptive working view. The VLM reasons over this view and selects regions for closer inspection. Context-Preserving Inspection (CPI) returns each enlarged crop alongside the same complete working view. The components act at distinct points along the evidence path: SMR controls how scene structure is sampled before tokenization; agentic inspection concentrates evidence in selected regions; and CPI keeps each local observation jointly available with its source-scene landmarks.

Spectrum-Matched Resizing

SMR is designed to bring representative image frequencies into the encoder passband at minimum visual-token cost, before Stage-1 sampling. For an input image GG of width WW and height HH, let pp be the effective pixel stride per Stage-3 visual token and ff a spatial frequency in cycles per source pixel. After isotropic resizing by a factor s>0s > 0, the same pattern has token-relative frequency

νf(s)=pfs(4)\nu_f(s) = \frac{pf}{s} \tag*{(4)}

in cycles per visual token. Its visual-token cost is

N(s)≃s2WHp2.(5)N(s) \simeq\frac{s^2WH}{p^2}. \tag*{(5)}

Increasing ss lowers the token-relative frequency but increases token cost quadratically. SMR uses these relations to select a scale from image structure under a visual-token budget.

Active-region spectral estimate. We compute the grayscale gradient magnitude, partition it into p×pp \times p tiles, and retain the fraction ρ∈(0,1]\rho\in(0, 1] with the highest gradient energy. These active tiles emphasize structured regions even when they occupy a small part of the image. After subtracting each retained tile’s mean, we aggregate its non-DC Fourier power into a radial spectrum P(ω)P(\omega), where ω\omega is radial spatial frequency in cycles per source pixel. For nonzero total power and an energy-quantile level η∈(0,1)\eta\in(0, 1), we define

fη=inf⁡{f:∑0<ω≤fP(ω)∑ω>0P(ω)≥η}.(6)f_\eta= \inf\left\{ f : \frac{\sum_{0<\omega\leq f} P(\omega)}{\sum_{\omega>0} P(\omega)} \geq\eta\right\}. \tag*{(6)}

Smooth content yields a lower fηf_\eta, while dense diagrams and fine textures yield a higher value. The energy quantile summarizes the dominant structural frequencies and reduces sensitivity to isolated high-frequency components from noise or compression artifacts. All images use the same estimation procedure.

Minimum-cost frequency matching. Let τ>0\tau> 0 denote the target frequency limit in cycles per visual token. The frequency-matching objective is

min⁡s>0  N(s)s.t.pfηs≤τ,(7)\min_{s>0}\; N(s) \quad\text{s.t.} \quad\frac{pf_\eta}{s} \leq\tau, \tag*{(7)}

whose solution is s0=pfη/τs_0 = pf_\eta/\tau. For an admissible token interval [Nmin⁡,Nmax⁡][N_{\min}, N_{\max}] with 0<Nmin⁡≤Nmax⁡0 < N_{\min} \le N_{\max}, the scale bounds are

smin⁡=Nmin⁡p2WH,smax⁡=Nmax⁡p2WH.(8)s_{\min} = \sqrt{\frac{N_{\min}p^2}{WH}}, \qquad s_{\max} = \sqrt{\frac{N_{\max}p^2}{WH}}. \tag*{(8)}

We clip the target scale to [smin⁡,smax⁡][s_{\min}, s_{\max}]:

s⋆=clip⁡(pfητ,smin⁡,smax⁡).(9)s^\star= \operatorname{clip}\left(\frac{pf_\eta}{\tau}, s_{\min}, s_{\max}\right). \tag*{(9)}

The clipping step constrains the target scale to the admissible range. The lower bound maintains a minimum sampling resolution, while the upper bound controls token use. Smooth content remains compact, whereas dense diagrams, text, and fine textures receive more sampling capacity. Images with zero non-DC power use smin⁡s_{\min}.

A fixed working image. The selected scale defines the working image Gˉ=Us⋆(G)\bar{G} = U_{s^\star}(G), with dimensions aligned to the backend grid and aspect ratio preserved up to rounding. The initial input, every crop, pixel measurement, and repeated complete view are derived from Gˉ\bar{G}. Tool coordinates use this same working-image frame throughout the interaction. For multiple input images, their order is preserved under a shared total visual-token budget. When SMR is disabled, Gˉ=G\bar{G} = G and the backend applies its standard preprocessing.

Context-Preserving Inspection

CPI returns the fixed working view with every newly rendered crop at Stage 4, placing the source scene alongside the local observation. At inspection step tt, the VLM selects a region BtB_t in Gˉ\bar{G}. The shared detail renderer produces

Lt=Ulocal(CBt(Gˉ)),(10)L_t = U_{\mathrm{local}}(C_{B_t}(\bar{G})), \tag*{(10)}

where CB(X)C_B(X) denotes the crop of image XX inside box BB, and UlocalU_{\mathrm{local}} is the local enlargement operator.

For an image XX, let ZXZ_X denote its backend-encoded image-token block. CPI supplies the complete working view and the enlarged crop as separate, labeled image inputs, giving the visual reply

Rt=ZGˉ⊕ZLt,(11)R_t = Z_{\bar{G}} \oplus Z_{L_t}, \tag*{(11)}

where ⊕\oplus denotes ordered concatenation of labeled image blocks. The backend assigns each image block its standard image positions. Joint presentation makes the enlarged detail and its grounding landmarks available within the same input. For multi-image questions, ZGˉZ_{\bar{G}} denotes the complete ordered set of working-image blocks, including images not selected for inspection.

The same local appearance can support different answers in different scenes. Let y⋆(q,X)y^\star(q, X) be the correct answer to question qq for image XX. Two scenes can satisfy

CB(G(1))=CB(G(2)),y⋆(q,G(1))≠y⋆(q,G(2)).(12)\begin{aligned} C_B(G^{(1)}) &= C_B(G^{(2)}),\\ y^\star(q, G^{(1)}) &\ne y^\star(q, G^{(2)}). \tag*{(12)} \end{aligned}

The complete view supplies the scene information that distinguishes these cases and associates the visible cue with its source. In CPI, both views originate from the same fixed Gˉ\bar{G}: the complete view provides the working coordinates and scene layout, while the crop exposes the selected region at greater detail.

Let EtE_t denote the visual input history after tt crop inspections. The initial view and successive replies accumulate as

E0=ZGˉ,Et=Et−1⊕Rt.(13)E_0 = Z_{\bar{G}}, \qquad E_t = E_{t-1} \oplus R_t. \tag*{(13)}

Each new detail thus arrives with a current scene reference. Earlier crops remain available for comparison, while the repeated complete view provides the context needed to establish the detail’s identity, position, scale, and meaning. Pixel-reading requests return textual color values sampled from Gˉ\bar{G}.

Experiments

We first evaluate two inference modes on a broad 29-benchmark suite. Direct mode compares Direct with Direct+ResVision, where ResVision contributes its SMR front end without tools. Agentic mode compares Agentic with Agentic+ResVision, where ResVision contributes the complete SMR+CPI system. Intermediate Agentic variants are retained as component ablations rather than main methods. We then use the original five-benchmark diagnostic slice for focused allocation, robustness, and latency analyses.

Experimental Setup

The main evaluation combines 26 MM400-aligned benchmarks with BabyVision [7], VLMsAreBiased [40], and BLINK [14]. The resulting 29 benchmarks span mathematical and logical reasoning, chart and OCR understanding, hallucination and counting, embodied and spatial reasoning, medical and world knowledge, and general visual understanding. We report Macro-29, the equal-weight mean of the 29 benchmark accuracies, so large datasets do not dominate the aggregate.

We evaluate four frontier VLMs: Kimi-K3 [30], Qwen3.8-Flash-Next [33], GLM-5.3-Flash [48], and DeepSeek-V4.1-Flash-1017 [11]. Direct uses no visual tools, while Direct+ResVision adds SMR. Agentic is VISTA [18]; Agentic+ResVision combines the same inspection loop with SMR and CPI. Both Agentic configurations share the same four-call tool ceiling. Every configuration uses temperature 0, the model’s maximum reasoning-effort setting, a 65,536-token generation ceiling, and three independent runs.

Main Results on 29 Benchmarks

Agentic+ResVision is best for every model. It reaches 76.90 on Qwen3.8, 79.02 on Kimi-K3, 71.97 on DeepSeek, and 75.83 on GLM (Table 1). Relative to Direct, the respective gains are 4.94, 3.36, 3.57, and 3.67 points; relative to Agentic, they are 2.94, 2.42, 1.87, and 1.88 points. Averaged equally across models, the complete system scores 75.93, compared with 72.05 for Direct and 73.65 for Agentic—gains of 3.88 and 2.28 points, respectively.

ModelDirectDirect+ResVisionAgenticAgentic+ResVision
Qwen3.8-Flash-Next71.9674.7273.9676.90
Kimi-K375.6677.3076.6079.02
DeepSeek-V4.1-Flash68.4070.0270.1071.97
GLM-5.3-Flash72.1673.9273.9575.83
Four-model mean72.0573.9973.6575.93

Table 1. Macro-29 accuracy under the four main conditions. Direct+ResVision enables SMR; Agentic+ResVision enables the complete SMR+CPI system. Each entry is the equal-weight mean over 29 benchmarks and three runs.

Both presentation and inspection contribute consistently. Direct+ResVision raises the four-model mean from 72.05 to 73.99, with per-model gains of 1.62–2.76 points, demonstrating that adaptive global presentation helps even without tool use. Agentic Base itself averages 73.65, 1.61 points above Direct, while complete ResVision adds another 2.28 points over Agentic Base. Thus neither a better initial presentation nor inspection alone explains the final result. The focused component analysis below separates the intermediate Agentic+SMR and CPI-only variants.

The two components remain complementary. Without SMR, CPI improves Agentic Base by 1.10–1.97 points (Table 2); Agentic+SMR and CPI-only average 75.10 and 75.07, respectively. Complete ResVision reaches 75.93 and exceeds the stronger single-component variant by 0.40–0.94 points in every model. This supports the intended interpretation of ResVision as Agentic Base+SMR+CPI rather than either component in isolation.

ModelAgentic Base+SMR+CPI+SMR+CPI
Qwen3.8-Flash-Next73.9675.9675.0676.90
Kimi-K376.6078.2778.5779.02
DeepSeek-V4.1-Flash70.1070.8771.5771.97
GLM-5.3-Flash73.9575.3075.0975.83

Table 2. CPI-only component ablation. Macro-29; complete ResVision enables SMR+CPI.

The gains are broad but not uniform across tasks. Complete ResVision is the unique best main condition on 21 of 29 benchmarks for Qwen3.8, 16 for Kimi-K3, and 15 each for DeepSeek and GLM. Relative to Agentic Base, its largest family-level gains occur in Math & Logic (4.59–8.34 points across models) and Hallucination & Count (2.08–6.19 points). Medical & World changes by 0.42–2.19 points, while General Visual is comparatively flat (−0.30 to +1.07). Macro-29 therefore provides a conservative test: it includes many tasks with weak sensitivity to visual-token allocation, yet the aggregate gain remains positive for every model.

Benchmark-by-Benchmark Scorecard

Table 3 expands the four main presentation conditions into all 29 benchmark accuracies. Each panel compares Direct, Direct+ResVision, Agentic, and Agentic+ResVision; the Agentic+SMR intermediate remains in the component summary above. Pale-blue cells mark the best main condition for each benchmark within a model. The scorecard makes the breadth of the evaluation visible while also showing that no single method dominates every individual task.

Qwen3.8-Flash-NextKimi-K3
BenchmarkDirect BaseDirect +ResVisionAgentic BaseAgentic +ResVisionBenchmarkDirect BaseDirect +ResVisionAgentic BaseAgentic +ResVision
Math & LogicMath & Logic
BabyVision47.1670.8856.6177.75BabyVision55.0774.0559.3780.76
VisuLogic39.4252.3348.6758.17VisuLogic47.0860.0850.3365.67
Kangaroo202586.7590.9291.6794.08Kangaroo202594.0094.9295.5896.25
MathVision92.5093.6792.8395.25MathVision95.3395.6794.0096.00
Rebus50.4551.2558.0655.96Rebus81.9884.5883.7886.09
Chart & OCRChart & OCR
OCR-Reasoning76.8377.0877.2580.08OCR-Reasoning79.5081.7579.8380.75
CharXiv-RQ82.0085.8384.9288.67CharXiv-RQ85.5087.8389.8390.42
ChartMuseum82.4282.9283.7586.92ChartMuseum83.4285.7585.4289.50
CharXiv-Des95.5896.2595.3396.75CharXiv-Des95.5895.5896.0095.75
Hallucination & CountHallucination & Count
VLMsAreBiased62.1775.0071.5888.75VLMsAreBiased46.1748.7553.5860.50
HallusionBench85.7588.0887.0089.00HallusionBench84.3383.1785.5884.58
CountQA77.3375.6774.0873.50CountQA69.9268.9271.8372.17
Embodied & SpatialEmbodied & Spatial
BLINK81.0085.7583.3386.00BLINK84.8388.0087.3389.25
MMSI51.0853.5852.8353.50MMSI57.0055.8355.2555.58
ERQA69.0870.8369.3374.67ERQA69.2571.1769.6773.17
MindCube81.8383.2584.5886.25MindCube89.3388.6787.7588.17
CV-Bench91.5892.5891.2592.92CV-Bench92.9292.3393.2591.67
OmniSpatial76.7578.5078.1779.17OmniSpatial75.9274.6777.0876.00
Medical & WorldMedical & World
MuirBench79.1780.8378.7579.25MuirBench77.4279.0877.2577.83
MedXpertQA-MM69.3368.9271.2571.08MedXpertQA-MM75.1774.9275.1776.42
WorldVQA27.6728.5030.7532.08WorldVQA50.1747.2546.9251.83
RealWorldQA87.5087.9288.1788.17RealWorldQA83.2583.1783.1785.17
General VisualGeneral Visual
SimpleVQA57.9259.4257.7561.25SimpleVQA73.7571.0873.1770.67
MMMU84.5084.8384.8385.50MMMU86.4287.0085.7587.08
MMMU-Pro78.6779.5878.5880.00MMMU-Pro82.0083.9282.5083.42
MMStar82.0883.9282.9284.33MMStar80.0880.3381.6781.67
MMBench-CN93.9293.2594.1792.25MMBench-CN93.4293.7593.0893.67
CCBench84.9284.3386.7586.17CCBench91.9291.1791.9291.17
ZeroBench11.3311.009.6712.67ZeroBench13.3318.3315.3320.33
Macro-2971.9674.7273.9676.90Macro-2975.6677.3076.6079.02

Table 3. Benchmark-by-benchmark Macro-29 scorecard across four frontier VLMs. Values are mean accuracy (%) over three independent runs. Direct+ResVision uses SMR, while Agentic+ResVision uses SMR+CPI; the best main condition in each benchmark row is highlighted.

BenchmarkDeepSeek-V4.1-Flash Direct BaseDeepSeek-V4.1-Flash Direct +ResVisionDeepSeek-V4.1-Flash Agentic BaseDeepSeek-V4.1-Flash Agentic +ResVisionBenchmarkGLM-5.3-Flash Direct BaseGLM-5.3-Flash Direct +ResVisionGLM-5.3-Flash Agentic BaseGLM-5.3-Flash Agentic +ResVision
Math & LogicMath & Logic
BabyVision33.5148.4542.6159.36BabyVision40.4660.0551.6368.21
VisuLogic33.0042.6739.0846.67VisuLogic39.6745.7548.3354.92
Kangaroo202581.8384.0087.9288.25Kangaroo202588.5087.6791.5091.42
MathVision87.8389.6789.6792.00MathVision84.9290.0890.6793.92
Rebus64.8664.2665.5764.66Rebus73.5772.4769.7766.37
Chart & OCRChart & OCR
OCR-Reasoning75.5874.5876.1778.08OCR-Reasoning75.8377.1776.3377.75
CharXiv-RQ75.9280.1779.9284.17CharXiv-RQ82.5885.0886.5888.08
ChartMuseum74.3374.8378.3380.50ChartMuseum81.0080.1783.4287.58
CharXiv-Des95.5896.0895.8396.25CharXiv-Des95.0895.8395.7595.83
Hallucination & CountHallucination & Count
VLMsAreBiased43.1750.1751.5860.17VLMsAreBiased48.3356.5863.4269.92
HallusionBench84.9285.9287.0886.75HallusionBench84.6785.4286.0086.25
CountQA61.9263.0863.0063.75CountQA60.1761.0864.0066.25
Embodied & SpatialEmbodied & Spatial
BLINK79.2581.8379.0081.50BLINK83.3385.8382.9286.50
MMSI48.3349.0850.1748.83MMSI54.1756.3350.7552.92
ERQA64.3366.3365.3370.08ERQA67.0871.2568.7572.17
MindCube63.1765.3360.9262.50MindCube82.4284.6781.1781.67
CV-Bench90.5090.3391.0089.92CV-Bench92.7591.5091.6792.33
OmniSpatial73.6773.0871.8373.67OmniSpatial74.1773.6773.0876.33
Medical & WorldMedical & World
MuirBench75.1776.5874.6776.08MuirBench78.9278.6780.2578.42
MedXpertQA-MM70.2568.6769.8369.92MedXpertQA-MM73.2572.0872.7574.67
WorldVQA32.4231.8331.3332.83WorldVQA44.7541.8341.2543.83
RealWorldQA83.2581.3384.0885.25RealWorldQA86.5885.5885.5886.50
General VisualGeneral Visual
SimpleVQA62.1761.8364.1762.33SimpleVQA65.2566.3367.8366.50
MMMU84.2585.2585.4285.25MMMU84.3385.2586.5085.92
MMMU-Pro77.2577.4279.3378.00MMMU-Pro77.1779.0081.0079.75
MMStar79.7579.7580.0880.58MMStar80.9282.3382.0882.92
MMBench-CN92.8393.7593.1793.75MMBench-CN94.2594.5893.7594.08
CCBench86.5084.5887.1785.00CCBench88.4287.1787.2586.33
ZeroBench8.009.678.6711.00ZeroBench10.0010.3310.6711.67
Macro-2968.4070.0270.1071.97Macro-2972.1673.9273.9575.83

Table 3 (PDF p. 11). Benchmark-by-benchmark Macro-29 scorecard across four frontier VLMs (continued).

Focused Component Analysis

The following controlled analyses retain the original five-benchmark slice—BabyVision, VLMsAreBiased, BLINK, VStarBench [42], and MMVP [39]—because it provides dense three-run measurements for all ablations and exposes the visual bottlenecks studied in Sec. 2. Macro-5 is the equal-weight mean across these five benchmarks.

Table 4 isolates SMR and CPI on Kimi-K3 and Qwen3.8. SMR alone improves Direct by 5.26 and 8.88 points, respectively. Within agentic inference, CPI adds 4.15 and 5.39 points without SMR, and a further 2.21 and 1.85 points when SMR is enabled. The complete system exceeds Direct+SMR by 4.46 and 5.66 points, showing that adaptive presentation and context-preserving local inspection contribute at different stages.

ConfigurationKimi-K3Qwen 3.8
Direct
Base72.30±0.4072.30 \pm0.4073.47±0.2973.47 \pm0.29
+SMR77.57±0.5577.57 \pm0.5582.35±0.9682.35 \pm0.96
Agentic
Base75.64±0.7475.64 \pm0.7478.99±0.8078.99 \pm0.80
+CPI79.79±0.9779.79 \pm0.9784.38±0.4984.38 \pm0.49
+SMR79.83±0.4479.83 \pm0.4486.16±0.3286.16 \pm0.32
+SMR+CPI82.03±0.7382.03 \pm0.7388.01±0.5688.01 \pm0.56

Table 4. Component ablations. Macro-5 mean ±\pm SD over three runs.

Adaptive versus Fixed Visual-Token Allocation

We replace SMR with fixed targets of 1,024–5,120 visual tokens while retaining CPI and all other settings. Accuracy is non-monotonic in the fixed budget: the strongest fixed target is 2,048 tokens for both tested models, while adaptive SMR improves on it by 3.31 points on Kimi-K3 and 3.36 points on Qwen3.8 (Table 5). This supports allocating sampling density from image structure rather than using a uniform token target.

AllocationKimi-K3Qwen 3.8
Original79.83±0.4479.83 \pm0.4486.16±0.3286.16 \pm0.32
Fixed 1,02478.24±0.4578.24 \pm0.4582.64±0.7982.64 \pm0.79
Fixed 2,04878.72±0.3778.72 \pm0.3784.65±0.9784.65 \pm0.97
Fixed 3,07276.43±0.7076.43 \pm0.7083.37±0.3883.37 \pm0.38
Fixed 4,09674.26±1.6074.26 \pm1.6084.13±0.7884.13 \pm0.78
Fixed 5,12073.58±0.2473.58 \pm0.2483.29±0.5683.29 \pm0.56
SMR (adaptive)82.03±0.7382.03 \pm0.7388.01±0.5688.01 \pm0.56

Table 5. Adaptive versus fixed allocation. Macro-5 mean ±\pm SD over three runs.

Inference-Configuration Sensitivity

Table 6 varies one inference setting at a time on BabyVision while retaining complete ResVision. Reasoning effort has the largest effect: moving from Low to Max raises accuracy by 22.68 points on Kimi-K3 and 8.68 points on Qwen3.8. Temperature changes produce a spread of at most 3.01 points, and increasing the generation ceiling beyond 32K does not consistently improve accuracy.

FactorSettingKimi-K3Qwen 3.8
Temperature080.76±1.0780.76 \pm1.0777.75±1.0577.75 \pm1.05
0.580.50±0.3080.50 \pm0.3079.38±1.5779.38 \pm1.57
1.077.75±0.5477.75 \pm0.5476.98±0.5476.98 \pm0.54
EffortLow58.08±2.8458.08 \pm2.8469.07±0.9369.07 \pm0.93
Medium74.74±2.3074.74 \pm2.3075.86±1.5575.86 \pm1.55
Max80.76±1.0780.76 \pm1.0777.75±1.0577.75 \pm1.05
Token cap32K81.10±0.7481.10 \pm0.7478.70±1.3078.70 \pm1.30
65K80.76±1.0780.76 \pm1.0777.75±1.0577.75 \pm1.05
131K81.27±0.3981.27 \pm0.3976.38±1.1676.38 \pm1.16

Table 6. Configuration sensitivity on BabyVision (%). One setting varies at a time.

Inference-Time Cost

Table 7 reports mean end-to-end client latency over the focused five-benchmark slice. Complete ResVision takes 1.07–1.36× as long as Direct. Relative to VISTA, it is 2.8% faster on Qwen3.8 and 3.5–9.7% slower on the other three models. These measurements show that the accuracy gains do not require a large additional latency multiplier beyond agentic inspection itself.

ModelDirectVISTAResVision
Kimi-K3248.51.00×1.00\times264.81.07×1.07\times274.21.10×1.10\times
Qwen51.51.00×1.00\times68.51.33×1.33\times66.61.29×1.29\times
GLM193.61.00×1.00\times240.71.24×1.24\times263.61.36×1.36\times
DeepSeek100.41.00×1.00\times97.70.97×0.97\times107.21.07×1.07\times
Mean ratio1.00×1.00\times1.15×1.15\times1.20×1.20\times

Table 7. End-to-end latency. Gray cells give seconds; blue cells give the ratio to Direct.

Related Work

Visual Scaling and Token Allocation

Modern VLMs inherit patch-based visual interfaces from ViTs and combine them with contrastive or instruction-tuned multimodal learning [34, 1, 24, 8, 10, 26, 2, 9]. A substantial line of work makes this interface more flexible. NaViT packs variable-resolution inputs, Pix2Struct preserves aspect ratio under a token budget, and FlexiViT supports multiple patch sizes [12, 23, 4]; TokenLearner, DynamicViT, and Token Merging instead adapt, prune, or merge representations within the encoder [36, 35, 5]. High-resolution VLMs divide native images into tiles or combine low- and high-resolution branches to expose dense detail [25, 44, 19]. These designs demonstrate that visual-token allocation strongly affects what a model can recover. However, they usually determine allocation from image geometry, a fixed resolution policy, or importance estimated after tokenization. The same pixel dimensions can contain very different amounts of fine structure, so geometry alone need not predict the sampling required by a particular image. ResVision addresses this complementary question before reasoning begins: SMR measures image structure and selects a budgeted working scale that matches it to the encoder’s usable frequency range, without retraining or modifying the visual backbone.

Agentic Visual Reasoning

Agentic visual reasoning extends active perception by allowing a model to gather evidence as its reasoning evolves [3, 29, 46]. Program- and tool-based systems compose specialist modules [17, 38, 45, 41, 27], while V* and VISTA let a general-purpose VLM actively search or retrieve visual observations [42, 18]. Related methods ground language in selected regions, introduce visual prompts, or use drawings and interleaved visual states to support reasoning [6, 32, 47, 37, 15, 20]. Web and desktop agents further show that perception and grounding remain limiting factors when visual observations drive actions [49, 22, 43], a capability directly examined by VisualToolBench [16]. Most of this literature focuses on choosing an action, invoking the right tool, or obtaining a sharper local observation. It gives less attention to how the returned observation should remain connected to the scene from which it was extracted. Visual Funnel is closely related in combining focal evidence with multiscale context [21], but relies on attention-guided views rather than maintaining a stable complete reference across an agentic trajectory. ResVision’s CPI targets this whole–detail relationship directly: each selected crop is presented together with the same complete working view, so subsequent reasoning can locate the detail, compare it with alternatives, and interpret it in context.

Conclusion

We identify three mechanisms that explain how local inspection can improve or impair visual reasoning by altering evidence accessibility and scene correspondence without introducing new scene content. ResVision translates these insights into a training-free framework: SMR improves visual accessibility by adapting the working scale to image structure, while CPI preserves whole–detail correspondence throughout local inspection. Across four VLM families and 29 benchmarks, complete ResVision (Agentic Base+SMR+CPI) is the strongest main configuration for every model, reaching a four-model mean Macro-29 of 75.93—3.88 points above Direct Base and 2.28 points above Agentic Base. The gains are largest on reasoning families that depend strongly on fine structure and distributed evidence, while flatter families expose the expected limits of additional visual sampling. Focused ablations nevertheless show that SMR and CPI each contribute and that their combination is consistently strongest. These findings highlight accessibility and correspondence as two fundamental requirements for agentic visual reasoning, paving the way for visual agents that can perceive fine details and interpret them within the broader scene.

LLM Usage Statement

GPT assisted with early-stage ideation, language editing, conceptual figures, statistical analysis. The human authors are responsible for the method design, experimental procedure, source verification, citations, scientific claims, and final manuscript.

Authors

Guojian Zhan, Jiahao Xu, Yahui Liu, Yao Hu, and Chuan Mu.

Evaluation Setup

Model Families and Endpoints

Table 8 records the four evaluated endpoints and their main inference settings. Max denotes the highest supported reasoning effort for each model.

Model familyEvaluated endpoint identifierMain effortTemperatureMax tokens
KimiKimi-K3Max065,536
QwenQwen3.8-Flash-NextMax065,536
GLMGLM-5.3-FlashMax065,536
DeepSeekDeepSeek-V4.1-Flash-1017Max065,536

Table 8. Model endpoints and main inference settings.

Shared Evaluation Controls

Direct answers from the original image without visual tools. VISTA and ResVision use the same backend, task input, prompts, tool implementation, temperature, reasoning effort, and generation ceiling. Both agentic methods have a hard ceiling of four executed calls. ResVision applies SMR before inference and uses CPI to return the complete working view alongside each crop. Main runs use temperature 0, Max effort, and a generation ceiling of 65,536 output tokens.

We evaluate each method in three independent runs per setting and report the mean and sample standard deviation across runs. For paired comparisons, we first average each method’s score on each question across the three runs, then compute 95% confidence intervals by resampling questions within each benchmark, using the same bootstrap samples for all methods. Macro-5 is the unweighted mean of the five benchmark accuracies.

Benchmark Profiles

The five benchmarks span structured diagrams, counterfactual patterns, cross-view correspondence, high-resolution search, and deceptively similar natural images. Table 9 gives the evaluated snapshot sizes, totaling 1,679 questions. Figure 7 illustrates their contrasting visual demands.

SnapshotQuestionsPrimary capability covered in this evaluation
BabyVision388Foundational discrimination, tracking, spatial, and pattern reasoning
VLMsAreBiased400Visual evidence under conflict with learned semantic priors
BLINK400Core visual perception recast from classical computer-vision tasks
VStarBench191Search and grounding in high-resolution, visually crowded scenes
MMVP300Basic visual patterns that expose representation-level shortcomings
Total1,679

Table 9. Evaluation benchmarks and snapshot sizes.

Figure 7. Figure 7: Five benchmarks, five visual demands. Real image–question examples from our evaluation snapshots, with reference answers. Task text is excerpted to omit answer-format instructions and, for BLINK, annotation scaffolding.

Complete Results and Run-Level Stability

Table 10 reports benchmark-level means and sample standard deviations; Gain is the Macro-5 improvement over Direct in percentage points. Table 11 gives the three individual runs behind each aggregate.

MethodBabyBiasBLINKVStarMMVPMacro-5Gain
Kimi-K3
Direct55.07±0.1455.07 \pm0.1446.17±0.3846.17 \pm0.3884.83±0.6384.83 \pm0.6390.23±0.6190.23 \pm0.6185.22±0.3985.22 \pm0.3972.30±0.4072.30 \pm0.400.00
VISTA59.37±1.3059.37 \pm1.3053.58±0.7653.58 \pm0.7687.33±1.0187.33 \pm1.0191.80±0.3191.80 \pm0.3186.11±0.5186.11 \pm0.5175.64±0.7475.64 \pm0.74+3.33
ResVision80.76±1.0780.76 \pm1.0760.50±1.1560.50 \pm1.1589.25±0.4389.25 \pm0.4392.67±0.9192.67 \pm0.9187.00±0.3387.00 \pm0.3382.03±0.7382.03 \pm0.73+9.73
Qwen3.8-Flash-Next
Direct47.16±0.2647.16 \pm0.2662.17±0.3862.17 \pm0.3881.00±0.4381.00 \pm0.4391.80±0.3191.80 \pm0.3185.22±0.1985.22 \pm0.1973.47±0.2973.47 \pm0.290.00
VISTA56.61±0.1556.61 \pm0.1571.58±1.1371.58 \pm1.1383.33±1.0483.33 \pm1.0495.99±1.0995.99 \pm1.0987.45±0.6987.45 \pm0.6978.99±0.8078.99 \pm0.80+5.52
ResVision77.75±1.0577.75 \pm1.0588.75±0.9088.75 \pm0.9086.00±0.6686.00 \pm0.6695.99±0.6195.99 \pm0.6191.56±0.2091.56 \pm0.2088.01±0.5688.01 \pm0.56+14.54
GLM-5.3-Flash
Direct40.46±1.1240.46 \pm1.1248.33±0.6348.33 \pm0.6383.33±0.3883.33 \pm0.3889.70±0.3089.70 \pm0.3084.78±1.0284.78 \pm1.0269.32±0.6769.32 \pm0.670.00
VISTA51.63±1.5751.63 \pm1.5763.42±0.7663.42 \pm0.7682.92±0.9582.92 \pm0.9591.45±0.6191.45 \pm0.6186.00±0.8886.00 \pm0.8875.08±0.9275.08 \pm0.92+5.76
ResVision68.21±2.3168.21 \pm2.3169.92±0.7269.92 \pm0.7286.50±1.3086.50 \pm1.3091.97±0.3191.97 \pm0.3189.55±0.6989.55 \pm0.6981.23±0.5381.23 \pm0.53+11.91
DeepSeek-V4.1-Flash-1017
Direct33.51±1.0433.51 \pm1.0443.17±1.2843.17 \pm1.2879.25±0.4379.25 \pm0.4378.88±1.3178.88 \pm1.3189.67±0.8889.67 \pm0.8864.89±0.9664.89 \pm0.960.00
VISTA42.61±1.4242.61 \pm1.4251.58±0.8851.58 \pm0.8879.00±0.2579.00 \pm0.2589.71±0.8089.71 \pm0.8089.78±0.1989.78 \pm0.1970.54±0.7070.54 \pm0.70+5.64
ResVision59.36±1.5559.36 \pm1.5560.17±1.2860.17 \pm1.2881.50±0.4381.50 \pm0.4394.24±0.5294.24 \pm0.5288.66±1.1588.66 \pm1.1576.79±0.1876.79 \pm0.18+11.89

Table 10. Five-benchmark results across four VLMs. Each entry is the mean ±\pm sample standard deviation across three independent runs. ResVision uses the complete SMR+CPI configuration.

MethodRunBabyVisionVLMsAreBiasedBLINKVStarBenchMMVPMacro-5Correct
Kimi-K3
Direct154.9045.7584.2589.5385.0071.891159
255.1546.2584.7590.5885.0072.351166
355.1546.5085.5090.5885.6772.681172
VISTA157.9952.7586.7591.6285.6774.961215
259.5453.7586.7591.6286.0075.531226
360.5754.2588.5092.1586.6776.431242
ResVision181.9661.5089.7593.1987.3382.751363
280.4160.7589.0093.1987.0082.071350
379.9059.2589.0091.6286.6781.291338
Qwen3.8-Flash-Next
Direct146.9161.7580.5091.6285.0073.161181
247.1662.2581.2591.6285.3373.521188
347.4262.5081.2592.1585.3373.731191
VISTA156.4470.5082.5094.7686.6778.171272
256.7071.5083.0096.3487.6779.041285
356.7072.7584.5096.8688.0079.761298
ResVision178.8789.5086.7596.3491.6788.631470
277.5889.0085.7595.2991.6787.861457
376.8087.7585.5096.3491.3387.541449
GLM-5.3-Flash
Direct139.6947.7583.0089.5383.6768.731099
239.9548.2583.2589.5385.0069.201107
341.7549.0083.7590.0585.6770.041122
VISTA150.2662.7582.2591.1085.0074.271204
251.2963.2582.5091.1086.3374.891215
353.3564.2584.0092.1586.6776.081236
ResVision166.7570.7587.2592.1589.3381.251335
267.0169.5085.0091.6290.3380.691324
370.8869.5087.2592.1589.0081.761345
DeepSeek-V4.1-Flash-1017
Direct132.4741.7578.7577.4989.0063.891023
233.5143.5079.5079.0689.3364.981041
334.5444.2579.5080.1090.6765.811054
VISTA141.2450.7578.7589.0189.6769.881117
242.5351.5079.0089.5389.6770.451127
344.0752.5079.2590.5890.0071.281141
ResVision159.5461.2582.0094.7687.3376.981247
257.7360.5081.2594.2489.3376.611239
360.8258.7581.2593.7289.3376.771243

Table 11. Individual-run results: benchmark accuracy (%), Macro-5, and total correct answers; R1–R3 include all three independent runs.

Individual Run Results

Each row in Table 11 reports benchmark accuracies, Macro-5, and total correct answers for one independent execution. All three runs contribute to the aggregate results.

Paired Effects and Statistical Reliability

For paired analyses, binary correctness is first averaged per question over the three runs. We compute 95% confidence intervals with 20,000 within-benchmark question-bootstrap replicates (seed 20261102), sharing each resample across methods. Macro-5 is the unweighted mean of the five benchmark effects. Exact McNemar tests use majority correctness across runs.

Metric / benchmarkΔ\Delta (pp)95% CIWins / Lossespp
Kimi-K3
Macro-5+6.40[+5.17, +7.66]169/40<10−4< 10^{-4}
BabyVision+21.39[+17.78, +25.09]97/7<10−4< 10^{-4}
VLMsAreBiased+6.92[+4.50, +9.50]35/7<10−4< 10^{-4}
BLINK+1.92[-0.08, +4.00]17/90.1686
VStarBench+0.87[-1.40, +3.32]4/20.6875
MMVP+0.89[-2.22, +4.11]16/151.0000
Qwen3.8-Flash-Next
Macro-5+9.02[+7.70, +10.35]224/44<10−4< 10^{-4}
BabyVision+21.13[+17.44, +24.91]98/16<10−4< 10^{-4}
VLMsAreBiased+17.17[+13.92, +20.58]73/6<10−4< 10^{-4}
BLINK+2.67[+0.25, +5.17]27/120.0237
VStarBench+0.00[-1.92, +1.92]2/11.0000
MMVP+4.11[+1.11, +7.11]24/90.0135
GLM-5.3-Flash
Macro-5+6.15[+4.75, +7.55]181/72<10−4< 10^{-4}
BabyVision+16.58[+12.89, +20.27]80/21<10−4< 10^{-4}
VLMsAreBiased+6.50[+3.25, +9.75]50/230.0021
BLINK+3.58[+1.17, +6.08]25/120.0470
VStarBench+0.52[-2.62, +3.66]8/71.0000
MMVP+3.56[+0.44, +6.67]18/90.1221
DeepSeek-V4.1-Flash-1017
Macro-5+6.25[+4.82, +7.69]207/88<10−4< 10^{-4}
BabyVision+16.75[+12.71, +20.88]102/32<10−4< 10^{-4}
VLMsAreBiased+8.58[+5.25, +12.00]59/21<10−4< 10^{-4}
BLINK+2.50[-0.08, +5.08]28/200.3123
VStarBench+4.54[+1.40, +8.03]10/30.0923
MMVP-1.11[-3.67, +1.44]8/120.5034

Table 12. Paired accuracy gains over VISTA. Wins/losses use majority correctness; pp denotes the exact McNemar probability.

Breadth Across Official BabyVision Task Types

ResVision leads both baselines across BabyVision’s four official types (Figure 8). Its gains over VISTA are +18.14, +24.54, +17.31, and +8.84 points for pattern recognition, fine-grained discrimination, spatial perception, and visual tracking.

Figure 8. Breadth across official BabyVision types. Accuracy averages four models and all three independent runs. The four types contain 51, 163, 91, and 83 questions, respectively.

BabyVision typennDirectVISTAResVisionΔ\Delta
Fine-grained discrim.16342.3353.3778.12+24.74
Pattern recognition5164.0572.0690.36+18.30
Spatial perception9139.6549.9168.13+18.22
Visual tracking8339.9641.8750.70+8.84

Table 13. BabyVision gains by official task type. Repeats and models are averaged within each question.

Consistency Across Repeated Runs

All correct counts questions answered correctly in every run; all wrong counts questions missed in every run. Mixed outcomes belong to neither group. Table 14 covers 6,716 model–question pairs.

ModelDirectVISTAResVision
ACAWACAWACAW
Kimi-K31,0474081,1173431,247255
Qwen1,0353401,1172381,336139
GLM9544051,0162781,189219
DeepSeek8974779613841,076279
Total3,9331,6304,2111,2434,848892

Table 14. Consistent successes and errors across three runs. AC: correct in all three runs; AW: wrong in all three runs.

ResVision is correct in all three runs on 4,848 pairs, versus 4,211 for VISTA and 3,933 for Direct. Persistent errors fall from VISTA’s 1,243 to 892, a 28.2% reduction. This yields 637 additional repeatable successes over VISTA, alongside fewer persistent failures.

Figure 9. ResVision gains over VISTA. Mean accuracy differences in percentage points over all three independent runs. Each cell gives the signed difference on a scale centered at zero.

Four-panel point plots for Kimi-K3, Qwen, GLM, and DeepSeek, showing Macro-5, BabyVision, VLM-Bias, BLINK, VStar, and MMVP effects with pointwise intervals. Horizontal axis: $\Delta$ accuracy vs. VISTA (pp), from −5 to 20.

Figure 10. Three-run paired ResVision effects. ResVision minus VISTA accuracy with pointwise 95% intervals from a 20,000-replicate question bootstrap, resampling questions within each benchmark with shared samples across methods.

Ablations and Configuration Sensitivity

This section collects the controlled comparisons that separate ResVision’s two components, test adaptive visual-token allocation, and vary its inference configuration. The Direct+SMR control and fixed-allocation study use Kimi-K3 and Qwen3.8-Flash-Next; the agentic component design additionally covers GLM-5.3-Flash and DeepSeek-V4.1-Flash-1017. All component and allocation results use the five-benchmark Macro-5, while the one-factor configuration sweeps use BabyVision. Every condition contains three independent runs.

Direct and Agentic Component Ablations

The Direct comparison isolates SMR before any tool use: Direct processes the original image, whereas Direct+SMR processes the spectrum-matched working view. The agentic comparison forms a complete 2×22 \times2 design. Removing SMR retains CPI with the original image presentation; removing CPI keeps SMR but restores VISTA-style isolated-crop replies; removing both exactly recovers VISTA. Prompts, tools, inference settings, and call limits remain fixed within each comparison. Main-paper Table 4 reports the Direct controls and the full agentic design on Kimi-K3 and Qwen3.8-Flash-Next; Table 15 below extends the agentic design to all four model families.

ModelVISTA+SMR+CPISMR+CPI
Kimi-K375.64±0.7475.64 \pm0.7479.83±0.4479.83 \pm0.4479.79±0.9779.79 \pm0.9782.03±0.7382.03 \pm0.73
Qwen3.8-Flash-Next78.99±0.8078.99 \pm0.8086.16±0.3286.16 \pm0.3284.38±0.4984.38 \pm0.4988.01±0.5688.01 \pm0.56
GLM-5.3-Flash75.08±0.9275.08 \pm0.9280.11±0.3280.11 \pm0.3279.02±0.9679.02 \pm0.9681.23±0.5381.23 \pm0.53
DeepSeek-V4.1-Flash-101770.54±0.7070.54 \pm0.7073.94±0.6473.94 \pm0.6475.51±0.5375.51 \pm0.5376.79±0.1876.79 \pm0.18

Table 15. Four-model agentic SMR ×\times CPI ablation. Entries are mean Macro-5 ±\pm sample standard deviation over three independent runs. +SMR and +CPI enable one component; SMR+CPI is complete ResVision. Direct controls are reported in main-paper Table 4.

On the two models with Direct controls, SMR alone improves Direct by 5.26 points on Kimi-K3 and 8.88 on Qwen. Within agentic inference, each isolated component improves Macro-5 over VISTA for every model, and complete ResVision is best in all four cases. Enabling both adds 0.84–2.21 points over the stronger single-component variant, confirming complementary gains from adaptive scaling and context preservation.

Adaptive versus Fixed Visual-Token Allocation

The fixed-token control replaces SMR with a uniform target of 1,024, 2,048, 3,072, 4,096, or 5,120 visual tokens while retaining CPI. The strongest fixed target is 2,048 tokens for both tested models; adaptive SMR improves Macro-5 by 3.31 points on Kimi-K3 and 3.36 on Qwen3.8-Flash-Next (Table 5). The table’s Original row is the SMR-only, no-CPI component control, whereas SMR (adaptive) is complete ResVision. Larger fixed targets do not improve monotonically.

Inference Configuration on BabyVision

We next report one-factor sweeps for Kimi-K3 and Qwen3.8-Flash-Next. Each sweep changes one inference factor while holding the others at the main-experiment defaults, and all measurements use complete ResVision with SMR and CPI. Figure 11 provides the overview; the tables retain every setting and individual run.

Figure 11. BabyVision configuration sweeps for complete ResVision. Rows correspond to Kimi-K3 and Qwen3.8-Flash-Next; columns vary temperature, reasoning effort, and generation ceiling. Bars show means and sample standard deviations across all three independent runs in the complete ablation tables below.

Temperature. Kimi-K3 is effectively tied at temperature 0 and 0.5, while Qwen is strongest at 0.5. Across all three settings, the ranges are 3.01 points for Kimi-K3 and 2.40 for Qwen. Temperature therefore changes the optimum slightly without overturning the overall behavior of complete ResVision.

Model0 (default)0.51.0
Kimi-K380.76±1.0780.76 \pm1.0780.50±0.3080.50 \pm0.3077.75±0.5477.75 \pm0.54
Qwen3.8-Flash-Next77.75±1.0577.75 \pm1.0579.38±1.5779.38 \pm1.5776.98±0.5476.98 \pm0.54

Table 16. Temperature ablation for ResVision on BabyVision (%). Mean ±\pm sample standard deviation over three runs. Blue shading marks the best setting within each model.

Reasoning effort. Reasoning effort causes the largest shifts in the sweep. Kimi-K3 rises from 58.08 at Low to 80.76 at Max, and Qwen rises from 69.07 to 77.75. The monotonic recovery on both models shows that multi-view inspection depends on sufficient reasoning capacity to connect the acquired detail to its global reference.

ModelLowMediumMax (default)
Kimi-K358.08±2.8458.08 \pm2.8474.74±2.3074.74 \pm2.3080.76±1.0780.76 \pm1.07
Qwen3.8-Flash-Next69.07±0.9369.07 \pm0.9375.86±1.5575.86 \pm1.5577.75±1.0577.75 \pm1.05

Table 17. Reasoning-effort ablation for ResVision on BabyVision (%). Mean ±\pm sample standard deviation over three runs. Blue shading marks the best setting within each model.

Generation ceiling. Kimi-K3 remains essentially flat from 32K to 131K (80.76–81.27), and Qwen varies by 2.32 points with its best result at 32K. These results separate the output allowance from the visual-token allocation studied in § 4.5: the former controls how long the model may reason and answer, whereas the latter controls how the image is presented.

Table 18: Generation-ceiling ablation for ResVision on BabyVision (%). Mean ±\pm sample standard deviation over three runs. Blue shading marks the best setting within each model.

Model32K65K (default)131K
Kimi-K381.10±0.7481.10 \pm0.7480.76±1.0780.76 \pm1.0781.27±0.3981.27 \pm0.39
Qwen3.8-Flash-Next78.70±1.3078.70 \pm1.3077.75±1.0577.75 \pm1.0576.38±1.1676.38 \pm1.16

Table 18.

Individual Run Results

Table 19 lists all three independent run accuracies underlying every BabyVision configuration cell. Means and sample standard deviations use all three values. All three sweeps reuse the complete ResVision main-experiment control at temperature 0, 65,536 tokens, and the highest supported effort.

Table 19: Complete BabyVision configuration results (accuracy, %). R1–R3 are the three independent runs; all are included in the mean and sample standard deviation.

FactorSettingR1R2R3Mean ±\pm SD
Kimi-K3
Temperature0 (default)81.9680.4179.9080.76±1.0780.76 \pm1.07
0.580.1580.6780.6780.50±0.3080.50 \pm0.30
1.077.5878.3577.3277.75±0.5477.75 \pm0.54
EffortLow61.3456.7056.1958.08±2.8458.08 \pm2.84
Medium75.5272.1676.5574.74±2.3074.74 \pm2.30
Max (default)81.9680.4179.9080.76±1.0780.76 \pm1.07
Max tokens32K80.6781.9680.6781.10±0.7481.10 \pm0.74
65K (default)81.9680.4179.9080.76±1.0780.76 \pm1.07
131K81.1981.7080.9381.27±0.3981.27 \pm0.39
Qwen3.8-Flash-Next
Temperature0 (default)78.8777.5876.8077.75±1.0577.75 \pm1.05
0.578.3578.6181.1979.38±1.5779.38 \pm1.57
1.077.5876.5576.8076.98±0.5476.98 \pm0.54
EffortLow69.8569.3368.0469.07±0.9369.07 \pm0.93
Medium74.2376.0377.3275.86±1.5575.86 \pm1.55
Max (default)78.8777.5876.8077.75±1.0577.75 \pm1.05
Max tokens32K77.3278.8779.9078.70±1.3078.70 \pm1.30
65K (default)78.8777.5876.8077.75±1.0577.75 \pm1.05
131K77.5875.2676.2976.38±1.1676.38 \pm1.16

Table 19.

Additional Mechanistic Evidence

We supplement the main diagnostics with weight spectra, frequency reconstruction, phase sensitivity, and feature-size probes on Qwen3.8-Flash-Next. Its vision stack uses 16×1616 \times16 input patches, a 27-layer ViT of width 1,152, and a 2×22 \times2 merger producing 2,048-dimensional visual tokens. Each merged token corresponds to a 32×3232 \times32 input region before contextual mixing.

Why Presentation Scale Changes Accessibility

Changing image scale redistributes existing structure across visual tokens. Under the effective low-pass view in § 2.1, enlargement shifts a pattern from frequency ff to f/sf/s, where the encoder response can be stronger [31]. The probes below measure how amplitude, recoverability, spatial phase, and feature size change through the visual stack. CPI complements this scale adaptation by preserving the scene reference needed to interpret each enlarged detail.

Weight Spectra and Effective Rank

Table 20 reports Shannon effective rank, participation ratio, and the number of singular values required to explain 90% of squared-singular-value energy for the patch projection and merger. The product W2W1W_{2}W_{1} summarizes the merger’s linear weights before its activation.

Table 20: Qwen3.8-Flash-Next visual-projection weight spectra. Effective rank summarizes spectral concentration; the final column is the number of singular values covering 90% of spectral energy.

MatrixShapeMax. rankEffective rankParticipation90% energy
Patch projection (gray)1152×2561152 \times256256194.76158.05189
Patch projection (RGB)1152×7681152 \times768768241.76194.10229
Merger W1W_{1}4608×46084608 \times460846081449.69863.281354
Merger W2W_{2}2048×46082048 \times460820481163.61848.851013
Merger W2W1W_{2}W_{1}2048×46082048 \times46082048643.93467.65523

Table 20.

The RGB projection concentrates 90% of its spectral energy in 229 of 768 directions (29.8%); the merger weight product does so in 523 of 2,048 directions (25.5%). These measurements indicate anisotropic sensitivity. The following spatial and reconstruction probes characterize which frequencies remain accessible after encoding.

Frequency-Dependent Linear Reconstruction

Let xx be an input patch, vv its representation at a chosen readout, WdecW_{\mathrm{dec}} a fitted linear decoder, and x^=Wdecv\hat{x}=W_{\mathrm{dec}}v the reconstructed patch. The decoder is fitted on 2,560 input patches of size 32×3232 \times32 and evaluated on 512 held-out patches. We compare the four concatenated patch projections (4,608 dimensions), the isolated merger output (2,048), and the complete ViT-plus-merger output (2,048). For radial Fourier band Ωf\Omega_{f}, we report

R2(f)=1−∑k∈Ωf∣X^(k)−X(k)∣2∑k∈Ωf∣X(k)∣2,(14)R^{2}(f)=1-\frac{\sum_{k\in\Omega_{f}}\lvert\hat{X}(k)-X(k)\rvert^{2}}{\sum_{k\in\Omega_{f}}\lvert X(k)\rvert^{2}}, \tag*{(14)}
T(f)=∑k∈Ωf∣X^(k)∣2∑k∈Ωf∣X(k)∣2.(15)T(f)=\sqrt{\frac{\sum_{k\in\Omega_{f}}\lvert\hat{X}(k)\rvert^{2}}{\sum_{k\in\Omega_{f}}\lvert X(k)\rvert^{2}}}. \tag*{(15)}

Here XX and X^\hat{X} are Fourier coefficients of the input and reconstruction. R2R^{2} is the normalized spectral reconstruction score, and TT is the reconstructed-to-input amplitude ratio, providing an empirical modulation-transfer analogue for the fitted encoder–decoder path.

The full encoder retains a strong DC reconstruction while its high-frequency reconstruction is substantially weaker (Table 21). For example, R2R^{2} falls from 0.989 at DC to 0.137 at four cycles per token-sized region. The merger-only row localizes part of this degradation.

RepresentationDCf=1f=1f=2f=2f=4f=4f=8f=8
Patch projection1.000/1.0000.999/0.9990.998/0.9980.985/0.9860.922/0.928
Merger only1.000/1.0000.950/0.9690.902/0.9430.847/0.9150.726/0.871
Full encoder0.989/0.9950.355/0.7660.210/0.7200.137/0.582<0<0/0.447

Table 21. Table 21: Frequency-dependent reconstruction on held-out patches. Each entry gives R2(f)/T(f)R^{2}(f) / T(f). Frequencies are cycles per 32 input pixels; DC denotes the zero-frequency component.

Phase Sensitivity and Small-Feature Detection

Sensitivity to spatial phase. A synthetic square-wave grating is shifted by half a period, preserving its frequency and contrast while reversing stripe positions. The probe measures dcos⁡=1−cos⁡(v0,vπ)d_{\cos}=1-\cos(v_{0},v_{\pi}) between the two representations. At two and four cycles per token-sized region, the patch-projection distances are 1.423 and 1.634, whereas the final-token distances are 0.0687 and 0.0471 (Table 22). The full encoder therefore greatly reduces representational separation for the tested phase change.

Representationf=1f = 1f=2f = 2f=4f = 4f=8f = 8
Patch projection1.1341.4231.634—
Full encoder—0.06870.04710.0341

Table 22. Cosine distance after a half-period grating shift. Frequencies are cycles per 32 input pixels. Dashes indicate frequencies without an individually tabulated value.

Sensitivity to feature size. A square feature of side ss is injected into a 32×3232 \times32 region of BabyVision task 0507. The probe compares features before and after injection. Table 23 lists the measured distances. The full-encoder response crosses the scene-specific reference of 0.3699 between s=3s = 3 and s=4s = 4 pixels, establishing a clear size-dependent response in this probe.

Side (pixels)Patch projectionMerger onlyFull encoderAbove reference
10.00360.00200.0038No
20.01370.00690.2064No
30.02960.01430.3292No
40.05050.02550.4008Yes
60.10150.05610.5732Yes
100.21860.10970.6020Yes
160.40520.09030.6267Yes

Table 23. Cosine distance induced by a local square feature. The reference column compares the full-encoder response with within-scene variation of 0.3699.

Boundary and Trained-Readout Protocol

The boundary probe moves an unchanged 14×1414 \times14 pattern from the center of one merged-token region toward the intervening boundary. At each position, we compare the best-matching Stage-1 patch projection and Stage-3 final visual token with their respective centered-pattern references. The main-paper plot reflects this center-to-boundary sweep about the boundary, producing a position-normalized profile that removes absolute-position and reference-token effects while preserving the measured dependence on boundary distance. The released JSON retains the original unreflected measurements. This readout tests how token-grid alignment changes the representation without changing the pattern’s appearance or scale.

The counting probe uses a 320×64320 \times64 strip with M=10M = 10 horizontal token positions and evaluates K∈{6,8,10,12,15,18,20}K \in\{6, 8, 10, 12, 15, 18, 20\}. For each value of KK, we generate 60 independently arranged strips. We freeze the complete VLM and extract the Stage-3 token grid for every strip. The diagnostic feature is the spatially ordered concatenation

x=concat⁡(z1,…,zN),(16)x = \operatorname{concat}(z_1,\ldots,z_N), \tag*{(16)}

where ziz_i is a final visual token and NN is the number of tokens in the complete grid. A ridge-linear classifier Wx+bW x + b with coefficient 0.1 is trained on 45 strips per count and evaluated on the remaining 15 while the VLM remains frozen. Its held-out accuracy measures whether exact count is linearly decodable from the frozen representation.

For the generation comparison, the same evaluation images are paired with a direct integer-count prompt. We report greedy exact-match accuracy and the normalized probability assigned to the correct one- or two-digit integer. The contrast therefore holds the visual input and frozen VLM fixed while comparing a supervised linear readout with the model’s native generative readout.

Whole–Detail Representation Diagnostic

We complement the main-paper grounding experiment with a representation-level control on the same 50 BabyVision images. For each crop width, we match the same source patch between the complete image and the crop. The Stage-1 patch projection tests whether the local visual content itself changes; the Stage-3 final visual token measures drift after contextual visual processing; and the Stage-4 token additionally includes the crop-local positional frame. At 12.5% crop width, Stage-3 similarity falls to 0.389 and Stage-4 similarity to 0.305, while the Stage-1 projection remains unchanged. The dashed line marks the mean similarity between unrelated foreground tokens.

Figure 12. Representation drift for the same source patch. Local patch features remain identical at Stage 1, while contextual representations diverge as the crop narrows and diverge further after a new positional frame is assigned.

Auxiliary Retrieval and Grounding Diagnostics

Two complementary diagnostics show how retrieval and grounding failures unfold. During dense counting, the peak attended visual-token coordinate reaches the right edge before all objects have been enumerated. During crop grounding, resetting the crop origin produces localization error that grows with the target’s displacement from the source-image origin.

Two-panel plot showing attention trajectory under increasing object density and localization error after crop-origin reset

Figure 13. Auxiliary diagnostics for retrieval and separated-image grounding. (a) Dense counting drives the visual attention pointer to the grid boundary before enumeration is complete. (b) An isolated crop accumulates larger localization error as its source position moves away from the reset crop origin; retaining the complete view in the same turn reduces this error.

Connection to ResVision. Across the probes, high-frequency reconstruction weakens through the full encoder, phase distinctions contract, and the response to a local feature grows with its presented size. These measurements support the accessibility account in § 2: presentation scale changes which distinctions reach a useful representation. SMR operationalizes this observation by assigning scale from measured fine structure, while CPI addresses the complementary problem of preserving what enlarged evidence means in the complete scene. Appendix § 14 gives the exact resizing protocol used by the reported experiments.

Spectrum-Matched Resizing Protocol

This section records the working-image geometry, parameter settings, and implementation controls used in the SMR experiments.

Working-Image Geometry and Fixed-Token Control

Let GiG_i be image ii, with native dimensions (Wi,Hi)(W_i, H_i) and backend stride pp. A target NiN_i gives si=Nip2WiHis_i = \sqrt{\frac{N_i p^2}{W_i H_i}}. The fixed-token controls evaluate Ni∈{1024,2048,3072,4096,5120}N_i \in\{1024, 2048, 3072, 4096, 5120\}; the Qwen processor profile uses p=32p = 32 pixels per merged visual token. The target is a controlled allocation, whereas the stride is a processor property. Each backend therefore uses its verified processor geometry or token-count interface.

The scaled dimensions are aligned to the processor’s supported grid while preserving aspect ratio up to rounding and respecting the allocated token cap. Each run records the backend’s processed dimensions and image-token count.

For an ordered set of mm images, the fixed rule assigns the same target to each image, with total complete-view allowance Bwhole=∑iNiB_{\mathrm{whole}} = \sum_i N_i. The resized set Gˉ\bar{G} is supplied initially, used for cropping, and repeated in each CPI reply. Image order is preserved.

All tool coordinates and crops use the fixed working image Gˉ\bar{G}. The local renderer, output-size allowance, and global interpolation rule are held fixed across conditions.

Spectrum-Matched Scale Selection

SMR follows the active-tile spectrum and minimum-cost frequency-matching rule in § 3.1. The image is converted to grayscale, partitioned into p×pp \times p tiles, and ranked by gradient energy. Radial Fourier power from the retained tiles gives fηf_\eta, which determines the target scale under the token bounds in Table 24. Images with zero non-DC power use the minimum-budget scale.

RuleParameterEvaluated setting
Fixed-tokenTarget count NtargetN_{\mathrm{target}}1024, 2048, 3072, 4096, 5120
SpectrumActive-tile fraction ρ\rho0.25
SpectrumEnergy quantile η\eta0.90
SpectrumTarget cycles per token τ\tau0.77
SpectrumPer-image bounds (Nmin⁡,Nmax⁡)(N_{\min}, N_{\max})(512, 4608)
Backend propertyEffective stride pp (Qwen profile)32 pixels

Table 24. Resize parameters used in the reported study. SMR parameters are held fixed across benchmarks rather than tuned to a task label. Fixed-token resizing supplies the frequency-independent controls.

For multiple images under a shared cap, the adapter reserves the per-image minimum and proportionally reduces requested allocations above that minimum when necessary. Grid alignment remains within the resulting allocations. Scale choices are computed once per image and cached throughout the interaction.

The frequency target and token bounds remain fixed across benchmarks. Fixed-token resizing provides the frequency-independent control.

Implementation and Cost Accounting

Spectrum estimation runs once before inference. The selected scale and working image are cached for the interaction, and the reported end-to-end latency includes this preprocessing. Each run records the processed dimensions, realized visual-token allocation, and selected scale.

System-Level Error Taxonomy

The analysis covers the complete five-benchmark, three-run archive for VISTA and ResVision. Its unit is one judged prediction for one model, run, and question, giving 4×3×1,679=20,1484 \times3 \times1{,}679 = 20{,}148 predictions per method. A Kimi-K3 judge assigns every incorrect prediction to one mutually exclusive category using the task prompt, reference answer, final response, and inspection trace. Percentages use all 20,148 predictions as the denominator.

Six failure modes. Detail accessibility and detail interpretation are distinct: a cue may be difficult to distinguish at the full-image scale, or it may be visible but used incorrectly. We partition every incorrect prediction into six mutually exclusive classes.

F1—referent binding is an identity error: the model reads a local cue but attaches it to the wrong object, cell, image, or coordinate. In the D6 counting case (Appendix § 16.§ 1), the crop makes the vertical marks legible but removes the row and column headers. The defining question is which entity or location does this evidence belong to?

F2—candidate-contrast omission is a comparison error: the model accepts one plausible candidate without checking alternatives that could distinguish it. In the horse reconstruction case (Appendix § 16.§ 4), the extra yellow bar in A becomes decisive only when the candidate inventories are compared. The defining question is what distinguishes this candidate from the others?

F3—spatial/transform inconsistency is a relational error: the model recognizes relevant local parts but combines them under an incorrect direction, rotation, topology, ordering, or cross-view correspondence. In the rotation case (Appendix § 16.§ 2), wedge colors can be read correctly while the requested transformation and answer option become mismatched. The defining question is how must these parts correspond after the stated relation or transformation?

F4—local-detail overinterpretation is an interpretation error: the model identifies the correct entity and region but gives a local attribute the wrong meaning because the crop omits scale, pose, or object-level context. In the volleyball case (Appendix § 16.§ 5), the arm-and-ball crop supports a plausible “set” interpretation, while the full pose supports “bump.” The defining question is what does this cue mean in the complete object or scene?

F5—coverage/count aggregation collects failures to exhaustively enumerate repeated instances or reconcile partial counts. Its defining question is has the reasoning covered and reconciled every relevant instance?

F6—other errors contains residual failures outside the preceding five classes.

Together, F1–F6 separate identity, comparison, relation, interpretation, aggregation, and other residual causes. C1P supplies grounding for the first four, while the complete interaction can also support systematic coverage and reconciliation.

Stacked bars showing error incidence for VISTA and ResVision, with segments for F1 referent, F2 contrast, F3 spatial, F4 interpretation, F5 coverage, F6 other, and correct

Figure 14. Error incidence over all predictions. Each bar uses the same fixed total of 20,148 predictions. Colored segments show the six failure classes and the pale remainder is correct. ResVision reduces the overall error mass from 27.6% to 19.8%.

Table 25: Absolute incidence of system-level errors. Percentages use the fixed 20,148 predictions per method. Negative Δn\Delta n favors ResVision.

Error categoryVISTA nn (%)ResVision nn (%)Δn\Delta nRel. reduction
F1 Referent binding597 (3.0)419 (2.1)−17829.8%
F2 Candidate contrast569 (2.8)406 (2.0)−16328.6%
F3 Spatial consistency701 (3.5)514 (2.6)−18726.7%
F4 Detail overinterpretation834 (4.1)730 (3.6)−10412.5%
F5 Coverage/count aggregation1,867 (9.3)1,201 (6.0)−66635.7%
F6 Other1,002 (5.0)718 (3.6)−28428.3%
All errors5,570 (27.6)3,988 (19.8)−1,58228.4%

Table 25.

Table 26: Question-matched error transitions from VISTA to ResVision. Fixed denotes VISTA-wrong/ResVision-correct predictions; regressed is the reverse. The category is assigned on the failing side.

Error categoryVISTA errorsFixedRegressedDiffFix rateExact pp
F1 Referent binding59730199+20250.4%8.6×10−258.6 \times10^{-25}
F2 Candidate contrast569313108+20555.0%3.2×10−243.2 \times10^{-24}
F3 Spatial consistency701335156+17947.8%4.5×10−164.5 \times10^{-16}
F4 Detail overinterpretation834325188+13739.0%1.5×10−91.5 \times10^{-9}
F5 Coverage/count aggregation1,867855223+63245.8%1.1×10−871.1 \times10^{-87}
F6 Other1,002389162+22738.8%1.5×10−221.5 \times10^{-22}
All errors5,5702,518936+1,58245.2%<10−99< 10^{-99}

Table 26.

ResVision removes 1,582 errors overall, with declines in all six classes: 29.8% for referent binding, 28.6% for candidate contrast, 26.7% for spatial consistency, 12.5% for local-detail overinterpretation, 35.7% for coverage/count aggregation, and 28.3% for other errors.

In the matched analysis, ResVision corrects 38.8–55.0% of VISTA errors within each class and introduces fewer reverse transitions in all six. Across the taxonomy, 2,518 predictions are fixed and 936 regress, a net gain of 1,582 question-matched predictions (p<10−99p < 10^{-99}, exact two-sided McNemar test). Table 27 reports the per-benchmark distribution.

Table 27: Complete error taxonomy by benchmark. Entries are count (percentage of all predictions for that benchmark).

BenchmarkMethodF1 BindF2 ContrastF3 SpatialF4 DetailF5 CoverageF6 ResidualAll errors
BabyVisionVISTA380 (8.2)342 (7.3)407 (8.7)96 (2.1)564 (12.1)420 (9.0)2,209 (47.4)
BabyVisionResVision219 (4.7)199 (4.3)291 (6.2)78 (1.7)277 (5.9)262 (5.6)1,326 (28.5)
VLMsAreBiasedVISTA26 (0.5)56 (1.2)62 (1.3)215 (4.5)1,229 (25.6)330 (6.9)1,918 (40.0)
VLMsAreBiasedResVision6 (0.1)49 (1.0)42 (0.9)216 (4.5)863 (18.0)272 (5.7)1,448 (30.2)
BLINKVISTA163 (3.4)166 (3.5)126 (2.6)124 (2.6)16 (0.3)214 (4.5)809 (16.9)
BLINKResVision158 (3.3)152 (3.2)102 (2.1)108 (2.2)9 (0.2)152 (3.2)681 (14.2)
VStarBenchVISTA26 (1.1)0 (0.0)56 (2.4)83 (3.6)5 (0.2)8 (0.3)178 (7.8)
VStarBenchResVision33 (1.4)0 (0.0)38 (1.7)58 (2.5)8 (0.3)7 (0.3)144 (6.3)
MMVPVISTA2 (0.1)5 (0.1)50 (1.4)316 (8.8)53 (1.5)30 (0.8)456 (12.7)
MMVPResVision3 (0.1)6 (0.2)41 (1.1)270 (7.5)44 (1.2)25 (0.7)389 (10.8)

Table 27.

Representative Failure Cases

Five cases illustrate the dominant context-sensitive failure classes in Sec. G. They are ordered by the consequence of losing global context: referent, spatial relation, coverage, candidate contrast, and local interpretation. The cases were selected after the quantitative taxonomy was completed and do not determine its categories or statistics.

CaseCategoryBenchmark / IDGlobal constraintDirectVISTAResVision
AF1 Referent bindingVLMsAreBiased / 62280cell address1/31/33/3
BF3 Spatial consistencyBabyVision / 510row–transform mapping0/31/33/3
CF5 Coverage aggregationBabyVision / 4552complete lattice0/30/33/3
DF2 Candidate contrastBabyVision / 2353shared inventory1/30/33/3
EF4 Detail interpretationMMVP / 90100whole-body pose3/30/33/3

Table 28. Severity-ordered qualitative cases. Entries are exact-match successes out of three runs.

The common requirement. Local evidence must retain a role in the complete task: an address, a transform, a position in a coverage ledger, a competing hypothesis, or an object-level context. ResVision preserves that role while inspecting the detail.

Case A (F1): Bind the Detail to the Right Referent

The question asks how many vertical marks appear in cell D6. Enlargement makes the marks easier to distinguish, while the full table supplies their row and column address. A correct local count answers the question only if it is bound to D6.

  • Direct answers 4, 3, 4. It is correct once, but the count changes across runs because the small marks are difficult to read reliably in the full table.

  • VISTA answers 2, 4, 3. Its crop makes the marks larger, but removes the row and column headers. The model can therefore read a nearby cell clearly while losing confidence about whether that cell is D6.

  • ResVision answers 3, 3, 3. It first locates column D and row 6 in the full table, then enlarges only their intersection and counts the three marks there.

Why this matters. A clear local observation is useful only when it remains attached to the correct global referent.

Comparison of VISTA and ReVision approaches for referent binding, including an original question grid, local crop, global context, and local detail

Figure 15. F1—referent binding. The crop resolves the marks; the full table proves that they belong to D6. The figure includes the labels “Original question,” “Q: How many vertical lines are in cell D6?”, “A: 3,” “VISTA,” “1. Inspect locally,” “Enlarge a cell-sized region,” “2. Read the marks,” “Count visible strokes without reliable row and column anchors,” “3. Commit,” “Return a locally plausible count,” “Outcome: wrong cell/count in 2 of 3 runs,” “ReVision,” “Global context,” “1. Anchor globally,” “Locate column D and row 6 in the complete table,” “2. Inspect locally,” “Magnify their intersection only,” “3. Re-ground,” “Bind the three visible marks back to D6,” “Local detail,” and “Outcome: 3, correct in all 3 runs.”

Case B (F3): Preserve the Spatial Contract

The question asks for three different rotations and expects an ordered triple. Each local match must therefore stay linked to its source row, requested angle, and final option number.

  • Direct answers (6, 4, 5), (6, 4, 5), and (5, 1, 3). It can recognize some rotated patterns, but does not keep all three row-specific correspondences correct at once.

  • VISTA answers (4, 6, 2), (6, 2, 3), and (6, 4, 2). Enlarged wedges clarify the local color order, yet the row-to-angle-to-option bookkeeping is lost in two runs.

  • ResVision answers (6, 4, 2) in all three runs. It uses local views to resolve wedge order while the full layout keeps row 1, row 2, and row 3 tied to the right transformations and options.

Why this matters. A correct local match is not enough; it must be returned to the right place in the ordered answer.

F3 spatial consistency comparison of Direct, VISTA, and ResVision

Figure 16. F3—spatial consistency. Each local match remains attached to its source row, requested transform, and option index.

Case C (F5): Make Coverage Auditable

The question asks for the total number of dark cells in a 10×1110 \times11 grid. Individual cells are easy to identify, but the final count is correct only if every position is visited once, with no omissions or duplicates.

  • Direct answers 37, 39, 46. All three totals are too small, which is consistent with losing cells while reading a dense grid at its original scale.

  • VISTA answers 59, 60, 52. Zooming makes a local group of cells easier to read, but the totals move above and below the truth because there is no explicit record of which positions have already been counted.

  • ResVision answers 54, 54, 54. It treats the full lattice as a ledger, records the row totals 2, 3, 5, 7, 3, 7, 10, 8, 4, 5, 0, and checks that every cell contributes exactly once before summing them.

Why this matters. Precise local readings still need a global coverage plan to become a reliable aggregate.

F5—coverage aggregation

Figure 17. F5—coverage aggregation. Global indexing turns local readings into a complete, nonoverlapping count.

Case D (F2): Compare the Competing Hypotheses

The question asks which option contains exactly the same pieces as the target horse. Options A and C look similar, so the decision depends on comparing their complete piece inventories rather than describing the target alone.

  • Direct answers A, A, and C. It notices the overall resemblance, but only one run distinguishes the candidates correctly.

  • VISTA answers A in all three runs. Its close view gives a detailed description of the target horse, yet does not place A and C in the same comparison; the extra yellow bar in A is therefore overlooked.

  • ResVision answers C in all three runs. It compares the target, A, and C together, checks the piece inventory item by item, and rejects A after finding its extra yellow bar.

Why this matters. Inspection should test competing hypotheses against one shared reference and compare every plausible option.

Comparison of VISTA and ResVision inspection strategies for candidate contrast

Figure 18. F2—candidate contrast. The decisive evidence appears only when target, A, and C share one comparison.

Case E (F4): Interpret the Detail in the Whole Pose

The question asks whether the player is more likely to bump or set the volleyball. A close view of the arms and ball can suggest either action; the whole-body pose is needed to decide which interpretation is physically consistent.

  • Direct answers A (bump) in all three runs. In this example the full image already preserves the decisive cue: the player is leaning forward with joined forearms held low.

  • VISTA answers B (set) in all three runs. The crop emphasizes a bent arm and a high ball, which supports a plausible local story about setting, but hides the rest of the posture that contradicts it.

  • ResVision answers A (bump) in all three runs. It inspects the arm-and-ball region while retaining the full pose, then checks that the local cue agrees with the joined forearm platform and forward body geometry.

Why this matters. This example separates detail accessibility from interpretation: Direct already reads the complete pose correctly, but the local inspection supports a misleading action hypothesis. Keeping the whole beside the detail provides the context for checking that hypothesis.

Comparison of the original question, VISTA's local-detail interpretation, and ResVision's whole-pose interpretation

Figure 19. F4—detail interpretation. The crop is sharp, but the whole-body geometry determines the action. Graphic text: Original question. Q: What is the woman more likely to do: (A) bump or (B) set? A: A (bump). VISTA. 1. Inspect contact Zoom around the player, arms, and ball. 2. Read locally Treat the bent arm and high ball as an overhead setting cue. 3. Commit Choose set without checking the complete body geometry. Outcome: B (set), incorrect in all 3 runs. ResVision. Global context. 1. Keep the whole pose Retain the player's body axis and both arms. 2. Inspect the platform See joined forearms extended forward and low. 3. Reconcile Interpret the local cue under the complete posture. Local detail. Outcome: A (bump), correct in all 3 runs.

References

  1. [1]Jean-Baptiste Alayrac, Jeff Donahue, Pauline Luc, Antoine Miech, Iain Barr, Yana Hasson, Karel Lenc, Arthur Mensch, Katherine Millican, Malcolm Reynolds, et al. Flamingo: A visual language model for few-shot learning. In Advances in Neural Information Processing Systems, 2022.arxiv.org/abs/2204.14198
  2. [2]Jinze Bai, Shuai Bai, Shusheng Yang, Shijie Wang, Sinan Tan, Peng Wang, Junyang Lin, Chang Zhou, and Jingren Zhou. Qwen-VL: A versatile vision-language model for understanding, localization, text reading, and beyond, 2023.arxiv.org/abs/2308.12966
  3. [3]Ruzena Bajcsy. Active perception. Proceedings of the IEEE, 76(8):996–1005, 1988.DOI
  4. [4]Lucas Beyer, Pavel Izmailov, Alexander Kolesnikov, Mathilde Caron, Simon Kornblith, Xiaohua Zhai, Matthias Minderer, Michael Tschannen, Ibrahim Alabdulmohsin, and Filip Pavetic. FlexiViT: One model for all patch sizes. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 14496–14506, 2023.arxiv.org/abs/2212.08013
  5. [5]Daniel Bolya, Cheng-Yang Fu, Xiaoliang Dai, Peizhao Zhang, Christoph Feichtenhofer, and Judy Hoffman. Token merging: Your ViT but faster. In International Conference on Learning Representations, 2023.arxiv.org/abs/2210.09461
  6. [6]Mu Cai, Haotian Liu, Siva Karthik Mustikovela, Gregory P. Meyer, Yuning Chai, Dennis Park, and Yong Jae Lee. ViP-LLaVA: Making large multimodal models understand arbitrary visual prompts. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 12914–12923, 2024.arxiv.org/abs/2312.00784
  7. [7]Liang Chen, Weichu Xie, Yiyan Liang, Hongfeng He, Hans Zhao, Zhibo Yang, Zhiqi Huang, Haoning Wu, Haoyu Lu, et al. BabyVision: Visual reasoning beyond language. arXiv preprint arXiv:2601.06521, 2026.arxiv.org/abs/2601.06521
  8. [8]Xi Chen, Xiao Wang, Soravit Changpinyo, A. J. Piergiovanni, Piotr Padlewski, Daniel Salz, Sebastian Goodman, Adam Grycner, Basil Mustafa, Lucas Beyer, et al. PaLI: A jointly-scaled multilingual language-image model. In International Conference on Learning Representations, 2023.arxiv.org/abs/2209.06794
  9. [9]Zhe Chen, Jiannan Wu, Wenhai Wang, Weijie Su, Guo Chen, Sen Xing, Muyan Zhong, Qinglong Zhang, Xizhou Zhu, Leiwei Lu, Bin Li, Ping Luo, Tong Lu, Yu Qiao, and Jifeng Dai. InternVL: Scaling up vision foundation models and aligning for generic visual-linguistic tasks. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 24185–24198, 2024.
  10. [10]Wenliang Dai, Junnan Li, Dongxu Li, Anthony Meng Huat Tiong, Junqi Zhao, Weisheng Wang, Boyang Li, Pascale Fung, and Steven Hoi. InstructBLIP: Towards general-purpose vision-language models with instruction tuning. In Advances in Neural Information Processing Systems, 2023.
  11. [11]DeepSeek-AI. DeepSeek-V4.1-Flash: Pushing the limits of KV cache compression. arXiv preprint arXiv:2609.19969, 2026.
  12. [12]Mostafa Dehghani, Basil Mustafa, Josip Djolonga, Jonathan Heek, Matthias Minderer, Mathilde Caron, Andreas Steiner, Joan Puigcerver, Robert Geirhos, Ibrahim Alabdulmohsin, Avital Oliver, Piotr Padlewski, Alexey Gritsenko, Mario Lucic, and Neil Houlsby. Patch n’ pack: NaViT, a vision transformer for any aspect ratio and resolution. In Advances in Neural Information Processing Systems, 2023.arxiv.org/abs/2307.06304
  13. [13]Alexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn, Xiaohua Zhai, Thomas Unterthiner, Mostafa Dehghani, Matthias Minderer, Georg Heigold, Sylvain Gelly, Jakob Uszkoreit, and Neil Houlsby. An image is worth 16x16 words: Transformers for image recognition at scale. In International Conference on Learning Representations, 2021.
  14. [14]Xingyu Fu, Yushi Hu, Bangzheng Li, Yu Feng, Haoyu Wang, Xudong Lin, Dan Roth, Noah A. Smith, Wei-Chiu Ma, and Ranjay Krishna. BLINK: Multimodal large language models can see but not perceive. arXiv preprint arXiv:2404.12390, 2024.arxiv.org/abs/2404.12390
  15. [15]Jun Gao, Yongqi Li, Ziqiang Cao, and Wenjie Li. Interleaved-modal chain-of-thought. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 19520–19529, 2025.arxiv.org/abs/2411.19488
  16. [16]Xingang Guo, Utkarsh Tyagi, Advait Gosai, Paula Vergara, Jayeon Park, Ernesto Gabriel Hernández Montoya, Chen Bo Calvin Zhang, Bin Hu, Yunzhong He, Bing Liu, and Rakshith Sharma Srinivas. Beyond seeing: Evaluating multimodal LLMs on tool-enabled image perception, transformation, and reasoning. arXiv preprint arXiv:2501.12712, 2025.
  17. [17]Tanmay Gupta and Aniruddha Kembhavi. Visual programming: Compositional visual reasoning without training. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 14953–14962, 2023.arxiv.org/abs/2211.11559
  18. [18]Qiushi Han, Keya Hu, Linlu Qiu, Cathy Wu, and Kaiming He. VISTA: A visual harness for reasoning in an interactive world. arXiv preprint arXiv:2610.02200, 2026.arxiv.org/abs/2610.02200
  19. [19]Wenyi Hong, Weihan Wang, Qingsong Lv, Jiazhen Xu, Wenmeng Yu, Junhui Ji, Yan Wang, Zihan Wang, Yuxiao Dong, Ming Ding, and Jie Tang. CogAgent: A visual language model for GUI agents. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 14281–14290, 2024.arxiv.org/abs/2312.08914
  20. [20]Yushi Hu, Weijia Shi, Xingyu Fu, Dan Roth, Mari Ostendorf, Luke Zettlemoyer, Noah A. Smith, and Ranjay Krishna. Visual sketchpad: Sketching as a visual chain of thought for multimodal language models. In Advances in Neural Information Processing Systems, 2024.arxiv.org/abs/2406.09403
  21. [21]Woojun Jung, Jaehoon Go, Mingyu Jeon, Sunjae Yoon, and Junyeong Kim. Visual funnel: Resolving contextual blindness in multimodal large language models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Findings, pages 8962–8971, 2026.arxiv.org/abs/2512.10362
  22. [22]Jing Yu Koh, Robert Lo, Lawrence Jang, Vikram Duvvur, Ming Lim, Po-Yu Huang, Graham Neubig, Shuyan Zhou, Ruslan Salakhutdinov, and Daniel Fried. VisualWebArena: Evaluating multimodal agents on realistic visual web tasks. In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics, pages 881–905, 2024.
  23. [23]Kenton Lee, Mandar Joshi, Iulia Raluca Turc, Hexiang Hu, Fangyu Liu, Julian Martin Eisenschlos, Urvashi Khandelwal, Peter Shaw, Ming-Wei Chang, and Kristina Toutanova. Pix2Struct: Screenshot parsing as pretraining for visual language understanding. In Proceedings of the 40th International Conference on Machine Learning, pages 18893–18912, 2023.arxiv.org/abs/2210.03347
  24. [24]Junnan Li, Dongxu Li, Silvio Savarese, and Steven Hoi. BLIP-2: Bootstrapping language-image pre-training with frozen image encoders and large language models. In Proceedings of the 40th International Conference on Machine Learning, 2023.arxiv.org/abs/2301.12597
  25. [25]Zhang Li, Biao Yang, Qiang Liu, Zhiyin Ma, Shuo Zhang, Jingxu Yang, Yabo Sun, Yuliang Liu, and Xiang Bai. Monkey: Image resolution and text label are important things for large multi-modal models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 26763–26773, 2024.arxiv.org/abs/2311.06607
  26. [26]Haotian Liu, Chunyuan Li, Qingyang Wu, and Yong Jae Lee. Visual instruction tuning. In Advances in Neural Information Processing Systems, 2023.
  27. [27]Shilong Liu, Hao Cheng, Haotian Liu, Hao Zhang, Feng Li, Tianhe Ren, Xueyan Zou, Jianwei Yang, Hang Su, Jun Zhu, Lei Zhang, Jianfeng Gao, and ChunYuan Li. LLaVA-Plus: Learning to use tools for creating multimodal agents. In European Conference on Computer Vision, 2024.arxiv.org/abs/2311.05437
  28. [28]Ze Liu, Yutong Lin, Yue Cao, Han Hu, Yixuan Wei, Zheng Zhang, Stephen Lin, and Baining Guo. Swin transformer: Hierarchical vision transformer using shifted windows. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 10012–10022, 2021.arxiv.org/abs/2103.14030
  29. [29]Volodymyr Mnih, Nicolas Heess, Alex Graves, and Koray Kavukcuoglu. Recurrent models of visual attention. In Advances in Neural Information Processing Systems, pages 2204–2212, 2014.arxiv.org/abs/1406.6247
  30. [30]Moonshot AI. Kimi K3: Open frontier intelligence. Official technical blog, https://www.kimi.com/en/blog/kimi-k3, 2026.arxiv.org/abs/2607.24653
  31. [31]Namuk Park and Songkuk Kim. How do vision transformers work? In International Conference on Learning Representations, 2022.arxiv.org/abs/2202.06709
  32. [32]Zhiliang Peng, Wenhui Wang, Li Dong, Yaru Hao, Shaohan Huang, Shuming Ma, Qixiang Ye, and Furu Wei. Grounding multimodal large language models to the world. In International Conference on Learning Representations, 2024.
  33. [33]Zihan Qiu, Zekun Wang, Xiao Li, Yanpeng Li, Yang Xu, Yixuan Wang, Huaqing Zhang, Rui Men, Boqiao Mao, Chengruodong Zhang, et al. On the design of Qwen3.8-Next architecture: Evaluation, efficiency, and training stability, 2026.arxiv.org/abs/2608.30320
  34. [34]Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, Gretchen Krueger, and Ilya Sutskever. Learning transferable visual models from natural language supervision. In Proceedings of the 38th International Conference on Machine Learning, pages 8748–8763, 2021.arxiv.org/abs/2103.00020
  35. [35]Yongming Rao, Wenliang Zhao, Benlin Liu, Jiwen Lu, Jie Zhou, and Cho-Jui Hsieh. DynamicViT: Efficient vision transformers with dynamic token sparsification. In Advances in Neural Information Processing Systems, 2021.arxiv.org/abs/2106.02034
  36. [36]Michael S. Ryoo, A. J. Piergiovanni, Anurag Arnab, Mostafa Dehghani, and Anelia Angelova. TokenLearner: Adaptive space-time tokenization for videos. In Advances in Neural Information Processing Systems, 2021.
  37. [37]Hao Shao, Shengju Qian, Han Xiao, Guanglu Song, Zhuofan Zong, Letian Wang, Yu Liu, and Hongsheng Li. Visual CoT: Advancing multi-modal language models with a comprehensive dataset and benchmark for chain-of-thought reasoning. arXiv preprint arXiv:2403.16999, 2024.arxiv.org/abs/2403.16999
  38. [38]Dídac Surís, Sachit Menon, and Carl Vondrick. ViperGPT: Visual inference via Python execution for reasoning. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 11888–11898, 2023.arxiv.org/abs/2303.08128
  39. [39]Shengbang Tong, Zhuang Liu, Yuexiang Zhai, Yi Ma, Yann LeCun, and Saining Xie. Eyes wide shut? exploring the visual shortcomings of multimodal LLMs. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 9568–9578, 2024.arxiv.org/abs/2401.06209
  40. [40]An Vo, Khai-Nguyen Nguyen, Mohammad Reza Taesiri, Vy Tuong Dang, Anh Totti Nguyen, and Daeyoung Kim. Language models are biased. arXiv preprint arXiv:2505.23941, 2025.
  41. [41]Chenfei Wu, Shengming Yin, Weizhen Qi, Xiaodong Wang, Zecheng Tang, and Nan Duan. Visual ChatGPT: Talking, drawing and editing with visual foundation models, 2023.arxiv.org/abs/2303.04671
  42. [42]Penghao Wu and Saining Xie. V*: Guided visual search as a core mechanism in multimodal LLMs. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 13084–13094, 2024.arxiv.org/abs/2312.14135
  43. [43]Tianbao Xie, Danyang Zhang, Jixuan Chen, Xiaochuan Li, Siheng Zhao, Ruisheng Cao, Toh Jing Hua, Zhoujun Cheng, Dongchan Shin, Fangyu Lei, Yitao Liu, Yiheng Xu, Shuyan Zhou, Silvio Savarese, Caiming Xiong, Victor Zhong, and Tao Yu. OSWorld: Benchmarking multimodal agents for open-ended tasks in real computer environments. In Advances in Neural Information Processing Systems, 2024.arxiv.org/abs/2404.07972
  44. [44]Ruyi Xu, Yuan Yao, Zonghao Guo, Junbo Cui, Zanlin Ni, Chunjiang Ge, Tat-Seng Chua, Zhiyuan Liu, Maosong Sun, and Gao Huang. LLaVA-UHD: an LMM perceiving any aspect ratio and high-resolution images. arXiv preprint arXiv:2403.11703, 2024.arxiv.org/abs/2403.11703
  45. [45]Zhengyuan Yang, Linjie Li, Jianfeng Wang, Kevin Lin, Ehsan Azarnasab, Faisal Ahmed, Zicheng Liu, Ce Liu, Michael Zeng, and Jiujuan Wang. MM-REACT: Prompting ChatGPT for multimodal reasoning and action. arXiv preprint arXiv:2303.11381, 2023.arxiv.org/abs/2303.11381
  46. [46]Shunyu Yao, Jeffrey Zhao, Dian Yu, Nan Du, Izhak Shafran, Karthik Narasimhan, and Yuan Cao. ReAct: Synergizing reasoning and acting in language models. In International Conference on Learning Representations, 2023.arxiv.org/abs/2210.03629
  47. [47]Haoxuan You, Haotian Zhang, Zhe Gan, Xianzhi Du, Bowen Zhang, Zirui Wang, Liangliang Cao, Shih-Fu Chang, and Yinfei Yang. Ferret: Refer and ground anything anywhere at any granularity. In International Conference on Learning Representations, 2024.arxiv.org/abs/2310.07704
  48. [48]Z.ai. GLM-5.3-Flash: Frontier intelligence, flash cost. Official technical blog, https://z.ai/blog/glm-5.3-flash, 2026.
  49. [49]Boyuan Zheng, Boyu Gou, Jihyung Kil, Huan Sun, and Yu Su. GPT-4V(ision) is a generalist web agent, if grounded. In Proceedings of the 41st International Conference on Machine Learning, pages 61349–61385, 2024.arxiv.org/abs/2401.01614

Paper details

vlnc:W_vzvqpg2g
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC0-1.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

GPT (multiple versions)

View statement
Looking for related papers…
Contents