Papers
arxiv:2605.19376

Generative Recursive Reasoning

Published on May 20
· Submitted by
mingyu jo
on May 21
Authors:
,
,
,
,
,

Abstract

Generative Recursive reAsoning Models (GRAM) introduce probabilistic multi-trajectory computation for neural reasoning systems, enabling multiple hypotheses and parallel inference through stochastic latent trajectories.

AI-generated summary

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_θ(y mid x) and, with fixed or absent inputs, unconditional generation via p_θ(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

Community

Paper submitter

We introduce GRAM, a generative framework for recursive reasoning. Unlike deterministic recursive models such as HRM, TRM, and Looped Transformers, GRAM treats reasoning as a stochastic latent trajectory, allowing the model to explore multiple possible solution paths in parallel. This enables inference-time scaling not only by running deeper recursion, but also by sampling wider sets of reasoning trajectories. The same formulation supports both conditional reasoning, p(y|x), and unconditional generation, p(x). With only 10M parameters, GRAM achieves strong results on Sudoku-Extreme, ARC-AGI, and multi-solution tasks such as N-Queens.

Sign up or log in to comment

Get this paper in your agent:

hf papers read 2605.19376
Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/2605.19376 in a model README.md to link it from this page.

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/2605.19376 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2605.19376 in a Space README.md to link it from this page.

Collections including this paper 1