Table of Contents
Fetching ...

Closed-Loop Transformers: Autoregressive Modeling as Iterative Latent Equilibrium

Akbar Anbar Jafari, Gholamreza Anbarjafari

TL;DR

This work identifies an inherent open-loop bottleneck in autoregressive transformers and proposes Equilibrium Transformers (EqT), which perform iterative latent refinement to reach a self-consistent equilibrium before emitting each token. By introducing a learned energy function that enforces predictive coherence, bidirectional reconstruction, and memory grounding, EqT achieves approximate MAP inference with convergence guarantees and improved performance on hard long-range tasks. The approach unifies deep equilibrium models, diffusion language models, and test-time training under a single closed-loop framework, and initial parity-task experiments show noteworthy gains where one-shot inference struggles. The results suggest that inference-time deliberation can qualitatively enhance reasoning, grounding, and long-context fidelity, offering a principled path toward more robust language models with controllable compute.

Abstract

Contemporary autoregressive transformers operate in open loop: each hidden state is computed in a single forward pass and never revised, causing errors to propagate uncorrected through the sequence. We identify this open-loop bottleneck as a fundamental architectural limitation underlying well-documented failures in long-range reasoning, factual consistency, and multi-step planning. To address this limitation, we introduce the closed-loop prediction principle, which requires that models iteratively refine latent representations until reaching a self-consistent equilibrium before committing to each token. We instantiate this principle as Equilibrium Transformers (EqT), which augment standard transformer layers with an Equilibrium Refinement Module that minimizes a learned energy function via gradient descent in latent space. The energy function enforces bidirectional prediction consistency, episodic memory coherence, and output confidence, all computed without external supervision. Theoretically, we prove that EqT performs approximate MAP inference in a latent energy-based model, establish linear convergence guarantees, and show that refinement improves predictions precisely on hard instances where one-shot inference is suboptimal. The framework unifies deep equilibrium models, diffusion language models, and test-time training as special cases. Preliminary experiments on the binary parity task demonstrate +3.28% average improvement on challenging sequences, with gains reaching +8.07% where standard transformers approach random performance, validating that the benefit of deliberation scales with task difficulty. Just as attention mechanisms resolved the sequential bottleneck of recurrent networks, we propose that closed-loop equilibrium may resolve the commitment bottleneck of open-loop autoregression, representing a foundational step toward language models.

Closed-Loop Transformers: Autoregressive Modeling as Iterative Latent Equilibrium

TL;DR

This work identifies an inherent open-loop bottleneck in autoregressive transformers and proposes Equilibrium Transformers (EqT), which perform iterative latent refinement to reach a self-consistent equilibrium before emitting each token. By introducing a learned energy function that enforces predictive coherence, bidirectional reconstruction, and memory grounding, EqT achieves approximate MAP inference with convergence guarantees and improved performance on hard long-range tasks. The approach unifies deep equilibrium models, diffusion language models, and test-time training under a single closed-loop framework, and initial parity-task experiments show noteworthy gains where one-shot inference struggles. The results suggest that inference-time deliberation can qualitatively enhance reasoning, grounding, and long-context fidelity, offering a principled path toward more robust language models with controllable compute.

Abstract

Contemporary autoregressive transformers operate in open loop: each hidden state is computed in a single forward pass and never revised, causing errors to propagate uncorrected through the sequence. We identify this open-loop bottleneck as a fundamental architectural limitation underlying well-documented failures in long-range reasoning, factual consistency, and multi-step planning. To address this limitation, we introduce the closed-loop prediction principle, which requires that models iteratively refine latent representations until reaching a self-consistent equilibrium before committing to each token. We instantiate this principle as Equilibrium Transformers (EqT), which augment standard transformer layers with an Equilibrium Refinement Module that minimizes a learned energy function via gradient descent in latent space. The energy function enforces bidirectional prediction consistency, episodic memory coherence, and output confidence, all computed without external supervision. Theoretically, we prove that EqT performs approximate MAP inference in a latent energy-based model, establish linear convergence guarantees, and show that refinement improves predictions precisely on hard instances where one-shot inference is suboptimal. The framework unifies deep equilibrium models, diffusion language models, and test-time training as special cases. Preliminary experiments on the binary parity task demonstrate +3.28% average improvement on challenging sequences, with gains reaching +8.07% where standard transformers approach random performance, validating that the benefit of deliberation scales with task difficulty. Just as attention mechanisms resolved the sequential bottleneck of recurrent networks, we propose that closed-loop equilibrium may resolve the commitment bottleneck of open-loop autoregression, representing a foundational step toward language models.

Paper Structure

This paper contains 56 sections, 9 theorems, 42 equations, 1 figure, 2 tables, 1 algorithm.

Key Result

Proposition 1

The equilibrium state $\mathbf{h}^*_t$ defined by Equation eq:equilibrium_objective is the maximum a posteriori (MAP) estimate:

Figures (1)

  • Figure 1: Empirical analysis of Equilibrium Transformers on the binary parity task. (a) Accuracy versus sequence length: EqT (red) maintains higher accuracy than Standard (blue) in the challenging regime ($L \geq 64$). (b) Per-length improvement: positive gains (green) dominate for $L \geq 64$. (c) Training dynamics: EqT converges to lower loss, especially on longer sequences. (d) Improvement by difficulty: EqT provides larger gains on harder instances, validating Theorem \ref{['thm:benefit']}.

Theorems & Definitions (15)

  • Proposition 1: MAP Equivalence
  • proof
  • Theorem 2: Linear Convergence
  • proof
  • Theorem 3: Local Linear Convergence
  • proof
  • Theorem 4: Benefit of Equilibrium
  • proof
  • Corollary 5: Adaptive Iterations
  • Theorem 6: Implicit Regularization
  • ...and 5 more