Challenge: Multi-path voting methods generate multiple reasoning paths for each problem, causing factual errors and illusion generation.
Approach: They propose a multi-path voting technique that effectively reduces the number of reasoning paths during multi-path voting while preserving accuracies.
Outcome: The proposed method outperforms Self-consistency using 24.7% of the number of paths on the LetterConcat task.

Similar Papers

Ranked Voting based Self-Consistency of Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing majority voting methods generate only a single answer in each trial, ignoring the possibility of other possible answers.
Approach: They propose to generate ranked answers in each reasoning process and conduct ranked voting among multiple ranked responses from different responses.
Outcome: Extensive experiments show that the proposed method outperforms baselines on multiple-choice and open-ended questions.
Meta-Reasoner: Dynamic Guidance for Optimized Inference-time Reasoning in Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Recent advances on prompting and post-training have enabled LLMs to perform step-wise reasoning tasks, but they tend to explore unproductive solution paths without effective backtracking or strategy adjustment.
Approach: They propose a framework that empowers LLMs to “think about how to think” and dynamically adapts reasoning strategies in real-time.
Outcome: The proposed framework outperforms previous SOTA methods by 9-12% in accuracy while reducing inference time by 28-35% under the same compute budget.
Confidence-Driven Multi-Scale Model Selection for Cost-Efficient Inference (2026.findings-eacl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have revolutionized inference across diverse natural language tasks, with larger models performing better but at higher computational costs.
Approach: They propose a confidence-driven strategy that dynamically selects the most suitable model based on confidence estimates.
Outcome: The proposed approach reduces token usage by approximately 60% and improves cost efficiency on the Massive Multitask Language Understanding (MMLU) benchmark.
Dynamic Evaluation with Cognitive Reasoning for Multi-turn Safety of Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing safety evaluation methods rely on static assessments that use fixed harmful prompts or predefined prefixes as jailbreak templates.
Approach: They propose a dynamic evaluation framework for multi-turn safety assessment of LLMs based on cognitive theories to simulate real chatting process and scenario simulation and strategy decision to guide dynamic generation.
Outcome: The proposed framework has been applied to evaluate the safety of widely used LLMs.
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.
Multi-LogiEval: Towards Evaluating Multi-Step Logical Reasoning Ability of Large Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Existing logical reasoning evaluation benchmarks focus on simplistic single-step or multi-step reasoning with limited set of inference rules.
Approach: They propose to use a multi-step logical reasoning evaluation dataset to measure their ability for human-like multi- step logical thinking.
Outcome: The proposed dataset covers three logic types including propositional, first-order, and non-monotonic logic with various inference rules and depths.
An Electoral Approach to Diversify LLM-based Multi-Agent Collective Decision-Making (2024.emnlp-main)

Copied to clipboard

Challenge: Recent advances in large language models have sparked interest in collaborative LLM agents.
Approach: They propose to integrate various ordinal preferential voting mechanisms into LLMs to improve reasoning capabilities and robustness.
Outcome: The proposed method improves reasoning capabilities and robustness of leading LLMs without complex system designs.
FERMAT: An Alternative to Accuracy for Numerical Reasoning (2023.acl-long)

Copied to clipboard

Challenge: Existing numerical reasoning models are too weak for downstream tasks like fact-checking . FERMAT evaluates models on number understanding, mathematical operations, and training dependency .
Approach: They propose a multi-view evaluation set for numerical reasoning in English that evaluates models on key numerical reasoning aspects instead of reporting a single score on a whole dataset.
Outcome: FERMAT evaluates models on number understanding, mathematical operations, and training dependency.
Large Language Models for Mathematical Reasoning: Progresses and Challenges (2024.eacl-srw)

Copied to clipboard

Challenge: a survey examines the landscape of mathematical problem-solving techniques . large language models have proven to be potent assets in unraveling nuances of mathematical reasoning .
Approach: They examine the evolution of Large Language Models (LLMs) for solving mathematical problems . they examine the spectrum of LLM-oriented techniques proposed for solving math problems - and their challenges .
Outcome: The survey examines the spectrum of proposed LLM-oriented techniques in solving math problems.
AdapThink: Adaptive Thinking Preferences for Reasoning Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Recent research has highlighted a significant inefficiency associated with the slow thinking paradigm . models often overthink simple tasks while underthinking complex challenges .
Approach: They propose a framework for adaptive reasoning preference control that dynamically adjusts reflection preferences based on group-level distributional statistics of reasoning length and reflection intensity.
Outcome: The proposed framework reduces average response length by 17.1%-21.4% while improving performance by 6.12-6.59 points under 32K token budgets.

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