A plain-language writeup by Vuk Rosić of the paper "Probabilistic Tiny Recursive Model" (Sghaier, Parviz & Jolicoeur-Martineau, Mila — arXiv:2605.19943). Independent summary, not affiliated with or endorsed by the authors.
A 7-million-parameter model just beat an ensemble of 7 frontier LLMs on reasoning puzzles — about 10,000× cheaper, and with zero retraining.
Tiny Recursive Models (TRM) solve a puzzle by repeatedly refining a hidden "working state" and their current best answer with the same small two-layer network. But that refinement is deterministic: one input always traces one path, and that path can settle on a wrong answer with no way out. The paper shows many of TRM's failures are runs trapped in a bad "basin" — a region of the hidden space that decodes to a wrong answer and that the deterministic loop can't escape.