mlsanityData to 14 Oct 2026

Improving Test-Time Scaling with Adaptive Looped Transformers

arXiv 2609.35748 ↗First posted 28 Sep 2026cs.CL cs.LGcited by 1

New in LLM reasoning; no direction yet. LLM reasoning

Abstract (arXiv)

Looped transformers have demonstrated promising parameter efficiency by reusing layers for latent computation. Prior studies compare looped and non-looped models at matched parameters or per-token FLOPs. However, to the best of our knowledge, whether looping improves test-time scaling as outputs grow longer remains underexplored. Through post-training looped transformers, we study the accuracy-compute slope, measured as the accuracy gain per doubling of test-time decoding FLOPs. We find that existing looped transformers often yield steeper slopes than their non-looped baseline, yet underperform it at matched compute. While fixed-depth looping spends extra iterations on every token, our analysis shows that many tokens do not benefit from extra iterations. We therefore propose TaH2, which enables the model to focus extra iterations on the tokens that benefit from looping. It jointly post-trains the backbone and an iteration decider through lookahead depth supervision, which uses online labels indicating whether further iteration improves the prediction. TaH2 improves both the efficiency and attainable accuracy of test-time scaling. On challenging AIME benchmarks, TaH2 improves the accuracy-compute slope by 53% (2.74 vs. 1.79) over the non-looped baseline, exceeding the baseline's peak accuracy by about 3.4 points at matched test-time compute. As the maximum iteration depth increases, existing looped models largely plateau, while TaH2's gain over the non-looped baseline continues to grow from +2.8 points at depth 2 to +3.9 points at depth 8. Our code is available at https://github.com/thu-nics/TaH.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 107 of its 117 references that are in the map. First posted on arXiv 28 Sep 2026.

Builds on

107 of 117 references.

References · 107

  1. 2025Qwen3 Technical Reportcited by 8,820
  2. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  3. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
  4. 2023Let's Verify Step by Stepcited by 3,789
  5. 2021Program Synthesis with Large Language Modelscited by 3,637
  6. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
  7. 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 2,004
  8. 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,986
  9. 2025s1: Simple test-time scalingcited by 1,341
  10. 2024OpenAI o1 System Cardcited by 1,244
  11. 2024OlympiadBench: A Challenging Benchmark for Promoting AGI with Olympiad-Level Bilingual Multimodal Scientific Problemscited by 1,136
  12. 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 991
38 more
  1. 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 797
  2. 2016Adaptive Computation Time for Recurrent Neural Networkscited by 506
  3. 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 415
  4. 2025L1: Controlling How Long A Reasoning Model Thinks With Reinforcement Learningcited by 384
  5. 2025rStar-Math: Small LLMs Can Master Math Reasoning with Self-Evolved Deep Thinkingcited by 313
  6. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
  7. 2024Inference Scaling Laws: An Empirical Analysis of Compute-Optimal Inference for Problem-Solving with Language Modelscited by 290
  8. 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 258
  9. 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 240
  10. 2022Sparse Upcycling: Training Mixture-of-Experts from Dense Checkpointscited by 209
  11. 2025When More is Less: Understanding Chain-of-Thought Length in LLMscited by 183
  12. 2023SOLAR 10.7B: Scaling Large Language Models with Simple yet Effective Depth Up-Scalingcited by 172
  13. 2021PonderNet: Learning to Pondercited by 168
  14. 2025Scaling Latent Reasoning via Looped Language Modelscited by 165
  15. 2023Looped Transformers are Better at Learning Learning Algorithmscited by 149
  16. 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 133
  17. 2024LLaMA Pro: Progressive LLaMA with Block Expansioncited by 101
  18. 2025Reasoning with Sampling: Your Base Model is Smarter Than You Thinkcited by 89
  19. 2025SuperGPQA: Scaling LLM Evaluation across 285 Graduate Disciplinescited by 79
  20. 2024Relaxed Recursive Transformers: Effective Parameter Sharing with Layer-wise LoRAcited by 78
  21. 2025Efficient Reasoning with Hidden Thinkingcited by 75
  22. 2026LoopFormer: Elastic-Depth Looped Transformers for Latent Reasoning via Shortcut Modulationcited by 61
  23. 2026Parcae: Scaling Laws For Stable Looped Language Modelscited by 55
  24. 2025Teaching Pretrained Language Models to Think Deeper with Retrofitted Recurrencecited by 47
  25. 2025PonderLM: Pretraining Language Models to Ponder in Continuous Spacecited by 44
  26. 2025Implicit Reasoning in Large Language Models: A Comprehensive Surveycited by 43
  27. 2026A Mechanistic Analysis of Looped Reasoning Language Modelscited by 33
  28. 2025Parallel Scaling Law for Language Modelscited by 30
  29. 2025R2R: Efficiently Navigating Divergent Reasoning Paths with Small-Large Model Token Routingcited by 29
  30. 2026Fixed-Point Reasoners: Stable and Adaptive Deep Looped Transformerscited by 28
  31. 2023CoTFormer: A Chain-of-Thought Driven Architecture with Budget-Adaptive Computation Cost at Inferencecited by 27
  32. 2024Are More LLM Calls All You Need? Towards Scaling Laws of Compound Inference Systemscited by 25
  33. 2025Parallel Loop Transformer for Efficient Test-Time Computation Scalingcited by 24
  34. 2026How Much Is One Recurrence Worth? Iso-Depth Scaling Laws for Looped Language Modelscited by 24
  35. 2026Think Deep, Not Just Long: Measuring LLM Reasoning Effort via Deep-Thinking Tokenscited by 22
  36. 2026Stabilizing Recurrent Dynamics for Test-Time Scalable Latent Reasoning in Looped Language Modelscited by 21
  37. 2026Generative Recursive Reasoningcited by 20
  38. 2026SMELT: Scaling Laws for Compute-Matched MoE Looped Transformerscited by 18

50 most cited of 107 All 107 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Looped Transformers as Optimizers
  2. 2026FlashLoop: Fast and Memory-Efficient Looped Transformers via Lazy Updates
  3. 2026Right Direction, Wrong Step: Geometric Analysis of Finite-Step Failure in Looped Transformers
  4. 2026Quantizing Looped Transformers: Feedback Exposure and Calibration Blindness
  5. 2026Looping Beyond Twice: A Scalable Recipe for Looped Mixture-of-Experts
  6. 2026LoopSpec: Pipelined Self-Speculative Decoding for Looped Transformers
  7. 2026Step-resolved data attribution for looped transformers
  8. 2026Scaling Laws for Looped Mixture of Experts