cs.AIAug 17, 2026

ParaTempo: Efficient Parallel Reasoning via Temporal Confidence

Authors: Xuteng Zhang, Wenhao Zeng, Xiaodong Gu, Chao Hu, Haotian Lin, Yuling Shi, Min Wang, Beijun Shen

Organizations: Shanghai Jiao Tong University · University of Pennsylvania

Abstract

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.

Figures & tables

Explore similar work

CardsList
  1. Parason: Revealing Subtask and Trial Parallelism in LLM Reasoning

    Aug 25, 2026Zhengyang Zhang, Zijian Zhang, Jiaxuan Gao +4Parallel Reasoning in Language ModelsEfficient Language Model Reasoning

  2. ThreadWeaver: Adaptive Threading for Efficient Parallel Reasoning in Language Models

    Nov 24, 2025Long Lian, Sida Wang, Felix Juefei-Xu +7Parallel Reasoning in Language ModelsRL for Language Model Reasoning

  3. Efficient Test-Time Scaling via Temporal Reasoning Aggregation

    Apr 19, 2026Jiakun Li, Xingwei He, Kefan Li +3Test-Time ScalingEfficient Language Model Inference