LEASH: Uncertainty-Aware Weak-to-Strong Escalation and Oversight for Computer-Use Agents
Qingni Wang, Changdae Oh, Yuzhe Yang, Sharon Li, Jiachen Yang, Ang Li, Xin Eric Wang
Simular · University of Wisconsin–Madison
Published October 15, 2026 · on the feed October 16, 2026 · ▲ 8 · arXiv 2610.22280
The 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%.
The Brief
2:53A short podcast summary of the paper. Written and voiced by AI.
Transcript
LEASH. Uncertainty-Aware Weak-to-Strong Escalation and Oversight for Computer-Use Agents. By Qingni Wang and six others, from Simular and the University of Wisconsin–Madison. Published on the fifteenth of October. No code repository is linked to it.
Computer-use agents increasingly take on long-horizon tasks, and that puts two bad options on the table. Running a frontier model at every step is expensive. A small open-weight model on its own often fails. Weak-to-strong escalation sits between them: a weak agent acts by default, and hands control to a strong one only when it is needed.
That middle ground raises two difficulties. The first is deciding when to escalate, which needs an uncertainty signal cheap enough to check at every step. The second arrives after the handoff. The strong agent can still get lost, and because it is usually served through a black-box API, it exposes no internals that could be monitored. Escalation solves the cost problem only if both of those are handled.
LEASH is a training-free framework built around that pair of difficulties. It unleashes the strong agent only when the weak agent's latent uncertainty signals that it is needed, and it keeps the strong agent on a leash afterwards. There are three layers. Initial task uncertainty supports early routing, before the task gets going. Step-level uncertainty drives escalation at runtime. And after a handoff, a shadow observer provides continued oversight of the strong black-box agent.
A single kind of signal fuels all three layers: latent uncertainty. The weak model's hidden states are compared with the hidden states from its own past trajectories, both the successful ones and the failed ones. A state that looks more like the failures signals higher uncertainty. While the weak agent is executing, the estimator reuses activations that were already produced during action generation. It therefore needs no extra forward pass, and no monitor has to be trained for the purpose.
Experiments run on OSWorld across four contemporary model backbones. LEASH consistently improves over standalone weak agents. At matched escalation rates, it outperforms random escalation by between six point five five and eleven point nine four points, which separates the value of knowing when to escalate from the value of escalating at all.
The headline configuration uses Qwen3.5-35B-A3B as the weak model. It reaches seventy-three point six six percent task success at zero point four one one seven dollars per task. That matches Claude Opus 5 running always-on, at seventy-two point nine percent, while reducing inference cost by nineteen point two percent.
The design turns on where the signal comes from. The strong agent is opaque, so oversight cannot look inside it. The weak model is not opaque, and its hidden states, already computed while it acts, end up serving three jobs: routing the task at the start, deciding when to escalate, and watching the strong agent once it has taken over. Paying for the frontier model only when the cheap one signals trouble is how the combination reaches the frontier model's success rate at a lower cost.
More with an account
Listen to every day’s papers
Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.
Join free