AIAny
Icon for item

Improving Test-Time Scaling with Adaptive Looped Transformers

Improves test-time scaling of looped transformers by adaptively assigning extra recurrent iterations to tokens that benefit most. TaH2 is a post-training method that jointly trains an iteration decider with the backbone using lookahead depth supervision, boosting the accuracy–compute slope and peak accuracy on challenging benchmarks.

Introduction

Most looped-transformer work evaluates fixed-depth recurrence, which wastes iterations on many tokens and obscures whether extra latent steps truly improve long-output inference. The core insight here is simple: letting the model focus extra iterations only on tokens where further recursion improves predictions yields both higher peak accuracy and a steeper accuracy-per-doubling-of-FLOPs slope.

Key Findings
  • TaH2: a lightweight post-training pipeline that jointly fine-tunes the backbone and an iteration decider using online "lookahead depth" supervision; this lets the model learn which tokens benefit from more loops.
  • Measured impact: on AIME benchmarks TaH2 raises the accuracy–compute slope by 53% (2.74 vs. 1.79) over the non-looped baseline and surpasses the baseline's peak accuracy by ~3.4 points at matched test-time compute.
  • Scalability with depth: while existing fixed-depth looped models largely plateau, TaH2's advantage grows as maximum iteration depth increases (gain vs. baseline: +2.8 points at depth 2 → +3.9 points at depth 8).
  • Practical trade: TaH2 improves attainable accuracy for test-time scalable inference without changing model size; it requires a small post-training stage and an inexpensive iteration-decider at inference.
Who it's for and trade-offs

Great fit if you need improved accuracy when scaling inference compute (longer outputs or optional extra FLOPs) but cannot increase model parameters. TaH2 is suited for teams that can afford a short post-training phase and want a predictable, token-adaptive compute/accuracy trade-off. Look elsewhere if you require a zero-change deployment (no extra decision logic) or absolute minimal inference-time latency overhead from any control logic—TaH2 adds a small runtime decision step and a bit of implementation complexity compared to fixed-depth looping.

Information

  • Websitearxiv.org
  • OrganizationsTsinghua University, Yale University
  • AuthorsYichen You, Tianyu Fu, Aosong Feng, Xingtai Lv, Xuefei Ning, Ning Ding, Yu Wang
  • Published date2026/09/28

More Items

Lets AI agents read task-relevant evidence from external content instead of receiving entire documents by default. Intent tracking, adaptive readers, and an exposure budget reduce token use and latency while retaining a faithful full-view fallback.

Trains language models to retrieve, study, and apply knowledge from textbooks through reinforcement learning. The approach raises overall mathematical proof accuracy from 51.5% to 79.5% and also improves results on two long-context benchmarks.

Turns university mathematics textbooks into structured proof-training data while preserving chapter order, proposition–proof links, and dependencies. The authors report a 16.7-point average gain over the base model across six evaluations.