Generative Recursive Reasoning
About
How should future neural reasoning systems implement extended computation? Recursive Reasoning Models (RRMs) offer a promising alternative to autoregressive sequence extension by performing iterative latent-state refinement with shared transition functions. Yet existing RRMs are largely deterministic, following a single latent trajectory and converging to a single prediction. We introduce Generative Recursive reAsoning Models (GRAM), a framework that turns recursive latent reasoning into probabilistic multi-trajectory computation. GRAM models reasoning as a stochastic latent trajectory, enabling multiple hypotheses, alternative solution strategies, and inference-time scaling through both recursive depth and parallel trajectory sampling. This yields a latent-variable generative model supporting conditional reasoning via $p_\theta(y \mid x)$ and, with fixed or absent inputs, unconditional generation via $p_\theta(x)$. Trained with amortized variational inference, GRAM improves over deterministic recurrent and recursive baselines on structured reasoning and multi-solution constraint satisfaction tasks, while demonstrating an unconditional generation capability. https://ahn-ml.github.io/gram-website
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Sudoku Solving | Sudoku-Extreme (test) | Accuracy97 | 31 | |
| Abstract Reasoning | ARC-AGI v1 (test) | Accuracy52 | 12 | |
| Abstract Reasoning | ARC-AGI v2 (test) | Accuracy11.1 | 11 | |
| Unconditional Image Generation | MNIST binarized | Inception Score2.04 | 9 | |
| Graph Coloring | Graph Coloring 10-vertex | Conflict3.3 | 8 | |
| N-Queens | N-Queens 8 x 8 | Accuracy99.7 | 8 | |
| Graph Coloring | Graph Coloring 8-vertex | Conflict2.7 | 8 | |
| N-Queens | N-Queens 10 x 10 | Accuracy89.7 | 8 | |
| Unconditional Sudoku Generation | Sudoku-Extreme unconditional (100K generated samples) | Validity99.05 | 5 |