vix.ing · top · new · best · stats

Revisiting the Test-Time Scaling of o1-like Models: Do they Truly Possess Test-Time Scaling Capabilities?

2025/02/17 by Zhiyuan Zeng, Zeng, Zhiyuan, Qinyuan Cheng +7 · 1 voice · 52 citations
Computer Science · Decision Sciences · Mathematics · #Computer science #Geology #Geometry #Mathematics #Scaling #Scientific Computing and Data Management #Test (biology) #Time Series Analysis and Forecasting #Topic Modeling #cs.AI #cs.CL #cs.LG

paper · pdf · doi:10.48550/arxiv.2502.12215

published in arXiv (Cornell University) (Cornell University)

openalex publication_date 2025/02/17 · arxiv published 2025/02/17 · arxiv updated 2025/03/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

The advent of test-time scaling in large language models (LLMs), exemplified by OpenAI's o1 series, has advanced reasoning capabilities by scaling computational resource allocation during inference. While successors like QwQ, Deepseek-R1 (R1) and LIMO replicate these advancements, whether these models truly possess test-time scaling capabilities remains underexplored. This study found that longer CoTs of these o1-like models do not consistently enhance accuracy; in fact, correct solutions are often shorter than incorrect ones for the same questions. Further investigation shows this phenomenon is closely related to models' self-revision capabilities - longer CoTs contain more self-revisions, which often lead to performance degradation. We then compare sequential and parallel scaling strategies on QwQ, R1 and LIMO, finding that parallel scaling achieves better coverage and scalability. Based on these insights, we propose Shortest Majority Vote, a method that combines parallel scaling strategies with CoT length characteristics, significantly improving models' test-time scalability compared to conventional majority voting approaches.

Cited by

Discussions

Related