Papers
arxiv:2610.21463

Trajectory-Level Speculation with Semantic Verification for Tool-Using Agents

Published on Oct 15
· Submitted by
WangZilin
on Oct 16
Authors:
,
,

Abstract

SpecAgent improves agent efficiency by having a small model draft tool-use steps that a large model verifies in parallel, reducing latency and memory use while preserving quality.

Large language model agents solve tasks through long sequences of tool calls, and the prevailing design has a single strong model generate every step, although many steps are routine enough for a much smaller model. Existing ways of sharing this work keep the strong model as the generator: routers and collaborative agents decide which model handles each query or step, and speculative methods check a small model's drafts one step at a time, usually against the strong model's own action. We introduce SpecAgent, a collaboration protocol that turns the strong model from the author of each step into a reviewer of steps drafted by a weak model. The weak model executes read-only tool calls as it drafts, so that every step is grounded in real observations, and holds the first action that would modify the environment. The strong model then verifies the drafted segment in a single prefill pass, commits the longest prefix it judges semantically valid, and repairs the first rejected step. Because verification replaces autoregressive decoding with parallel prefill, the strong model decodes only short verdicts and occasional repairs rather than every step. On τ^2-Bench, SpecAgent comes within one point of the strong model's success rate while roughly halving memory traffic and wall time, and on AutomationBench and VitaBench it recovers 44-75% of the quality gap while lowering both. In an edge-cloud deployment on MCP-Atlas with three cloud models, it closes 53-75% of the weak-strong quality gap while the strong model generates at most half as many tokens. These results suggest that a strong model need not author every step of an agent: reviewing grounded drafts retains most of its quality while cutting both latency and memory traffic.

Community

Paper author Paper submitter

Tool-using agents spend most of their serving cost on one thing: a large model decoding every step, token by token. But many steps are routine (look up an order, read a record, search again), and checking a step is much cheaper than writing it.

SpecAgent lets a small Weak model draft the trajectory and a large Strong model review it. The Weak model executes read-only tool calls while drafting, so every step is grounded in real observations, and it holds the first state-changing action. The Strong model then reads the whole drafted segment in one prefill pass, commits the longest prefix it judges semantically valid (not only the steps it would have written itself), and repairs the first rejected step. Most Strong decoding is replaced by prefill.

With Qwen3.5-4B drafting and Qwen3.5-397B-A17B reviewing:

  • τ²-Bench: within 1 point of Strong-only success, at 43–57% of its memory traffic and 41–54% of its wall time.
  • AutomationBench and VitaBench: recovers 44% and 75% of the Weak–Strong gap, with lower memory traffic and wall time than Strong-only.
  • MCP-Atlas edge–cloud (local 4B + three cloud Strong models): closes 53–75% of the gap while the Strong model generates 36–50% of its Strong-only tokens and API cost falls to 59–81%.

The saving is in decoding, not arithmetic: estimated FLOPs rise, so SpecAgent suits memory-bandwidth-bound serving.

Code: https://github.com/LARK-AI-Lab/SpecAgent
Project page: https://lark-ai-lab.github.io/specagent.github.io/

Sign up or log in to comment

Get this paper in your agent:

hf papers read 2610.21463
Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/2610.21463 in a model README.md to link it from this page.

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/2610.21463 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2610.21463 in a Space README.md to link it from this page.

Collections including this paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.