Challenge: Recent advances in large language models (LLMs) have focused on test-time scaling to improve reasoning quality but at the cost of efficiency.
Approach: They propose a training-free framework that enhances reasoning accuracy and stability with minimal overhead.
Outcome: The proposed framework yields consistent gains across general, coding, and STEM tasks while remaining highly efficient.

Similar Papers

An Empirical Study of LLM Reasoning Ability Under Strict Output Length Constraint (2025.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) are a powerful tool for test-time scaling, but they are often used under time constraints.
Approach: They propose to use LLMs to make models think before answering questions . they also use self-correction and best-of-N decoding to encourage deeper thinking .
Outcome: The proposed models are able to achieve higher inference accuracy with extra inference computation under time constraints.
Bridging the Language Gaps in Large Language Models with Inference-Time Cross-Lingual Intervention (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches to address performance gaps in LLMs rely on pretraining or fine-tuning, which are resource-intensive.
Approach: They propose a framework that aligns LLMs' internal representations with those of high-performing languages during inference.
Outcome: The proposed framework improves performance on low-performing (source) languages by aligning their internal representations with those of high-performing languages during inference.
MUR: Momentum Uncertainty guided Reasoning for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for optimizing reasoning quality are limited by overthinking.
Approach: They propose a method that allocates thinking budgets to critical reasoning steps by tracking and aggregating step-wise uncertainty over time.
Outcome: The proposed method reduces computation by over 45% on average while improving accuracy by 0.33–3.46%.
Z1: Efficient Test-time Scaling with Code (2025.emnlp-industry)

Copied to clipboard

Challenge: Large Language Models (LLMs) can achieve enhanced complex problem-solving through test-time computing scaling, but this often entails longer contexts and numerous reasoning token costs.
Approach: They propose an efficient test-time scaling method that trains LLMs on code-related reasoning trajectories and a novel Shifted Thinking Window to mitigate overthinking overhead.
Outcome: The proposed method reduces overthinking overhead while maintaining performance.
Learning from Cognition: Enhancing RL Efficiency for LLM Reasoning via Hierarchical Metacognitive Decomposition and Refinement (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in Large Language Models have demonstrated notable inferential capacities via reinforcement learning (RL) however, “zero-RL” approaches relying on fixed prompt templates introduce substantial sampling inefficiencies for weak LLMs.
Approach: They propose a hierarchical metacognitive RL framework that decomposes zero-accuracy problems into subproblems and prompts the policy to refine answers by referencing previous wrong solutions.
Outcome: The proposed framework improves sample utilization and sample efficiency and accelerates convergence compared to baselines.
Step-level Verifier-guided Hybrid Test-Time Scaling for Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Recent training-based TTS methods, such as continued reinforcement learning, have surged in popularity, while training-free TTS approaches are gradually fading from prominence.
Approach: They propose a fine-grained sequential scaling method guided by process verification that integrates training-free TTS methods with other classical parallel scaling methods at the step level.
Outcome: Experiments on five instruction-tuned large language models (LLMs) show that training-free TTS methods can extend reasoning performance boundaries.
Mitigating Language Confusion through Inference-time Intervention (2025.coling-main)

Copied to clipboard

Challenge: Existing methods to address the problem of language confusion are incontext learning and supervised fine-tuning (SFT) however, they consume context window space and require extensive data collection.
Approach: They propose a language-sensitive intervention that detects and assesses language confusion without additional complex mechanisms.
Outcome: The proposed method detects language confusion and assesses content quality without additional complex mechanisms.
Guided by Gut: Efficient Test-Time Scaling with Reinforced Intrinsic Confidence (2026.acl-long)

Copied to clipboard

Challenge: Guided by Gut (GG) is an efficient self-guided TTS framework for Large Language Models (LLMs) that performs step-by-step reasoning at a low cost without any reward models or verifiers.
Approach: They propose a self-guided TTS framework that enables LLMs to perform step-by-step reasoning at a low cost without any reward models or verifiers.
Outcome: Empirical evaluations show that GG performs better than TTS with PRMs while reducing GPU memory usage by up to 10.
Prompting Test-Time Scaling Is A Strong LLM Reasoning Data Augmentation (2026.findings-acl)

Copied to clipboard

Challenge: Large language models exhibit strong reasoning when guided by chain-of-thought exemplars . collecting large, high-quality reasoning datasets remains laborious and resource-intensive .
Approach: They propose a prompt-space data augmentation framework for enhancing LLM reasoning . they use a pool of 90 randomly selected reasoning instances to elicit diverse reasoning trajectories .
Outcome: The proposed framework improves accuracy over small-data benchmarks and generalization on out-of-domain reasoning evaluations.
TT-SI: Self-Improving LLM Agents with Test-Time Training (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for language model fine-tuning are expensive and inefficient . existing methods rarely assess whether a training sample provides novel information .
Approach: They propose a test-time self-improvement algorithm that generates a sample that model struggles with . they also explore Test-Time Distillation, which leverages 'stronger supervisors'
Outcome: The proposed algorithm improves performance with +5.48% absolute accuracy gain on average across benchmarks.

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