Genko 原稿Back to edition

VeriCUA: Verification as Agentic Exploration for Computer-Using Agents

Verifying computer-use agents needs evidence, not one screenshot. VeriCUA explores the interface, builds a rubric, and mixes GUI and code checks under evidence rules.

The explainer · 253 words

The claim

Verifying a computer-use agent means gathering evidence, not one screenshot.

The problem

Vision-language judges see only the supplied observations.

Generated programs read only the accessible state.

Both views can miss decisive evidence.

How it works

The verifier inspects the available context first.

It builds a task rubric from that context.

It selects GUI checks or code checks for open requirements.

Findings combine under explicit evidence rules.

The same procedure serves online and offline settings.

Figures

How VeriCUA checks a taskEvidence first, verdict second.

Step 1 of 4

Inspect context

The verifier reads what the environment exposes.

Two ways to verify a taskWhy a single view falls short.

Single view judge

  • A vision model reads one screenshot.
  • A program reads one state dump.
What the paper reports about verificationFindings across online and offline runs.

VeriCUA finding

Offline gains

Largest improvements appear on the hard cases.

What changes

Agreement with reference labels beats the compared baselines.

The largest offline gains appear on hard cases.

False completion claims are rejected more often online.

Limits

The paper reports relative gains, not a single score.

The verifier still needs access to GUI or code state.

The paper reports no error bar for these gains.

Source · arXiv

arxiv.org/abs/2610.40578cs.AI · cs.CL · cs.CV

More from this edition