| 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. |
Similar Papers
Faster and Better LLMs via Latency-Aware Test-Time Scaling (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing research has overlooked the efficiency of TTS from a latency-sensitive perspective. |
| Approach: | They propose two approaches to achieve latency-optimal TTS by branch-wise parallelism and sequence-wise parallelism. |
| Outcome: | The proposed approach achieves latency-optimal TTS for large models . branch-wise parallelism and sequence-wise parallelism are key approaches . |
Test-Time Scaling in Multimodal Foundation Models: A Comprehensive Survey of Generation and Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent advances have adapted this paradigm to Multimodal Foundation Models (MFMs), unlocking their potential in multimodal reasoning and generation. |
| Approach: | They propose a taxonomy framework that categorizes existing methodologies into three distinct strategies: sampling-based, feedback-based and search-based approaches. |
| Outcome: | The proposed framework categorizes existing methodologies into three distinct strategies: sampling-based, feedback-based and search-based approaches. |
Step-level Verifier-guided Hybrid Test-Time Scaling for Large Language Models (2025.emnlp-main)
Copied to clipboard
Kaiyan Chang, Yonghao Shi, Chenglong Wang, Hang Zhou, Chi Hu, Xiaoqian Liu, Yingfeng Luo, Yuan Ge, Tong Xiao, JingBo Zhu
| 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. |
Chronos: Learning Temporal Dynamics of Reasoning Chains for Test-Time Scaling (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for testing time scales treat reasoning traces or tokens equally, ignoring substantial variations in trajectory quality and localized logical failures. |
| Approach: | They propose a chronological reasoning scorer that models each trajectory as a time series. |
| Outcome: | The proposed method achieves relative improvements of 34.21% over Pass@128 and 22.70% over Maj@135 on HMMT25, highlighting its effectiveness. |
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. |
Stepwise Reasoning Checkpoint Analysis: A Test Time Scaling Method to Enhance LLMs’ Reasoning (2025.emnlp-main)
Copied to clipboard
Zezhong Wang, Xingshan Zeng, Weiwen Liu, Yufei Wang, Liangyou Li, Yasheng Wang, Lifeng Shang, Xin Jiang, Qun Liu, Kam-Fai Wong
| Challenge: | Existing methods that use Chain-of-Thought suffer from path homogenization and inefficient use of intermediate results. |
| Approach: | They propose a framework that introduces checkpoints between reasoning steps to reduce path homogenization and create fault-tolerant mechanisms. |
| Outcome: | The proposed framework reduces path homogenization and creates fault-tolerant mechanism by utilizing high-quality intermediate results. |
Scaling Unverifiable Rewards: A Case Study on Visual Insights (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to scale complex, open-ended tasks with unverifiable rewards are not scalable to multi-stage pipelines. |
| Approach: | They propose a process-based refinement framework that scales inference across stages of a multi-agent pipeline, instead of refining a single output over time. |
| Outcome: | The proposed framework scales inference across stages of a multi-agent pipeline, instead of refining a single output over time as in prior work. |
S*: Test Time Scaling for Code Generation (2025.findings-emnlp)
Copied to clipboard
Dacheng Li, Shiyi Cao, Chengkun Cao, Xiuyu Li, Shangyin Tan, Kurt Keutzer, Jiarong Xing, Joseph E. Gonzalez, Ion Stoica
| Challenge: | S* is the first hybrid test-time scaling framework that significantly improves the coverage and selection accuracy of generated code. |
| Approach: | They propose a hybrid test-time scaling framework that augments parallel scaling with sequential scaling to further increase the performance. |
| Outcome: | The proposed framework outperforms existing scaling approaches in large-scale modeling and reasoning models. |
Test-Time Scaling of Reasoning Models for Machine Translation (2026.eacl-long)
Copied to clipboard
| Challenge: | Using TTS, Reasoning Models (RMs) are able to perform tasks such as math and coding with limited results. |
| Approach: | They evaluate 12 Reasoning Models across a diverse suite of MT benchmarks, examining three scenarios: direct translation, forced-reasoning extrapolation, and post-editing. |
| Outcome: | The proposed approach improves translation quality on three domains, with inconsistent results for general-purpose RMs and performance plateauing. |
Efficient Latent Semantic Clustering for Scaling Test-Time Computation of LLMs (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for scaling test-time computation rely on external models that introduce substantial computational overhead and fail to capture context-aware semantics. |
| Approach: | They propose a method that leverages the generator LLM’s internal hidden states for clustering, eliminating the need for external models. |
| Outcome: | The proposed method improves the computational efficiency of test-time scaling while maintaining or exceeding the performance of existing methods. |