ParaTempo: Efficient Parallel Reasoning via Temporal Confidence
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Parallel reasoning improves the accuracy and robustness of large reasoning models by exploring multiple solution paths, but its computational cost grows with reasoning depth and branch count. Existing methods for managing these parallel paths typically rely on final-answer consensus, local token confidence, or isolated intermediate probes. However, these signals are often delayed, weakly tied to actual reasoning progress, or too noisy for dynamic, branch-level control. To address these limitations, we introduce ParaTempo, a training-free asynchronous parallel reasoning framework. ParaTempo is driven by temporal confidence, a branch-local measure of answer-space convergence. Each branch is periodically probed for a tentative answer probability distribution, and temporal confidence quantifies how sharply the recent intermediate probes concentrate on a dominant answer. Once sufficient evidence has accumulated, ParaTempo drives its entire control process from this single signal: low-confidence branches are pruned, branches that persistently commit to their dominant answer are retired early, freed computation is reallocated by forking new branches, and generation stops globally once the confidence-weighted vote concentrates. Without requiring synchronization among reasoning trajectories, ParaTempo adaptively allocates computation based on branch-level convergence. Experiments on challenging mathematical and scientific reasoning benchmarks show that ParaTempo reduces average latency by 21.8-32.2% and total token usage by 18.1-30.3% while maintaining competitive accuracy. Moreover, temporal confidence exhibits stronger temporal stability and predictive power for future branch convergence than token-level and instantaneous signals.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 22 of its 28 references that are in the map. First posted on arXiv 17 Aug 2026.
Builds on
22 of 28 references.
Closest ancestors · 12
Same direction, newest first
- 2026Efficient Test-Time Scaling via Temporal Reasoning Aggregation19 Apr
- 2026GlimpRouter: Efficient Collaborative Inference by Glimpsing One Token of Thoughts8 Jan
- 2025DeepPrune: Parallel Scaling without Inter-trace Redundancy9 Oct
- 2025Slim-SC: Thought Pruning for Efficient Scaling with Self-Consistency17 Sep
- 2025Pruning the Unsurprising: Efficient LLM Reasoning via First-Token Surprisal8 Aug
- 2025Every Rollout Counts: Optimal Resource Allocation for Efficient Test-Time Scaling30 May
- 2025Confidence Improves Self-Consistency in LLMs10 Feb
- 2025Bridging Internal Probability and Self-Consistency for Effective and Efficient LLM Reasoning1 Feb
- 2024Reasoning Aware Self-Consistency: Leveraging Reasoning Paths for Efficient LLM Sampling30 Aug
- 2024Make Every Penny Count: Difficulty-Adaptive Self-Consistency for Cost-Efficient Reasoning24 Aug
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters6 Aug
- 2024Escape Sky-high Cost: Early-stopping Self-Consistency for Multi-step Reasoning19 Jan
Other references · 10
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
- 2026Beyond Benchmarks: MathArena as an Evaluation Platform for Mathematics with LLMscited by 137
- 2025SWE-Debate: Competitive Multi-Agent Debate for Software Issue Resolutioncited by 53
- 2024From Code to Correctness: Closing the Last Mile of Code Generation with Hierarchical Debuggingcited by 46
- 2025Answer Convergence as a Signal for Early Stopping in Reasoningcited by 40
- 2026In Line with Context: Repository-Level Code Generation via Context Inliningcited by 18
- 2026SWE-MeM: Learning Adaptive Memory Management for Long-Horizon Coding Agentscited by 15
- 2026Parallel-Probe: Towards Efficient Parallel Thinking via 2D Probingcited by 14
- 2026Dockerless: Environment-Free Program Verifier for Coding Agentscited by 9
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025ThreadWeaver: Adaptive Threading for Efficient Parallel Reasoning in Language Models
- 2025Learning Adaptive Parallel Reasoning with Language Models
- 2025A Survey on Parallel Reasoning
- 2025Adaptive Termination for Multi-round Parallel Reasoning: An Universal Semantic Entropy-Guided Framework
- 2026PaCoRe: Learning to Scale Test-Time Compute with Parallel Coordinated Reasoning
- 2026Early Stopping for Large Reasoning Models via Confidence Dynamics
- 2025The Sequential Edge: Inverse-Entropy Voting Beats Parallel Self-Consistency at Matched Compute
- 2025Dynamic Parallel Tree Search for Efficient LLM Reasoning