LLM reasoning / chain-of-thought
Self-Consistency
Self-Consistency Improves Chain of Thought Reasoning in Language Models
Heavily superseded — a standard baseline that newer methods routinely beat
24 papers critique it · 9 beat it on benchmarks
What papers say
Verbatim critique sentences, each from a paper that cites Self-Consistency as a baseline.
Although self-consistency can enhance output stability, it also often leads to hallucinations or invalid queries due to semantic errors since sampling at higher temperatures increases randomness instead of improving diversity.
“It improves accuracy without retraining but suffers from high inference cost and lacks intra-chain correction. The mistakes made early in a chain propagate to the end since errors are never revised mid-way.”
“self-consistency must be inferred multiple times, burdening deployment budgets”
“However, these prevailing strategies are inherently bounded by the quality of the set of candidates. They are limited to produce a solution that transcends the quality of candidate proposals, which becomes particularly problematic when all candidates are flawed.”
“outperforming prior refinement methods~wang2023selfconsistency”
“However, these structured reasoning methods universally require generating longer sequences or processing multiple reasoning paths, leading directly to a substantial increase in inference cost”
“However, as self-consistency is fundamentally an extension of CoT, it is unclear whether self-consistency also improves performance on non-math questions that involve the recall of encyclopedic knowledge”
“Early SC approaches focused on majority voting for final answers”
“While effective, it uses a fixed number of calls and can fail when the correct answer is infrequent.”
“While effective, SC's primary drawback is its high computational cost.”
“However, despite its effectiveness, SC incurs significant computational costs at inference time due to its requirement for multiple sampling iterations.”
“these studies predominantly focus on short tasks (e.g., math problems, brief QA), where stochastic sampling produces independent errors. This assumption breaks down in long settings where systemic errors emerge due to position bias.”
Beaten on benchmarks
Head-to-head results where a newer method reports beating Self-Consistency. Values are copied from the source paper's tables — verify against the cited paper.
CGES-LNS (arith) beats Self-Consistency
2.41 vs 16.00
CGES-DeepConf (B10) beats Self-Consistency
2.41 vs 16.00
PRM-Math beats Self-Consistency
22.6 vs 15.6
LiveCodeBench · [Qwen2.5-Coder-7B-Instruct]
From Mathematical Reasoning to Code: Generalization of Process Reward Models in Test-Time ScalingBPP-Search Variant (Our Method) beats Self-Consistency
0.933 vs 0.700
Correct Rate · [StructuredOR]
BPP-Search: Enhancing Tree of Thought Reasoning for Mathematical Modeling Problem SolvingMarginal Sharpening beats Self-Consistency
0.280 vs 0.229
LiveCodeBench · [Qwen3-1.7B, L=8192]
Self-Consistency via Marginal SharpeningRIDERS beats Self-Consistency
65.3 vs 58.9
PRM-Code beats Self-Consistency
78.6 vs 73.7
MBPP+ · [Qwen2.5-Coder-7B-Instruct]
From Mathematical Reasoning to Code: Generalization of Process Reward Models in Test-Time ScalingNash CoT beats Self-Consistency
42.0 vs 40.6
Avg. · [Mistral-Instruct (7B)]
Nash CoT: Multi-Path Inference with Preference EquilibriumCP-Full-Maj beats Self-Consistency
75.7 vs 73.8
Average · [GPT-3.5 full sampling]
Self-Consistency from Only Two Samples: CoT-PoT Ensembling for Efficient LLM ReasoningGET beats Self-Consistency
0.7244 vs 0.7074
Accuracy · [accuracy evaluation on SAF dataset]
Ensemble ToT of LLMs and Its Application to Automatic Grading System for Supporting Self-LearningCP-Full-Max beats Self-Consistency
86.3 vs 85.0
Average · [Mistral-large full sampling]
Self-Consistency from Only Two Samples: CoT-PoT Ensembling for Efficient LLM ReasoningCP-Early-FF beats Self-Consistency
85.6 vs 84.6
Accuracy · [Average early-stopping]
Self-Consistency from Only Two Samples: CoT-PoT Ensembling for Efficient LLM Reasoning
What to use instead
Recent methods in the same sub-problem, not yet superseded in the knowledge base — arXiv benchmark leaders, not vetted production recommendations.
- May 27, 2026
- Tree-of-ThoughtsTree of Thoughts as a Classical Heuristic Search Problem: Formal Foundations and Design PatternsMay 27, 2026
- May 22, 2026
- May 22, 2026
- Novelty-based Tree-of-Thought SearchNovelty-based Tree-of-Thought Search for LLM Reasoning and PlanningMay 7, 2026
- Decoding-Time Debiasing via Process Reward ModelsDecoding-Time Debiasing via Process Reward Models: From Controlled Fill-in to Open-Ended GenerationMay 4, 2026
- Apr 27, 2026
- Apr 22, 2026
- CoT-PoT ensemblingSelf-Consistency from Only Two Samples: CoT-PoT Ensembling for Efficient LLM ReasoningApr 19, 2026
- AtroposAtropos: Improving Cost-Benefit Trade-off of LLM-based Agents under Self-Consistency with Early Termination and Model HotswapApr 16, 2026
- Apr 1, 2026
- Learning When to SampleLearning When to Sample: Confidence-Aware Self-Consistency for Efficient LLM Chain-of-Thought ReasoningMar 17, 2026