Learning Iterative Reasoning through Energy Minimization
Yilun Du, Shuang Li, Joshua B. Tenenbaum, Igor Mordatch
Abstract
Deep learning has excelled on complex pattern recognition tasks such as image classification and object recognition. However, it struggles with tasks requiring nontrivial reasoning, such as algorithmic computation. Humans are able to solve such tasks through iterative reasoning -spending more time thinking about harder tasks. Most existing neural networks, however, exhibit a fixed computational budget controlled by the neural network architecture, preventing additional computational processing on harder tasks. In this work, we present a new framework for iterative reasoning with neural networks. We train a neural network to parameterize an energy landscape over all outputs, and implement each step of the iterative reasoning as an energy minimization step to find a minimal energy solution. By formulating reasoning as an energy minimization problem, for harder problems that lead to more complex energy landscapes, we may then adjust our underlying computational budget by running a more complex optimization procedure. We empirically illustrate that our iterative reasoning approach can solve more accurate and generalizable algorithmic reasoning tasks in both graph and continuous domains. Finally, we illustrate that our approach can recursively solve algorithmic problems requiring nested reasoning. Code and additional information is available at https://energy-based-model.github.io/iterativereasoning-as-energy-minimization/ .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 890c9b7f-625a-4fef-9490-1c0f9546172cCited by top-tier papers23
- Path Independent Equilibrium Models Can Better Exploit Test-Time ComputationCem Anil, Ashwini Pokle, Kaiqu Liang, Johannes Treutlein et al.NeurIPS 2022 · 43 citations
- Few-Shot Fast-Adaptive Anomaly DetectionZe Wang, Yipin Zhou, Rui Wang, Tsung-Yu Lin et al.NeurIPS 2022 · 42 citations
- Energy-Based Transformers are Scalable Learners and ThinkersAlexi Gladstone, Ganesh Nanduru, Md Mofijul Islam, Peixuan Han et al.ICLR 2026 · 38 citations
- Learning Iterative Reasoning through Energy DiffusionYilun Du, Jiayuan Mao, Joshua B. TenenbaumICML 2024 · 28 citations
- A composable machine-learning approach for steady-state simulations on high-resolution gridsRishikesh Ranade, Chris Hill, Lalit Ghule, Jay PathakNeurIPS 2022 · 13 citations
Builds on10
- Strategies for Pre-training Graph Neural NetworksWeihua Hu, Bowen Liu, Joseph Gomes, Marinka Zitnik et al.ICLR 2020 · 1,744 citations
- Generalized Energy Based ModelsMichael Arbel, Liang Zhou, Arthur GrettonICLR 2021 · 254 citations
- Compositional Visual Generation with Energy Based ModelsYilun Du, Shuang Li, Igor MordatchNeurIPS 2020 · 225 citations
- On the Anatomy of MCMC-Based Maximum Likelihood Learning of Energy-Based ModelsErik Nijkamp, Mitch Hill, Tian Han, Song-Chun Zhu et al.AAAI 2020 · 182 citations
- Improved Contrastive Divergence Training of Energy-Based ModelsYilun Du, Shuang Li, Joshua B. Tenenbaum, Igor MordatchICML 2021 · 171 citations
Related papers
- A Difference-of-Convex Functions Approach to Energy-Based Iterative ReasoningDaniel Tschernutter, David Diego Castro, Maciej KasinskiNeurIPS 2025
- Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent NetworksAvi Schwarzschild, Eitan Borgnia, Arjun Gupta, Furong Huang et al.NeurIPS 2021 · 133 citations
- Generalizable Reasoning through Compositional Energy MinimizationAlexandru Oarga, Yilun DuNeurIPS 2025 · 3 citations
- Understanding Deep Architecture with Reasoning LayerXinshi Chen, Yufei Zhang, Christoph Reisinger, Le SongNeurIPS 2020 · 14 citations
- ChainGPT: Dual-Reasoning Model with Recurrent Depth and Multi-Rank State UpdatesYunao Zheng, Xiaojie Wang, Lei Ren, Chen WeiICLR 2026
