Decoding Looped Transformers Better for (Almost) Free
Compares a looped model's final prediction with predictions from earlier loops to improve decoding without additional training. Tests contrastive variants using either output logits or hidden states on mathematical reasoning and code generation.
First public: · Added to this list: October 18, 2026
Cite this paper
ArXiv preprint
arXiv:2610.02185 · Initial submission: 2026-10-01
A published-version citation has not been verified for this entry. This does not mean the paper is unpublished.
Choose the version you used. The arXiv link may serve a revision; check the original paper for the exact result, assumptions and limitations you cite.
Explore this approach
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.
Read or reuse this entry
Plain-text Markdown · JSON record · Find in the full list
Our summary and categories are a reading aid, not the authors’ abstract. Use the original paper for research claims. Suggest a correction.