The Virtues of Brevity: Avoid Overthinking in Parallel Test-Time Reasoning
Raul Cavalcante Dinardi, Bruno Yamamoto, Anna Helena Reali Costa, Artur Jordao

TL;DR
This paper shows that choosing the shortest solution in parallel test-time reasoning with LLMs is a simple yet effective heuristic that improves performance and reduces computational costs by favoring confident, concise answers over verbose overthinking.
Contribution
Demonstrates that a simple shortest-answer heuristic can match complex methods like self-consistency, offering a computationally efficient alternative for improving LLM reasoning performance.
Findings
Shortest-answer heuristic is highly effective in parallel reasoning.
The approach is competitive with complex methods on challenging benchmarks.
It provides a Pareto improvement by balancing performance and computational cost.
Abstract
Reasoning models represent a significant advance in LLM capabilities, particularly for complex reasoning tasks such as mathematics and coding. Previous studies confirm that parallel test-time compute-sampling multiple solutions and selecting the best one-can further enhance the predictive performance of LLMs. However, strategies in this area often require complex scoring, thus increasing computational cost and complexity. In this work, we demonstrate that the simple and counterintuitive heuristic of selecting the shortest solution is highly effective. We posit that the observed effectiveness stems from models operating in two distinct regimes: a concise, confident conventional regime and a verbose overthinking regime characterized by uncertainty, and we show evidence of a critical point where the overthinking regime begins to be significant. By selecting the shortest answer, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
