ThinkBooster: A Unified Framework for Seamless Test-Time Scaling of LLM Reasoning (2026.acl-demo)
Copied to clipboard
Vladislav Smirnov, Quang-Chieu Nguyen, Sergey Senichev, Minh Ngoc Ta, Ekaterina Fadeeva, Artem Vazhentsev, Daria Galimzianova, Nikolai Rozanov, Viktor Mazanov, Jingwei Ni, Tianyi Wu, Igor Kiselev, Mrinmaya Sachan, Iryna Gurevych, Preslav Nakov, Timothy Baldwin, Artem Shelmanov
| Challenge: | Existing TTC scaling strategies and reasoning scorers are fragmented and evaluated under inconsistent protocols. |
| Approach: | They propose a framework for seamless test-time compute scaling of large language model reasoning . they use a modular Python library to implement state-of-the-art scaling strategy and scorer families . |
| Outcome: | The proposed framework evaluates performance and computational efficiency on mathematical and coding tasks. |
Similar Papers
Slim-SC: Thought Pruning for Efficient Scaling with Self-Consistency (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies show that Test-Time Scaling (TTS) can improve reasoning performance without retraining the model. |
| Approach: | They propose a step-wise pruning strategy that identifies and removes redundant chains using inter-chain similarity at the thought level. |
| Outcome: | The proposed method reduces inference latency and KVC usage by up to 45% and 26% with R1-Distill while maintaining or improving accuracy. |
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. |
Ranking Reasoning LLMs under Test-Time Scaling (2026.acl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) are increasingly used as general-purpose reasoning systems for tasks such as programming and mathematical problem solving. |
| Approach: | They formalize dense benchmark ranking under test-time scaling and introduce a library that implements statistical ranking methods such as paired-comparison models, item response theory, voting rules, graph- and spectral-based methods. |
| Outcome: | The proposed method is based on paired-comparison models, item response theory (IRT) models, voting rules, graph- and spectral-based methods. |
MetaScale: Test-Time Scaling with Evolving Meta-Thoughts (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches impose fixed cognitive structures that enhance performance in specific tasks but lack adaptability across diverse scenarios. |
| Approach: | They propose a test-time scaling framework based on meta-thoughts to improve performance . meta-thinkts are adaptive thinking strategies tailored to a given task . |
| Outcome: | Experimental results show that MetaScale outperforms standard inference approaches . it can scale more effectively with increasing sampling budgets and produces more structured responses . |
Scaling Evaluation-Time Compute with Reasoning Models as Evaluators (2026.findings-acl)
Copied to clipboard
Seungone Kim, Ian Wu, Jinu Lee, Xiang Yue, Seongyun Lee, Minkyeong Moon, Carolin Lawrence, Kiril Gashteovski, Julia Hockenmaier, Graham Neubig, Sean Welleck
| Challenge: | Language model (LM) evaluators that generate chain-of-thought reasoning are widely used for the assessment of LM responses. |
| Approach: | They investigate whether increasing LMs' "thinking" time through scaling test-time compute can improve an LM's evaluation capability. |
| Outcome: | The proposed reasoning models improve evaluation performance monotonically with the number of reasoning tokens generated, mirroring trends seen in LM reasoning. |
Think Right, Not More: Test-Time Scaling for Numerical Claim Verification (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Fact-checking real-world claims requires multistep reasoning and numerical reasoning . large language models are unable to understand nuance of numerical aspects . |
| Approach: | They propose scaling test-time compute (TTS) for large language models to solve this problem . they train a verifier model to navigate the space of possible reasoning paths . |
| Outcome: | The proposed approach achieves 1.8x higher efficiency than standard TTS while delivering 18.8% performance improvement over single-shot verification methods. |
EconProver: Towards More Economical Test-Time Scaling for Automated Theorem Proving (2026.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have recently advanced the field of Automated Theorem Proving (ATP) Existing cost analyses regulate only the number of sampling passes, ignoring the substantial disparities in sampling costs. |
| Approach: | They propose to integrate two complementary methods into a unified EconRL pipeline to increase pass rates under constrained sampling passes. |
| Outcome: | The proposed method reduces token usage and sample passes while maintaining the original performance. |
Parallel Test-Time Scaling for Latent Reasoning Models (2026.acl-long)
Copied to clipboard
| Challenge: | Parallel test-time scaling is a pivotal approach for enhancing large language models. |
| Approach: | They propose two uncertainty-inspired stochastic strategies for parallel test-time scaling for latent reasoning models and a Latent Reward Model for aggregation. |
| Outcome: | The proposed model scales well with compute and enables effective trajectory selection. |
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. |
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. |