PAR: Progress-Aligned Recurrence for Length Generalization in State Tracking

Pan Wang, Yihao Hu, Guangyuan Dong, Yitong Lin, Hang Wang, Zimi Liu, Zhihao Wen, Jianshe Li and 3 others

Ant International · National University of Singapore

Published October 20, 2026 · on the feed October 21, 2026 · ▲ 162 · arXiv 2610.27628

Model architectureLLM training & RL No code arXiv ↗Hugging Face ↗

The abstract

Looped language models can run more iterations at test time, but additional iterations need not help them solve longer problems. For sequential state tracking, final-answer supervision does not specify how far each iteration should advance, and repeated updates can change the scale of the recurrent state. We introduce Progress-Aligned Recurrence (PAR), which trains the prediction at iteration k to match the state after the first k operations and rescales recurrent states to their first-iteration norms. On swap-S_5, a Qwen2.5-0.5B model trained on at most 32 moves achieves 95.5\% mean full-state accuracy at 512 moves, or 16times the training length, compared with 55.7\% reported for RLT and 0.8\% for explicit chain of thought on the same backbone. Controlled S_5 ablations show that removing norm anchoring reduces the extrapolation factor from 16times to below 2.2times, and replacing progress-aligned targets with final-answer supervision reduces it to at most 8times. A learned completion readout selects when to answer without a supplied stopping depth. When intermediate labels are unavailable, prefix self-distillation induces the correspondence from shorter problem prefixes using only final answers. The gains apply across sequential state-tracking tasks, establishing the task structure required for depth extrapolation. These findings support training intermediate predictions and state scale together to make additional recurrent depth useful for longer problems.

The Brief

2:24

A short podcast summary of the paper. Written and voiced by AI.

Transcript

PAR. Progress-Aligned Recurrence for Length Generalization in State Tracking. By Pan Wang and ten others, from Ant International and the National University of Singapore. Published on the twentieth of October. No code repository is linked to it.

A looped language model can run more iterations at test time than it did in training, which looks like a way to handle longer problems. The extra iterations, though, need not help. For sequential state tracking the authors point to two reasons. Supervision on the final answer alone says nothing about how far any individual iteration ought to advance the computation. And repeated updates can change the scale of the recurrent state, so the loop drifts away from the regime it was trained in.

Progress-Aligned Recurrence answers each reason with one change. The prediction at iteration k is trained to match the state after the first k operations, which gives every iteration a target of its own and fixes how much progress it should make. And recurrent states are rescaled to their first-iteration norms, which holds the scale still as the loop runs.

Two further pieces make the method practical. A learned completion readout decides when to answer, so no stopping depth has to be supplied from outside. And when intermediate labels are not available, prefix self-distillation induces the iteration-to-progress correspondence from shorter problem prefixes, using only final answers.

The headline test is swap on the symmetric group of degree five. A Qwen2.5 model at the zero point five billion parameter size is trained on at most thirty-two moves and reaches ninety-five point five percent mean full-state accuracy at five hundred and twelve moves. That is sixteen times the training length. Reported on the same backbone, RLT reaches fifty-five point seven percent and explicit chain of thought zero point eight percent.

Controlled ablations separate the two ingredients. Removing norm anchoring drops the extrapolation factor from sixteen times to below two point two times. Replacing the progress-aligned targets with final-answer supervision drops it to at most eight times. Both components are doing real work, and the anchoring is doing more of it.

The gains hold across sequential state-tracking tasks, which lets the authors say what task structure depth extrapolation requires. Their reading of the evidence is that intermediate predictions and state scale have to be trained together. Tell each loop how far to get, keep its magnitude steady, and the extra depth finally buys longer problems.

Paper Quest · 7 chapters · about 41 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

More loops should mean harder problems solved. Find out why they don't.

You have a language model that loops one shared block of layers, so at test time you can run more iterations than in training. Surely longer problems just need more loops?

The road ahead

  1. 1 · The problem ~7 min A looped model can run extra loops on longer problems, but nothing in its training makes those extra loops do useful work.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~9 min Train loop k to hold the state after k operations, rescale every state to its first-loop size, and let a readout decide when to answer.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Split a pretrained Qwen2.5 model into a looped core, train each loop on its progress state with norm anchoring, add a halting readout, then loop longer.
  6. 6 · The experiment ~6 min You’ll guess: A Qwen2.5-0.5B looped model is trained on swap-S_5 with at most 32 moves. What mean full-state accuracy does it reach at 512 moves?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.