Skip to content
Preprint

Funnel of Thoughts: Efficient Test-Time Scaling via Early Voting and Rollout Pruning

Aug 2026 · 0 citations · 26 references
Computer Science

TL;DR

Funnel of Thoughts (FoT) is introduced, an inference-time method that preserves the full 32-trajectory voted accuracy while halving its attention FLOPs, a 28.8% reduction in full-model inference cost.

Abstract

Large Reasoning Models produce diverse, sometimes inconsistent answers across repeated queries on the same problem, so multi-sample inference is a prerequisite for reliable deployment. Majority voting at k rollouts is the standard solution and the de facto accuracy target for this regime, but it is prohibitively expensive at the scale LRMs require. We introduce Funnel of Thoughts (FoT), an inference-time method that preserves the full 32-trajectory voted accuracy while halving its attention FLOPs, a 28.8% reduction in full-model inference cost. Across 115K reasoning trajectories from six LRMs, we find that unproductive trajectories often reveal themselves through repeated hesitation markers such as"Wait","Actually", and"perhaps."These trajectories are less likely to reach the correct answer and consume disproportionate attention FLOPs, degenerating into no-answer loops in the worst case. Built on this training-free lexical signal, FoT identifies the vocabulary that captures these pathological patterns and prunes affected trajectories before completion, reducing online generation attention FLOPs by 56.1% and wall time by 37.6% without any additional model inference; the same signal transfers without retuning across held-out architectures and out-of-domain tasks.

View source

Similar papers

Preprint Aug 2026

More Correct Mass, Worse Answers: Why Power Sampling Can Fail and How to Fix It

Power Sampling sharpens a language model's distribution over complete generation trajectories, offering a verifier-free way to improve reasoning at inference time. It also has the potential to serve as a general-purpose front end for a broad range of downstream sampling methods. However, we uncover a striking paradox:...

Hao-Sen Yang, Jia-Xing Sun, Xiujun Ma · 1 citation
Preprint Aug 2026

Refining Over Resampling: Test-Time Self-Correction for LLM Reasoning

Results show that test-time compute can be more effective when used to refine sampled trajectories rather than only to sample more candidates or rely on verifier-guided selection.

Ahsan Bilal, Muhammad Ahmed Mohsin, Muhammad Umer et al. · 0 citations
Preprint Aug 2026

When Many Answers Are Valid, Voting Fails: Symbolic Verification for Best-of-K Causal Reasoning in LLMs

This work introduces CALVER (Causal Axiom-Level VERification), a training-free symbolic verifier that scores structured traces against Pearl's causal criteria, including -separation, backdoor adjustment, and intervention, and selects the highest-scoring candidate without consulting a reference answer.

Omatharv Bharat Vaidya, C. Jerzak, Zayne Sprague et al. · 0 citations
Review Aug 2026

POOL: Propagated Uncertainty Over Lookalikes

This work instantiate this framework with p, a hybrid estimator that combines verbal confidence with spectral answer diversity computed from the negative von Neumann entropy of sampled answer embeddings, and achieves higher average AUROC than verbal confidence and sampling-based uncertainty while using half as many sam...

Rounak Sharma, Ananya B. Sai, Soumyabrata Pal · 0 citations
Jul 2026

OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping

OS-Pruner is a lightweight plug-in framework that formulates chain-of-thought pruning as an optimal stopping problem that achieves 20-60\% reduction in generation length with minimal accuracy sacrifice on diverse reasoning benchmarks and base models.

Mohammed Ehab, Aymane El Gadarri, Vivek F. Farias et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.