Skip to main content

Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computation

Sangmin Bae, Yujin Kim, Reza Bayat, Sungnyun Kim, Jiyoun Ha, Tal Schuster, Adam Fisch, Hrayr Harutyunyan, Ziwei Ji, Aaron Courville, Se-Young Yun

Learns token-level routing across recursive depths so different positions can receive different amounts of internal computation.

First public:

Read the paper ↗Code ↗

Cite this paper

ArXiv preprint

arXiv:2507.10524 · Initial submission: 2025-07-14

BibTeX · CSL-JSON

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.