GRAM accepted to NeurIPS 2026: recursive reasoning becomes stochastic latent trajectories
SungjinAhn_ · x · 2026-09-25
GRAM (Generative Recursive reAsoning Models) from KAIST, Mila, NYU and Yoshua Bengio is accepted to NeurIPS 2026.
- Existing recursive reasoners (HRM, TRM, Looped Transformers) are deterministic: the same input always converges to one answer, collapsing all plausible reasoning paths into a single attractor.
- GRAM models recursion as a stochastic latent trajectory, keeping multiple hypotheses and alternative strategies, with inference-time scaling in both depth and width (parallel trajectory sampling).
- The same formulation supports conditional reasoning p(y|x) and unconditional generation p(x). Trained with amortized variational inference, it beats deterministic baselines on structured reasoning and multi-solution constraint satisfaction; revised paper and code coming soon.
More from Research
- TorchCurves: Differentiable Learnable Parametric Curves for PyTorch — Alex Shtoff · 2026-11-11
- AI-assisted proof shows no voting rule beats Borda on strategyproofness — conitzer · 2026-11-11
- Markowitz mean-variance portfolio theory applied to mixing MCMC samplers — michaelchchoi · 2026-11-11
- AI agents run 24/7 for a month to rewrite Météo-France's AROME weather model — IgorCarron · 2026-11-11
- NYU's Steertuning Lets a Robot Learn a Chore From 5 Minutes of Human Demo — CyberRobooo · 2026-11-11
- New preprint maps human embryonic patterning in early organogenesis at spatial single-cell resolution — anshulkundaje · 2026-11-11