VecCISC: Improving Confidence-Informed Self-Consistency with Reasoning Trace Clustering and Candidate Answer Selection (2026.findings-acl)
Copied to clipboard
| Challenge: | Weighted majority voting requires a critic to evaluate each candidate’s reasoning trace to produce the answer’s confidence score. |
| Approach: | They propose a lightweight framework that uses a measure of semantic similarity to filter reasoning traces that are semantically equivalent to others, degenerate, or hallucinated. |
| Outcome: | The proposed framework reduces token usage by 47% while maintaining or exceeding the accuracy of CISC. |
Similar Papers
Confidence Improves Self-Consistency in LLMs (2025.findings-acl)
Copied to clipboard
| Challenge: | Modern large language models (LLMs) demonstrate strong reasoning capabilities, driven in part by their capacity to generate a sequence of intermediate reasoning steps that lead them toward a final answer. |
| Approach: | They propose a method that performs a weighted majority vote based on confidence scores obtained directly from the model. |
| Outcome: | The proposed method outperforms self-consistency on nine models and four datasets, reducing the required number of reasoning paths by over 40% on average. |
Reasoning Aware Self-Consistency: Leveraging Reasoning Paths for Efficient LLM Sampling (2025.naacl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) generate reasoning paths before answers, but lack a systematic approach to determine optimal number of samples or select the most faithful rationale. |
| Approach: | They propose a framework that evaluates the quality of reasoning and consistency of answers for each generated sample and uses criteria-based stopping and weighted majority voting to guide early stopping decisions and rationale selection. |
| Outcome: | The proposed framework outperforms existing methods while maintaining accuracy. |
Self-Para-Consistency: Improving Reasoning Tasks at Low Cost for Large Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Recent studies have shown that self-consistency decoding can improve performance for complex reasoning tasks with large language models. |
| Approach: | They propose a self-consistency decoding strategy that generates multiple paraphrases for each test question and then generates reasoning paths for the original and all the paraphrased questions based on greedy decoding. |
| Outcome: | The proposed strategy reduces the sampling number and improves performance on complex reasoning tasks. |
Integrate the Essence and Eliminate the Dross: Fine-Grained Self-Consistency for Free-Form Language Generation (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods to improve output quality without aggregating input tokens are limited by the complexity of aggregation of responses. |
| Approach: | They propose to extract and integrate segment-level commonalities from candidate samples to enhance performance of LLMs in open-ended and reasoning tasks. |
| Outcome: | The proposed method improves performance on reasoning, code generation and mathematical reasoning tasks without requiring additional models and overlooking the knowledge present among the candidates. |
Seer Self-Consistency: Advance Budget Estimation for Adaptive Test-Time Scaling (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated exceptional performance in reasoning tasks, particularly in mathematics. |
| Approach: | They propose a dynamic self-consistency framework that integrates System 1 and System 2 reasoning to improve token efficiency and latency. |
| Outcome: | The proposed method outperforms existing methods, achieving up to 47% reduction in token consumption and 43% reduction in inference latency without significant performance loss. |
ConMA : Confidence-Guided Kernel Sampling with Multi-Stage Aggregation for LLM Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to test-time scaling rely on external verifiers and one-shot independent sampling. |
| Approach: | They propose a test-time scaling framework that reallocates a fixed inference budget into iterative sample–filter–diversify–select cycles. |
| Outcome: | ConMA outperforms baselines on multiple benchmarks while converging early with only 18 samples on average, substantially reducing inference cost. |
Boosting Self-Consistency with Ranking (2026.acl-srw)
Copied to clipboard
Maria Marina, Daniil Moskovskiy, Sergey Pletenev, Mikhail Salnikov, Alexander Panchenko, Viktor Moskvoretskii
| Challenge: | Existing approaches to improve performance of large language models include self-consistency, RISC, extended reasoning, and iterative self-correction. |
| Approach: | They propose a test-time scaling technique that uses multiple features to score candidate answers in self-consistency as a ranking problem. |
| Outcome: | The proposed method achieves better accuracy-efficiency trade-off than standard self-consistency and strong baselines on three datasets. |
Improving LLM Generations via Fine-Grained Self-Endorsement (2024.findings-acl)
Copied to clipboard
| Challenge: | Recent large language models (LLMs) have demonstrated remarkable capabilities but can still fail frequently on knowledge-intensive tasks. |
| Approach: | They propose a self-endorsement framework that leverages fine-grained fact-level comparisons across multiple sampled responses. |
| Outcome: | The proposed framework can improve factuality of generations with simple prompts across scales of LLMs. |
Think Twice Before Trusting: Self-Detection for Large Language Models through Comprehensive Answer Reflection (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to self-detection only retrospectively evaluate LLM-generated answers, leading to over-trust in incorrectly generated answers. |
| Approach: | They propose a self-detection paradigm that considers the comprehensive answer space beyond LLM-generated answers to mitigate the over-trust in LLM generated incorrect answers. |
| Outcome: | The proposed framework can be integrated with existing approaches for superior self-detection. |
Reliability-Aware Adaptive Self-Consistency for Efficient Sampling in LLM Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Self-consistency improves reasoning reliability but incurs substantial inference cost . Adaptive self-consistent methods rely on count-based stopping rules that treat all responses equally . |
| Approach: | They propose a method that reframs adaptive sampling from response counting to evidence sufficiency by leveraging response-level confidence. |
| Outcome: | The proposed method reduces inference cost by up to 70% while preserving accuracy on GSM8K. |