Skip to content

When Should a VLM Look? Paying Only for Visual Calls That Were Needed and Used

Sep 2026 · 0 citations · 49 references
Computer Science

TL;DR

From the same cold start, prompt pool, and budget, CounterCredit reaches 89.5% on V*, 80.2% on HR-Bench-4K, and 76.4% on HR-Bench-8K, and raises the spurious-call rate to 31% to 36%, the lowest among the agents evaluated.

Abstract

Vision-language agents that crop and zoom are trained with rewards that credit a successful tool call, yet a successful call does not show that the model needed to look or used the pixels it received. On our cold-start checkpoint only 10% to 12% of visual calls were both needed and used, and released agents make spurious calls 36% to 87% of the time on individual benchmarks. Outcome rewards, judge rewards, and branch probes each observe one side of this failure, and about two thirds of what an outcome reward pays goes to calls that were neither needed nor used. CounterCredit asks both questions of every image-returning call at its realized pre-call state, using the policy's own gold-answer score. A decision value compares the realized visual branch with answering immediately; an evidence value compares the returned crop with random same-size patches substituted into the same call. A call verified on both earns cashback and every other executed call pays rent; the price is bounded so that every correct trajectory outranks every wrong one, and a dual-channel GRPO advantage keeps the price in its own units. From the same cold start, prompt pool, and budget, CounterCredit reaches 89.5% on V*, 80.2% on HR-Bench-4K, and 76.4% on HR-Bench-8K, 6.3 to 9.4 points above outcome-only GRPO at 1.78 against 1.84 calls per question, and lowers the spurious-call rate to 31% to 36%, the lowest among the agents evaluated. The same recipe lifts a Qwen3-VL-8B base from 75.4 to 80.8 on average.

View source

Similar papers

#small language model Preprint Oct 2026

Why VLMs Miss Small Objects, and When Zooming In Is Safe

A theory built on two quantities of the image interface: S, the number of visual tokens across an object's side, and L, the content a call must cover, which concludes that recognition improves gradually with S, and any search strategy, zoom agents included, obeys a recall-cost frontier.

Jun-Zhe Shi, Yuan Gan, Shi-Da Jiang · 0 citations
#machine learning Preprint Sep 2026

Visual Jev: Accurate and Efficient Decisions from Shared Visual Context

Many vision applications ask several independent, forced-choice questions about the same image. Visual Jev encodes the image and public context once, executes isolated question suffixes as a batch, and reads candidate probabilities from the backbone's language-model head. Across four benchmarks, answer-supervised post-...

Guan-Xu Yu, Yu-Hang Yao · 10 citations · ⚡1
#computer vision Review Sep 2026

From Routing Signals to Selective Review: Visual regrounding in MoE VLMs

Vision-language models (VLMs) may accept false visual premises, answering questions about a target object's color, count, location, or state even when it is absent. We call this reliability-critical behavior a target-absence grounding failure. Existing visual-grounding detectors primarily rely on generated responses, h...

Hong-Zhu Guo, Mohsen Fayyaz, Nan-Yun Peng · 0 citations
Preprint Sep 2026

CAPTCHAs in the Agentic Era: Solvers That Learn from Every Encounter

Vision-language models (VLMs) can solve visual CAPTCHAs without task-specific training, but the agents built on them approach every challenge from scratch. For such an agent, the hundredth instance of a familiar puzzle costs as much time and compute as the first. Specialized detectors invert the trade-off, answering in...

Oguzhan Salman, Kemal Bicakci · 0 citations
#artificial intelligence Preprint Oct 2026

Harness Compilation: Which Decisions Should a Small Vision-Language Model Keep?

Small vision-language models may be able to read external evidence yet struggle to obtain it. We introduce Harness Compilation (HC), an offline procedure that adapts the division of work between a frozen small VLM and its external harness. A large teacher uses student execution traces to revise reusable content and con...

Min-Hao Fan, Yin Liu, Jiayu Zhao et al. · 0 citations
#machine learning Preprint Oct 2026

Same Reward, Different Skills: When Multimodal RL Learns to Look

Reinforcement learning with verifiable rewards (RLVR) improves vision-language benchmark scores even without visual information during training. With images at test, blind-trained models recover roughly half of the real-image gain at 3B and nearly four fifths at 7B. Prolonged real-image training can erode grounding whi...

Hao-Cun Ye, Xin-Long Jiang, Qi-Le Chen et al. · 1 citation

Related blog posts

Hugging Face Blog Oct 20, 2026

MPS in PyTorch 2.15

We’re on a journey to advance and democratize artificial intelligence through open source and open science.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.