Papers
arxiv:2608.13667

Second Thought: Reasoning in Parallel as LLM Agents Act and Observe

Published on Aug 13
ยท Submitted by
v587su
on Aug 17
Authors:
,
,
,
,

Abstract

Second Thought is a training-free framework that runs auxiliary reasoning branches in parallel during agent action-observation waits to reduce sequential decoding and turn counts without harming accuracy.

LLM agents in the ReAct paradigm alternate between reasoning, acting, and observing, but deliberate reasoning is confined to the Thought phase: while the agent serializes an action and waits for the environment, its reasoning is frozen. We identify this recurring interval for Action and Observation as a reasoning idle window and ask whether it can host additional reasoning in parallel that serves future turns. Therefore, we propose Second Thought, a training-free inference framework that forks four auxiliary branches the instant each Thought phase concludes, decodes them concurrently with the main loop, and merges the generated thoughts back when the environment observation arrives. In this way, Second Thought relocates the added reasoning off the main thread's sequential decoding path. Across three agentic benchmarks and three reasoning LLMs, Second Thought lowers the average turn count in all nine (model,benchmark) pairs and reduces main thread decoding in six of them by up to 43% (roughly 20% on average among those settings), while leaving it essentially unchanged in a seventh; Pass@1 shows no significant change in seven of nine pairs and the two significant differences are +12.4 and +10.2 points. Against a compute-matched control that forces an equivalent budget onto the main thread's own reasoning, it attains strictly higher Pass@1 with 1.3 to 3.2 less sequential decoding in all four settings where the control applies.

Community

Paper submitter

A new idle window for test-time scaling ๐Ÿ˜ƒ

The idle-window trick only pays off if the environment call is slow enough to hide the extra compute โ€” I'd want to see the latency breakdown before buying the 4x overhead. If your tool calls return in 200ms, you're not hiding anything; you're just paying 4x for the same wall-clock. The number that decides deployment is the crossover: at what env latency does parallel reasoning actually break even? I'd run it against a slow external API and a fast local tool, measure end-to-end, and see where the curve flips. Until that's on the table, this reads like a win for slow environments and a tax on fast ones.

Sign up or log in to comment

Get this paper in your agent:

hf papers read 2608.13667
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/2608.13667 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/2608.13667 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/2608.13667 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.