跳到正文
返回论文列表
cs.AI提交于 已译

VeriCUA:以智能体探索作为计算机使用智能体的验证方法

VeriCUA: Verification as Agentic Exploration for Computer-Using Agents

Qiushi Sun · Da Yu · Alexander Knop · Amer Sinha · Lingpeng Kong · Ben Kao · et al.

中文摘要

在桌面、移动与网页环境中构建并扩展计算机使用智能体(computer-using agents, CUA),需要可靠的任务完成验证,以支撑数据整理、评测与强化学习。常见自动化做法是提示视觉语言模型(vision-language model, VLM)评判轨迹,或生成程序检查应用状态;但两者都只依赖复杂数字环境的部分视图:VLM 评判器受限于所提供的观测,生成程序则依赖可访问的状态。这些视图可能遗漏决定性证据,或使完成判定缺乏支撑。为不同平台与访问设置分别定制验证器还会增加工程成本。VeriCUA 是一个平台无关的验证框架,通过智能体探索实现验证:把验证视为在统一流程中动态收集证据并作出评估,覆盖跨平台、跨观测模态的在线与离线设置。验证器先检查可用上下文以构建任务评分标准(rubric),再针对未满足的要求选择 GUI 或代码检查,并在明确的证据规则下合并其发现。实验显示,在这些设置下与参考标签的一致性优于对比基线,离线在困难样本上提升最大,在线对虚假完成声明的拒绝更强。进一步分析将这些收益与互补证据及测试时探索联系起来。

关键要点

  1. 01现有 VLM 评判与程序检查仅依赖部分视图,可能遗漏决定性证据,导致完成判定缺乏支撑。
  2. 02VeriCUA 将验证建模为智能体探索:先构建任务评分标准,再按未满足要求选择 GUI 或代码检查。
  3. 03在明确证据规则下合并多源发现,统一覆盖在线/离线、跨平台与跨观测模态。
  4. 04与参考标签一致性优于基线,离线困难样本提升最大,在线对虚假完成声明拒绝更强。
  5. 05收益来源分析指向互补证据与测试时探索。

解读

尚无解读。

原始英文摘要

arXiv:2610.40578v1 Announce Type: new Abstract: Building and scaling computer-using agents (CUAs) across desktop, mobile, and web environments requires reliable task-completion verification for data curation, evaluation, and reinforcement learning. Typical automated approaches prompt vision-language models (VLMs) to judge trajectories or generate programs to inspect application state. However, both rely on partial views of complex digital environments. VLM judges are restricted to supplied observations, while generated programs depend on accessible state. These views can omit decisive evidence or leave completion judgments unsupported. Tailoring separate verifiers to different platforms and access settings adds further engineering cost. We present VeriCUA, a platform-agnostic framework for verification through agentic exploration. It treats verification as dynamic evidence gathering and assessment within a shared procedure for online and offline settings across platforms and observation modalities. After inspecting the available context to construct a task rubric, the verifier selects GUI or code checks for unresolved requirements and combines their findings under explicit evidence rules. Experiments show improved agreement with reference labels over the compared baselines across these settings, with the largest offline gains on hard cases and stronger rejection of false completion claims online. Further analyses connect these gains to complementary evidence and test-time exploration.

同方向论文 · cs.AI

查看全部 →

反向发现 · 这篇论文相关的工具与提示词

去交叉发现 →

关联提示词 · 6

智能体github.com/f/awesome-chatgpt-prompts·外部收录·

Weekend Planner

- Read the weekend weather, calendar and budget. - Find local events, hikes, exhibitions and restaurants. - Propose 3 plans: adventure, cozy, social, with times and costs. - Prepare reservation steps; book nothing without approval. - Rememb…

智能体github.com/f/awesome-chatgpt-prompts·外部收录·

Task Planner

--- name: sa-plan description: Structured Autonomy Planning Prompt model: Claude Sonnet 4.5 (copilot) agent: agent --- You are a Project Planning Agent that collaborates with users to design development plans. A development plan defines a…

研究github.com/f/awesome-chatgpt-prompts·外部收录·

Unified Research and Source Analysis Prompt

Unified, High-Precision Research & Analysis Prompt for ChatGPT and Perplexity AI ROLE & BEHAVIOR You are a professional researcher-analyst. Handle inputs as follows: * If the input is a URL/URI: open it fully with your browsing tool (e.g.…