Skip to content

Reasoning Concentrates Errors, and Self-Consistency Never Notices

Sep 2026 · 0 citations · 22 references
Computer Science

TL;DR

It is shown that reasoning concentrates a model's errors: the probability that two independently drawn wrong answers coincide rises in all ten dataset-scale comparisons, and in nine of nine after restricting both arms to the problems each gets wrong.

Abstract

Self-consistency assumes that independent samples disagree when a model is unsure, so agreement is evidence of correctness. Holding weights fixed and toggling only a reasoning mode, over five benchmarks and 74,944 samples, we show that reasoning concentrates a model's errors: the probability that two independently drawn wrong answers coincide rises in all ten dataset-scale comparisons (p = 0.00098), and in nine of nine after restricting both arms to the problems each gets wrong. Where the answer space is unbounded, reasoning cuts the distinct answers produced to 0.43-0.65 of the non-reasoning count; where it is bounded, both arms hold an identical option set and reasoning concentrates mass on it instead, which no positional prior can explain at fixed weights. The aggregate cost is smaller than the mechanism predicts, because reasoning also shrinks the set of problems where answer diversity can decide anything, in ten of ten cells and by 2.7x; normalized for available headroom, both arms convert a quarter of it in domain. Confidence weighting does not recover what is left. Across 280 method-dataset-model combinations on eight models and five benchmarks, not one beats plain majority voting after correction; weighted voting agrees with it on 98.5% of problem-method pairs and is right 56.3% of the time on the rest; and a signal's direction can invert within fixed weights, with answer log-probability predicting correctness when reasoning is off and error when it is on. A learned six-signal combination gains nothing out of domain. Confidence signals should be evaluated on decisions, not on discrimination.

View source

Similar papers

#natural language process... Preprint Sep 2026

Calibration, Not Answer Selection: Distilling Internal Confidence in Reasoning Models

Reinforcement learning with binary correctness rewards trains correctness, not calibrated confidence. The confidence that reasoning models verbalize is systematically overconfident, and the problem is not merely one of scale: verbalized confidence tracks how willing a model is to commit to an answer, not how likely the...

Ya-Dong Xi, Rong-Sheng Zhang, Tang-Jie Lv et al. · 0 citations
#artificial intelligence Preprint Sep 2026

OBC-Prune: Outcome-Based Calibration for Large Reasoning Model Pruning

Large reasoning models (LRMs) generate long chain-of-thought traces before answering, creating significant inference overhead. Pruning can reduce this cost, but its effectiveness depends on the calibration data used to estimate parameter importance. Recent work calibrates on the model's own rollouts instead of generic...

Ha Lan Nguyen, Huy Hoang Son Tran, Trac-Duy Tran et al. · 1 citation
Preprint Aug 2026

Decomposing Wrong-Consensus Agreement in LLM Self-Consistency

This paper asks what information wrong-consensus agreement actually contains, and answers with a quantitative decomposition, and contrasts near-complete mechanical agreement in the open-weights models against a larger preference-unexplained residual in the frontier family.

Li-Zhuo Zhang, Meng-Meng Tang, Chen-Feng Long et al. · 1 citation
Preprint Aug 2026

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

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.

Chanhee Park, Sun Han, Jeongho Yoon et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Strategic Self-Consistency

The results suggest that the distribution of additional reasoning paths generated by the algorithm is heavy-tailed and that substantial capacity to overcharge remains even under the best possible audit designed to keep the false-positive rate below $\alpha = 0.1$.

Tori Qiu, Ander Artola Velasco, M. Gomez-Rodriguez · 0 citations
#artificial intelligence Preprint Oct 2026

Expanding LLM Reasoning

Extra inference compute is usually spent on sampling more reasoning chains. We study where inside an existing chain an additional continuation should begin. We define expansion utility, the change in correctness from restarting a chain at a stored step, and measure it at every eligible step for nine models on six bench...

Rian Atri, Evan Luo · 0 citations

Related blog posts

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