Tiny Autoregressive Recursive Models
Paulius Rauba, Claudio Fanconi, Mihaela van der Schaar

TL;DR
This paper investigates the adaptation of Tiny Recursive Models to autoregressive settings, finding that the full autoregressive TRM architecture does not reliably outperform simpler baselines on small tasks, cautioning against its further development.
Contribution
It introduces the Autoregressive TRM and systematically evaluates its performance against simplified models in controlled experiments.
Findings
No consistent performance gains from the full Autoregressive TRM architecture.
Two-level refinement baselines perform strongly on character-level tasks.
Results suggest caution in pursuing autoregressive TRM-specific models.
Abstract
Tiny Recursive Models (TRMs) have recently demonstrated remarkable performance on ARC-AGI, showing that very small models can compete against large foundation models through a two-step refinement mechanism that updates an internal reasoning state and the predicted output . Naturally, such refinement is of interest for any predictor; it is therefore natural to wonder whether the TRM mechanism could be effectively re-adopted in autoregressive models. However, TRMs cannot be simply compared to standard models because they lack causal predictive structures and contain persistent latent states that make it difficult to isolate specific performance gains. In this paper, we propose the Autoregressive TRM and evaluate it on small autoregressive tasks. To understand its efficacy, we propose a suite of models that gradually transform a standard Transformer to a Tiny Autoregressive…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Explainable Artificial Intelligence (XAI) · Advanced Graph Neural Networks
