mlsanityData to 7 Oct 2026

Iterative Deepening Sampling as Efficient Test-Time Scaling

arXiv 2502.05449 ↗First posted 8 Feb 2025cs.CL cs.AI cs.LGcited by 8

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

Recent reasoning models, such as OpenAI's O1 series, have demonstrated exceptional performance on complex reasoning tasks and revealed new test-time scaling laws. Inspired by this, many people have been studying how to train models to achieve effective self-evaluation and self-correction to further enable the scaling paradigm. However, less studied is how to efficiently scale test-time compute from a fixed model, and this remains a challenge. In this paper, we address this challenge by focusing on enhancing the quality of self-reflection data generation for complex problem-solving at test time, which can also subsequently improve the training of next-generation large language models (LLMs). Specifically, we explore how systematically triggering a model's self-correction mechanisms can improve performance on challenging reasoning tasks. To this end, we propose a novel iterative deepening sampling algorithm framework designed to enhance self-correction and generate higher-quality samples. Through extensive experiments on Math500 and AIME benchmarks, we demonstrate that our method achieves a higher success rate on difficult tasks and provide detailed ablation studies to analyze its effectiveness across diverse settings.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 33 of its 39 references that are in the map. First posted on arXiv 8 Feb 2025.

Builds on

33 of 39 references.

Closest ancestors · 6

Same direction, newest first

  1. 2024Scaling of Search and Learning: A Roadmap to Reproduce o1 from Reinforcement Learning Perspective18 Dec
  2. 2024O1 Replication Journey -- Part 2: Surpassing O1-preview through Simple Distillation, Big Progress or Bitter Lesson?25 Nov
  3. 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters6 Aug
  4. 2023Large Language Models Cannot Self-Correct Reasoning Yet3 Oct
  5. 2023CRITIC: Large Language Models Can Self-Correct with Tool-Interactive Critiquing19 May
  6. 2023Self-Refine: Iterative Refinement with Self-Feedback30 Mar

Other references · 27

  1. 2024The Llama 3 Herd of Modelscited by 14,192
  2. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  3. 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,355
  4. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  5. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  6. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
  7. 2023Reflexion: Language Agents with Verbal Reinforcement Learningcited by 4,064
  8. 2023Let's Verify Step by Stepcited by 3,598
  9. 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,758
  10. 2023Teaching Large Language Models to Self-Debugcited by 963
  11. 2023Reasoning with Language Model is Planning with World Modelcited by 846
  12. 2024Phi-4 Technical Reportcited by 675
15 more
  1. 2023Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Modelscited by 551
  2. 2025The Lessons of Developing Process Reward Models in Mathematical Reasoningcited by 402
  3. 2025rStar-Math: Small LLMs Can Master Math Reasoning with Self-Evolved Deep Thinkingcited by 308
  4. 2024Chain-of-Thought Reasoning Without Promptingcited by 208
  5. 2023Planning with Large Language Models for Code Generationcited by 179
  6. 2024AlphaMath Almost Zero: Process Supervision without Processcited by 160
  7. 2024Accessing GPT-4 level Mathematical Olympiad Solutions via Monte Carlo Tree Self-refine with LLaMa-3 8Bcited by 156
  8. 2024Fast Best-of-N Decoding via Speculative Rejectioncited by 112
  9. 2024LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoningcited by 90
  10. 2024Step-level Value Preference Optimization for Mathematical Reasoningcited by 71
  11. 2024When is Tree Search Useful for LLM Planning? It Depends on the Discriminatorcited by 46
  12. 2024Why Solving Multi-agent Path Finding with Large Language Model has not Succeeded Yetcited by 22
  13. 2024On the Brittle Foundations of ReAct Prompting for Agentic Large Language Modelscited by 17
  14. 2024RePrompt: Planning by Automatic Prompt Engineering for Large Language Models Agentscited by 15
  15. 2024Flaming-hot Initiation with Regular Execution Sampling for Large Language Modelscited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 5; 2026: 3.

8 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025SETS: Leveraging Self-Verification and Self-Correction for Improved Test-Time Scaling
  2. 2025Rethinking Inference-Time Scaling: Efficiency Limits and Linguistic Signals
  3. 2025s1: Simple test-time scaling
  4. 2025Sample Complexity and Representation Ability of Test-time Scaling Paradigms
  5. 2026Refining Over Resampling: Test-Time Self-Correction for LLM Reasoning
  6. 2026Test-Time Scaling in Reasoning LLMs: Inference Regimes, Evaluation, and Reproducibility
  7. 2025Think Twice: Enhancing LLM Reasoning by Scaling Multi-round Test-time Thinking
  8. 2025A Theoretical Study on Bridging Internal Probability and Self-Consistency for LLM Reasoning