arXiv cs.AI· Qingni Wang, Changdae Oh, Yuzhe Yang, Sharon Li, Jiachen Yang, Ang Li, Xin Eric Wang·· 2 天前AI 评分38
LEASH:面向计算机使用智能体的不确定性感知弱到强升级与监督框架
LEASH: Uncertainty-Aware Weak-to-Strong Escalation and Oversight for Computer-Use Agents
AI 导读
LEASH 是一个免训练框架,通过弱模型的潜在不确定性信号决定何时将控制权交给强模型,并在交接后持续监督强黑盒智能体。在 OSWorld 上,LEASH 在匹配升级率下比随机升级高出 6.55–11.94 分;搭配 Qwen3.5-35B-A3B 时任务成功率达 73.66%,每任务成本 $0.4117,与始终在线的 Claude Opus 5(72.90%)持平,推理成本降低 19.2%。
正文 · 原文
Abstract:Computer-use agents increasingly tackle long-horizon tasks, where running a frontier model at every step is expensive and a small open-weight model alone often fails. Weak-to-strong escalation offers a middle ground where a weak agent acts by default and hands control to a strong one only when needed. The core challenge is deciding when to escalate, which requires an uncertainty signal cheap enough to check at every step. However, even after handoff, the strong agent can still get lost, but a black-box API that the strong agent is usually served exposes no internals to monitor. To this end, we propose LEASH, a training-free framework that unleashes the strong agent only when the weak agent's latent uncertainty signals it is needed, and keeps it on a leash afterward. LEASH has three layers: (1) initial task uncertainty for early routing, (2) step-level uncertainty for runtime escalation, and, after handoff, (3) a shadow observer for continued oversight of the strong black-box agent. Here, we use latent uncertainty as a fuel for all three layers. Specifically, we compare the weak model's hidden states with those from its past successful and failed trajectories, and a state that looks more like the failures signals higher uncertainty. During weak-agent execution, our uncertainty estimator reuses activations already produced during action generation, so it needs no extra forward pass or dedicated monitor training. Experiments on OSWorld across four contemporary model backbones show that LEASH consistently improves over standalone weak agents and outperforms random escalation by 6.55--11.94 points at matched escalation rates. With Qwen3.5-35B-A3B, LEASH achieves 73.66% task success at $0.4117 per task, matching always-on Claude Opus 5 (72.90%) while reducing inference cost by 19.2%.
| Subjects: | Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2610.22280 [cs.AI] |
| (or arXiv:2610.22280v1 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2610.22280 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Qingni Wang [view email]
[v1]
Thu, 15 Oct 2026 17:40:12 UTC (4,645 KB)
来源:arXiv cs.AI · arxiv.org