paper-with-me

홈 › Papers

Think Deep, Think Fast: Investigating Efficiency of Verifier-free Inference-time-scaling Methods

2025-04-18 · Junlin Wang, Shang Zhu, Jon Saad-Falcon, Ben Athiwaratkun, Qingyang Wu, Jue Wang, Shuaiwen Leon Song, Ce Zhang, Bhuwan Dhingra, James Zou

There is intense interest in investigating how inference time compute (ITC) (e.g. repeated sampling, refinements, etc) can improve large language model (LLM) capabilities. At the same time, recent breakthroughs in reasoning models, such as Deepseek-R1, unlock the opportunity for reinforcement learning to improve LLM reasoning skills. An in-depth understanding of how ITC interacts with reasoning across different models could provide important guidance on how to further advance the LLM frontier. This work conducts a comprehensive analysis of inference-time scaling methods for both reasoning and non-reasoning models on challenging reasoning tasks. Specifically, we focus our research on verifier-free inference time-scaling methods due to its generalizability without needing a reward model. We construct the Pareto frontier of quality and efficiency. We find that non-reasoning models, even with an extremely high inference budget, still fall substantially behind reasoning models. For reasoning models, majority voting proves to be a robust inference strategy, generally competitive or outperforming other more sophisticated ITC methods like best-of-N and sequential revisions, while the additional inference compute offers minimal improvements. We further perform in-depth analyses of the association of key response features (length and linguistic markers) with response quality, with which we can improve the existing ITC methods. We find that correct responses from reasoning models are typically shorter and have fewer hedging and thinking markers (but more discourse markers) than the incorrect responses.

📄 PDF Abstract BibTeX arXiv:2504.14047

Code (0)

등록된 구현이 없습니다.

Tasks

Large Language Model

Methods 이 논문이 사용한 방법론

Focus 설명 없음

Similar Papers 제목 키워드 기반

TrimR: Verifier-based Training-Free Thinking Compression for Efficient Test-Time Scaling

2025-05-22 · Weizhe Lin, Xing Li, Zhiyuan Yang, Xiaojin Fu 외

Large Reasoning Models (LRMs) demonstrate exceptional capability in tackling complex mathematical, logical, and coding tasks by leveraging extended Chain-of-Thought (CoT) reasoning. Test-time scaling methods, such as pro…

Dyve: Thinking Fast and Slow for Dynamic Process Verification

2025-02-16 · Jianyuan Zhong, Zeju Li, Zhijian Xu, Xiangyu Wen 외

We present Dyve, a dynamic process verifier that enhances reasoning error detection in large language models by integrating fast and slow thinking, inspired by Kahneman's Systems Theory. Dyve adaptively applies immediate…

Math

Fast-Slow Thinking for Large Vision-Language Model Reasoning

2025-04-25 · Wenyi Xiao, Leilei Gan, Weilong Dai, Wanggui He 외

Recent advances in large vision-language models (LVLMs) have revealed an \textit{overthinking} phenomenon, where models generate verbose reasoning across all tasks regardless of questions. To address this issue, we prese…

Language ModelingLanguage Modelling

When2Think: Learning Difficulty-Aware Length Control for Efficient Hybrid Reasoning Models

2026-09-17 · Jaejun Shim, HyunJin Kim, Young Jin Kim, JinYeong Bak hf

Large Reasoning Models (LRMs) achieve strong performance on complex tasks but exhibit systematic inefficiency: they often overthink easy problems and underthink hard ones. Existing approaches based on uniform length pena…

Process Reward Models That Think

2025-04-23 · Muhammad Khalifa, Rishabh Agarwal, Lajanugen Logeswaran, Jaekyeom Kim 외

Step-by-step verifiers -- also known as process reward models (PRMs) -- are a key ingredient for test-time scaling. PRMs require step-level supervision, making them expensive to train. This work aims to build data-effici…

Math