# Learning to Compute Is Not Learning to Retain or Reuse in Looped Transformers

Authors: Peilong Zhou, Hongtao Zhang, Yulong Huang, Cangyuan Li, Mingyu Chen, Ying Wang.

Separates computing an answer, preserving it through additional loops, and keeping its hidden state usable for later steps. On state-machine and maze tasks, shows that training can improve one ability without securing the others.

First public: 2026-10-14.
ArXiv initial submission: 2026-10-14.

[Original paper](https://arxiv.org/abs/2610.19768) · [Reading-list entry](https://latent-implicit-thinking.github.io/papers/2610.19768/)
[Preprint BibTeX](https://latent-implicit-thinking.github.io/papers/2610.19768/citation.bib) · [Preprint CSL-JSON](https://latent-implicit-thinking.github.io/papers/2610.19768/citation.csl.json) · [JSON record](https://latent-implicit-thinking.github.io/papers/2610.19768/record.json)

## Approaches

- [Recurrent reasoning](https://latent-implicit-thinking.github.io/topics/recurrent-reasoning/): Repeat parts of the model or keep intermediate information in memory while working through a problem. Some methods also learn how many passes to run.
- [Analysis and evaluation](https://latent-implicit-thinking.github.io/topics/implicit-reasoning-evaluation/): Measure how well these methods work, investigate what their internal computation does, and identify where they fail. This includes experiments, studies of model internals, and mathematical results.

Summary and categories are editorial. Read the original paper to verify claims and limitations. A citation to a paper does not, by itself, establish that a later method builds on it.

Reading-list version 0.9.5; literature checked through 2026-10-18.
