Challenge: Existing methods for improving the correctness of output from large language models generate a constant number of samples per question, but Adaptive-Consistency reduces sample budget by up to 7.9 times with an average accuracy drop of less than 0.1%.
Approach: They propose a model-agnostic technique that dynamically adjusts the number of samples per question using a lightweight stopping criterion.
Outcome: The proposed technique reduces sample budget by 7.9 times with an average accuracy drop of less than 0.1%.

Similar Papers

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.
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.
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.
Format-Adapter: Improving Reasoning Capability of LLMs by Adapting Suitable Format (2026.findings-acl)

Copied to clipboard

Challenge: Prior work showed that multiple reasoning formats outperform a single format when generating multiple answers.
Approach: They propose a method to measure reasoning error when generating multiple answers . they propose 'formatadapter' which generates and selects suitable reasoning formats .
Outcome: The proposed method achieves a 4.3% performance improvement over previous works on math and commonsense reasoning tasks.
Improving Consistency in LLM Inference using Probabilistic Tokenization (2025.findings-naacl)

Copied to clipboard

Challenge: Prior work has shown that probabilistic tokenizations can generate multiple tokenization of the same input string.
Approach: They propose a method to leverage the multiple tokenization capabilities of modern LLM tokenizers.
Outcome: The proposed method improves the self-consistency of large language models by generating multiple tokenizations.
Make Every Penny Count: Difficulty-Adaptive Self-Consistency for Cost-Efficient Reasoning (2025.findings-naacl)

Copied to clipboard

Challenge: Existing decoding strategies for chain-of-thought reasoning do not exploit prior information about question difficulty.
Approach: They propose a decoding strategy called self-consistency to improve reasoning performance by adjusting the number of samples based on the posterior distribution of a set of pre-samples.
Outcome: The proposed method outperforms baseline methods on arithmetic, commonsense and symbolic reasoning tasks while achieving comparable performance.
Too Consistent to Detect: A Study of Self-Consistent Errors in LLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Existing detection methods fail to account for **self-consistent error** . study identifies self-consistency errors and evaluates them .
Approach: They propose a method that fuses hidden state evidence from an external verifier LLM to detect self-consistent errors.
Outcome: The proposed method significantly enhances performance on self-consistent errors across three LLM families.
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.
Are Your LLMs Capable of Stable Reasoning? (2025.findings-acl)

Copied to clipboard

Challenge: Existing evaluation protocols and metrics do not capture the full spectrum of LLM capabilities, especially in complex reasoning tasks.
Approach: They propose a new evaluation metric that continuously assesses model performance across multiple sampling attempts, quantifying both the model’s potential capabilities and operational consistency.
Outcome: The proposed evaluation metric measures model performance across multiple sampling attempts and provides comprehensive insights into their potential capabilities and operational consistency.
Adaptation of Large Language Models (2025.naacl-tutorial)

Copied to clipboard

Challenge: a tutorial on adaptation of large language models addresses the growing demand for models that go beyond static capabilities.
Approach: This tutorial will provide an overview of dynamic, domain-specific, and task-adaptive LLM adaptation techniques.
Outcome: This tutorial will outline dynamic, domain-specific, and task-adaptive LLM adaptation techniques.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations