VecCISC: Improving Confidence-Informed Self-Consistency with Reasoning Trace Clustering and Candidate Answer Selection
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
A standard technique for scaling inference-time reasoning is Self-Consistency, whereby multiple candidate answers are sampled from an LLM and the most common answer is selected. More recently, it has been shown that weighted majority voting (e.g. Confidence-Informed Self Consistency (CISC)), which assigns a confidence value to each candidate answer and chooses the answer with the largest accumulated score, tends to be more accurate on a wide range of popular benchmarks. In practice, weighted majority voting necessitates calling a critic LLM on each candidate's reasoning trace to produce the answer's confidence score. This secondary series of LLM calls greatly increases the overhead and cost of weighted majority voting, despite its potential performance benefits. To reduce this expense, we propose VecCISC, a lightweight, adaptive framework that uses a measure of semantic similarity to filter reasoning traces that are semantically equivalent to others, degenerate, or hallucinated, thus decreasing the number of candidate answers that must be evaluated by the critic. To ensure adequate experimental thoroughness, we evaluate VecCISC on five challenging, widely-adopted datasets spanning the domains of mathematics, chemistry, biology, commonsense reasoning, and the humanities. Our results demonstrate that VecCISC reduces the total token usage by 47%, while maintaining or exceeding the accuracy of CISC.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 25 of its 38 references that are in the map. First posted on arXiv 8 May 2026.
Builds on
25 of 38 references.
Closest ancestors · 11
Same direction, newest first
- 2025Do We Truly Need So Many Samples? Multi-LLM Repeated Sampling Efficiently Scales Test-Time Compute1 Apr
- 2025A Survey on Test-Time Scaling in Large Language Models: What, How, Where, and How Well?31 Mar
- 2025Efficient Test-Time Scaling via Self-Calibration25 Feb
- 2025Inference-Time Computations for LLM Reasoning and Planning: A Benchmark and Insights18 Feb
- 2025Can 1B LLM Surpass 405B LLM? Rethinking Compute-Optimal Test-Time Scaling10 Feb
- 2025Confidence Improves Self-Consistency in LLMs10 Feb
- 2024Semantic Self-Consistency: Enhancing Language Model Reasoning via Semantic Weighting10 Oct
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters6 Aug
- 2024Think Twice Before Trusting: Self-Detection for Large Language Models through Comprehensive Answer Reflection15 Mar
- 2024Escape Sky-high Cost: Early-stopping Self-Consistency for Multi-step Reasoning19 Jan
- 2023Let's Sample Step by Step: Adaptive-Consistency for Efficient Reasoning and Coding with LLMs19 May
Other references · 14
- 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
- 2024Qwen2.5 Technical Reportcited by 4,713
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019The Curious Case of Neural Text Degenerationcited by 2,881
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
- 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,758
- 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 633
- 2023Repetition In Repetition Out: Towards Understanding Neural Text Degeneration from the Data Perspectivecited by 39
- 2025The Avengers: A Simple Recipe for Uniting Smaller Language Models to Challenge Proprietary Giantscited by 37
- 2025Understanding the Repeat Curse in Large Language Models from a Feature Perspectivecited by 36
- 2025MCTS-Judge: Test-Time Scaling in LLM-as-a-Judge for Code Correctness Evaluationcited by 32
- 2024Are More LLM Calls All You Need? Towards Scaling Laws of Compound Inference Systemscited by 24
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025Optimal Self-Consistency for Efficient Reasoning with Large Language Models
- 2026Boosting Self-Consistency with Ranking
- 2025Latent Self-Consistency for Reliable Majority-Set Selection in Short- and Long-Answer Reasoning
- 2026Refining Over Resampling: Test-Time Self-Correction for LLM Reasoning
- 2024Mirror-Consistency: Harnessing Inconsistency in Majority Voting
- 2026ReSolve: Reusing Candidate Reasoning through Selective Generative Moderation
- 2025Slim-SC: Thought Pruning for Efficient Scaling with Self-Consistency
- 2024Make Every Penny Count: Difficulty-Adaptive Self-Consistency for Cost-Efficient Reasoning