Table of Contents
Fetching ...

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

Zhiyuan Zeng, Qinyuan Cheng, Zhangyue Yin, Yunhua Zhou, Xipeng Qiu

TL;DR

The study questions the existence of true test-time scaling in o1-like models by analyzing the impact of chain-of-thought length on accuracy in QwQ, R1, and LIMO. It uncovers that longer CoTs do not reliably improve performance and are often associated with increased self-revision that degrades results, especially for weaker variants. Parallel scaling demonstrates superior coverage and scalability over sequential revisions, leading to the development of Shortest Majority Vote, which uses solution-length-aware voting to boost test-time scalability. The findings offer practical guidance for inference-time strategies on open-source reasoning models and highlight the importance of self-revision dynamics in designing scalable evaluation protocols.

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.

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

TL;DR

The study questions the existence of true test-time scaling in o1-like models by analyzing the impact of chain-of-thought length on accuracy in QwQ, R1, and LIMO. It uncovers that longer CoTs do not reliably improve performance and are often associated with increased self-revision that degrades results, especially for weaker variants. Parallel scaling demonstrates superior coverage and scalability over sequential revisions, leading to the development of Shortest Majority Vote, which uses solution-length-aware voting to boost test-time scalability. The findings offer practical guidance for inference-time strategies on open-source reasoning models and highlight the importance of self-revision dynamics in designing scalable evaluation protocols.

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.
Paper Structure (23 sections, 1 equation, 10 figures, 2 tables)

This paper contains 23 sections, 1 equation, 10 figures, 2 tables.

Figures (10)

  • Figure 1: The average length of correct solutions versus incorrect solutions evaluated on the same questions. For each question, solution lengths were averaged separately for correct and incorrect responses, then averaged across all questions.
  • Figure 2: Solutions of QwQ and R1 were categorized into different groups according to their length and evaluated in terms of solution length (a) and accuracy (b). The categorization of solutions is progressed for each question independently, i.e., all groups of solutions are corresponding to the same questions.
  • Figure 3: (a): The relationship between model accuracy and the generation parameter Max Token Limitation. (b): The relationship between solution length and the average number of "wait" occur in a solution.
  • Figure 4: (a): Accuracy of R1-Distill-32b, R1-Distill-14b and LIMO during sequential revisions. (b): Accuracy of R1-Distill-1.5b and QwQ during sequential revisions. (c) Solution length increased with the more revision steps.
  • Figure 5: The ratio of turning an initial correct answer to incorrect one (correct to wrong) and an initial incorrect answer to a correct one (wrong to correct) during sequential scaling.
  • ...and 5 more figures