Skip to content
gentic.news — AI News Intelligence Platform
Connecting to the Living Graph…

Listen to today's AI briefing

Daily podcast — 5 min, AI-narrated summary of top stories

A Sudoku grid partially filled with numbers, with green highlights marking correct placements, overlaid on a dark…
AI ResearchScore: 85

10M-Parameter GRAM Model Beats 3x Larger Rivals with Parallel Reasoning

GRAM uses stochastic recursion to explore multiple reasoning paths in parallel, achieving 97% on hard Sudoku with 10M parameters, outperforming deterministic models 3x its size.

·5h ago·3 min read··2 views·AI-Generated·Report error
Share:
How does the 10-million-parameter GRAM model outperform larger deterministic rivals?

GRAM, a 10-million-parameter model, achieves 97% accuracy on hard Sudoku puzzles by exploring multiple reasoning paths in parallel, outperforming deterministic recursive models three times its size.

TL;DR

GRAM uses stochastic recursion to explore multiple reasoning paths. · 10M parameter model hits 97% on hard Sudoku vs 87.4%. · Parallel sampling adds width scaling beyond depth scaling.

A 10-million-parameter model called GRAM achieves 97% accuracy on hard Sudoku puzzles, surpassing deterministic recursive models three times its size. The key innovation is stochastic recursion that explores multiple reasoning paths in parallel rather than a single deterministic chain.

Key facts

  • GRAM: 10 million parameters, 97% on hard Sudoku.
  • Best prior recursive model: 87.4% accuracy on same Sudoku.
  • 20 parallel samples outperforms 320 recursion steps.
  • Sudoku generation: 99% valid puzzles in 16 steps.
  • Diffusion baseline: 91% valid with 55M params and 1000 steps.

Most AI reasoning models are trapped on a single train of thought, and GRAM ("Generative Recursive Reasoning") is the first to break that by letting the model think in parallel universes simultaneously [per @rohanpaul_ai]. The problem is that all existing recursive models are fully deterministic, meaning given the same input they always follow the exact same reasoning path and can never escape a wrong trajectory or discover more than 1 valid answer.

GRAM fixes this by injecting learned randomness at each refinement step, so the model samples a slightly different direction each time rather than snapping to 1 fixed next state, which produces a spread of diverse reasoning trajectories. At test time the model runs many of these paths in parallel and selects the best one using a small reward predictor trained alongside the main model, adding a "width" scaling axis on top of the usual "depth" axis of running more recursion steps.

On hard Sudoku puzzles, GRAM with 10M parameters hits 97% accuracy versus 87.4% for the best prior recursive model, and with only 20 parallel samples it outperforms every deterministic baseline even at 320 recursion steps. On tasks with many valid answers like N-Queens, deterministic recursive models collapse as the number of solutions grows, while GRAM maintains near-perfect accuracy throughout.

The same stochastic framework also acts as a generator: given a blank board, GRAM produces valid Sudoku puzzles 99% of the time using 16 steps, versus 1,000 steps and 55M parameters for the best diffusion baseline at just 91%.

The unique take: GRAM challenges the prevailing assumption that more parameters and deeper recursion are the only ways to improve reasoning. By adding a width axis through parallel stochastic trajectories, it achieves superlinear scaling efficiency — a 3x parameter disadvantage is neutralized by 20 parallel samples. This suggests that for many reasoning tasks, compute may be better spent on parallel exploration than on scaling model size or recursion depth alone.

What to watch

Watch for open-source implementations of GRAM on GitHub and whether larger models (100M+ parameters) using the same stochastic recursion paradigm can match or exceed chain-of-thought performance on general reasoning benchmarks like GSM8K or MATH. A paper with ablation studies on the reward predictor's architecture would clarify the scalability ceiling.

Source: gentic.news · · author= · citation.json

AI-assisted reporting. Generated by gentic.news from multiple verified sources, fact-checked against the Living Graph of 4,300+ entities. Edited by Ala SMITH.

Following this story?

Get a weekly digest with AI predictions, trends, and analysis — free.

AI Analysis

GRAM's approach is a notable departure from the dominant paradigm of scaling model size and recursion depth. By injecting controlled randomness at each refinement step, it enables a form of implicit ensemble reasoning that is both computationally efficient and robust. The 3x parameter-to-performance ratio is striking, but the paper's focus on constrained domains like Sudoku and N-Queens limits generalizability. The key architectural question is whether the reward predictor's quality scales with problem complexity — for open-ended reasoning tasks, the predictor itself may become a bottleneck. The generator capability (99% valid puzzles in 16 steps) is equally interesting, suggesting that stochastic recursion could double as a data augmentation tool for training other models. However, the lack of ablation on the randomness injection mechanism (e.g., temperature vs. noise distribution) leaves room for optimization. If this approach generalizes to tasks like theorem proving or code generation, it could reshape how the field thinks about inference-time compute allocation.

Mentioned in this article

Enjoyed this article?
Share:

AI Toolslive

Five one-click lenses on this article. Cached for 24h.

Pick a tool above to generate an instant lens on this article.

Related Articles

From the lab

The framework underneath this story

Every article on this site sits on top of one engine and one framework — both built by the lab.

More in AI Research

View all