← Back to the collection
Full-stack recurrence ·
Ouro
Scaling Latent Reasoning via Looped Language Models
Revisits hidden states with a shared decoder stack over multiple latent computation passes.
Inside the method
[ Decoder stack ] × R
Simplified conceptual schematic. Consult the paper for the complete architecture.
- Recurrence family
- Full-stack recurrence
- Depth control
- Loop count + exit policy
- KV / state strategy
- Per-loop cache
Reading note
The inspected Ouro-2.6B implementation computes all loop states before selecting an exit output. Its exit option alone does not demonstrate skipped computation. Published configuration: 48 layers, 4 passes.
Sources checked 2026-09-15. This catalog does not imply independent reproduction.
Cite this work
@misc{ouro2025,
title = {Scaling Latent Reasoning via Looped Language Models},
author = {Rui-Jie Zhu and Zixuan Wang and Kai Hua and Tianyu Zhang and Ziniu Li and Haoran Que and Boyi Wei and Zixin Wen and Fan Yin and He Xing and Lu Li and Jiajun Shi and Kaijing Ma and Shanda Li and Taylor Kergan and Andrew Smith and Xingwei Qu and Mude Hui and Bohong Wu and Qiyang Min and Hongzhi Huang and Xun Zhou and Wei Ye and Jiaheng Liu and Jian Yang and Yunfeng Shi and Chenghua Lin and Enduo Zhao and Tianle Cai and Ge Zhang and Wenhao Huang and Yoshua Bengio and Jason Eshraghian},
year = {2025},
eprint = {2510.25741},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2510.25741}
}