Energy-guided Recursive Model

Yifei Zhao; Ying Tang

cs.LGJul 11, 2026

Energy-guided Recursive Model

Authors: Yifei Zhao, Ying Tang

Organizations: Institute of Fundamental and Frontier Sciences, University of Electronic Science and Technology of China, Chengdu 611731, China · School of Physics, University of Electronic Science and Technology of China, Chengdu 611731, China · Key Laboratory of Quantum Physics and Photonic Quantum Information, Ministry of Education, University of Electronic Science and Technology of China, Chengdu 611731, China · Non-classical Information Science Basic Discipline Research Center of Sichuan Province, University of Electronic Science and Technology of China, Chengdu 611731, China

Abstract

Recursive models show promise on reasoning and language tasks, yet their test-time scaling lacks a principled criterion for selecting trajectories or determining recurrent depth. We introduce \textbf{Energy-guided Recursive Model (ERM)}, which uses Hopfield-type memories of valid local and global structures to assign intrinsic energies to candidate trajectories. These energies guide candidate selection and suggest an effective range of recurrent depths, implying that deeper recurrence does not necessarily improve reasoning accuracy. They also enable sampling methods such as parallel tempering to improve exploration. For reasoning tasks, ERM achieves optimal solutions on Sudoku ( $98.97\%$ ), Pencil Puzzle Bench (PPBench, $88.04\%$ ) and Maze ( $99.30\%$ ), reaching the best accuracy in recursive modeling. On language modeling, ERM reduces RedPajama-V2 perplexity by $1.74\%$ with marginal inference overhead. The results support energy guidance as a practical framework for improving test-time scaling in recursive models.

Explore similar work

Boosting Inference with Guided Reasoning: Stochastic Exploration for Recursive Models
May 24, 2026Andrew Corbett, Archit Sood, Anna Tzatzopoulou +2Reasoning Trajectory Recursion
Probabilistic Tiny Recursive Model
May 19, 2026Amin Sghaier, Ali Parviz, Alexia Jolicoeur-MartineauRecursion Test-Time Scaling
Recursive Vision Language Models for General Symbolic Reasoning
Aug 2, 2026Omid Nejati Manzari, Guillaume Lajoie, Hassan RivazLarge Reasoning Models Recursion

May 24, 2026 · cs.AIJ/K move · Enter open · S save

Boosting Inference with Guided Reasoning: Stochastic Exploration for Recursive Models

Andrew Corbett, Archit Sood, Anna Tzatzopoulou, Sai-Aakash Ramesh+1

digiLab, UK · University of Bristol, UK

Recent work on recursive architectures has shown that tiny neural networks can be surprisingly powerful on structured reasoning tasks. The trick is to model reasoning trajectories with a latent dynamical system. We argue that the inference-time behaviour of these architectures is best understood as approximate inference over latent reasoning trajectories, with deterministic recursion as the one-particle, zero-noise limit. We make this view operational through guided stochastic exploration: stochastic perturbations of the reasoning dynamics propose neighbouring trajectories, and the model's existing early-stopping head reweights them online. The framework yields three label-free diagnostics: local stability, guide alignment, and cloud-token entropy. These predict, from inference traces alone, whether the procedure will help and which of its outputs to trust. On Sudoku-Extreme it lifts exact-solve accuracy from

85.9\%

98.0\%

without retraining; on Maze-Hard the diagnostics flag a misaligned guide, as validation performance later confirms. The same machinery thus characterises both when recursive reasoning has room to improve at the trajectory level and when the model's internal guide can recover it.

Reasoning Trajectory Recursion Inference-Time Efficient Inference Efficient Exploration Neural Network Deterministic

Open paper Ask about it PDF

Abstract

Explore similar work

Boosting Inference with Guided Reasoning: Stochastic Exploration for Recursive Models

Probabilistic Tiny Recursive Model

Recursive Vision Language Models for General Symbolic Reasoning