Skip to content

Looped Transformers under the Jacobian Lens: Does the Global Workspace Survive Recurrence?

Sep 2026 · 4 citations · 20 references
Computer Science

TL;DR

This work extends the Jacobian lens to iterated architectures using a virtual-unrolling adapter and finds that a workspace forms in the iterated part of each architecture, but that recurrence changes how it can be accessed.

Abstract

Recent work identifies a mid-depth band of verbalisable, causally potent representations in a standard feedforward transformer --- a functional analogue of a global workspace. Whether the same workspace functionality emerges when depth is implemented through recurrence rather than a stack of distinct layers remains unknown. Looped and depth-recurrent transformers provide a direct test of this question because they reuse the same weights across depth. We extend the Jacobian lens to iterated architectures using a virtual-unrolling adapter. We apply the full workspace suite --- lens fitting, readout, and eleven causal experiment families --- to Ouro-2.6B (48 layers looped 4 times, deeply supervised) and Huginn-0125 (a 4-layer core recurred 16 times, trained for latent reasoning), using Qwen3.6-27B (64 untied layers) as the standard baseline. We find that a workspace forms in the iterated part of each architecture, but that recurrence changes how it can be accessed. Ouro reconstructs workspace content in every loop, and linear transport cannot carry that content across loop boundaries; writes and ablations must therefore span every remaining loop. Huginn carries content forward across all sixteen recurrences, while reads, writes, and ablations act only within a sliding window of roughly two recurrences. Whether newly injected content can be verbalised tracks explicit per-iteration supervision; whether existing content can be steered does not.

View source

Similar papers

#machine learning Preprint Sep 2026

Shared Weights, Selected Computations: How Looped Transformers Route What Each Loop Does

Looped Transformers repeatedly apply the same set of Transformer layers, giving them a recurrent architecture for latent computation. Their strong performance on iterative reasoning and length-generalization tasks suggests an appealing explanation: recurrence may provide an inductive bias that lets the model reuse a le...

Jia-Jun Wu, Yi Hu, Mu-Han Zhang · 0 citations
Preprint Aug 2026

Allocating Recurrent Compute in Looped Language Models

Results show that the benefits of recurrent depth can be retained without repeatedly executing the dense FFN, and view recurrence as repeated composition of a state update and argue that an application is valuable when it exposes a new cross-position influence direction that remains observable at the task readout.

Ruhai Lin, Yi-Yang Guo, Ruiming Zhu et al. · 4 citations
#artificial intelligence Preprint Sep 2026

LoopICL: Looping a single transformer block to solve tabular tasks

LoopICL, a looped transformer whose core design decouples parameter count from computational depth, is introduced, a looped transformer whose recurrent design enables users to also trade off inference cost and performance, providing a resource-aware TFM.

Amir Rezaei Balef, Katharina Eggensperger · 0 citations
#machine learning Preprint Sep 2026

Does Transolver really need a Transformer?

This work performs careful ablations on a challenging suite of nine 3D fluid dynamics benchmarks to find that replacing token attention with a constant linear map does not affect the accuracy, and provides a novel FlashAttention-style efficient implementation of the key slicing/deslicing module of Transolver.

Shi-Zheng Wen, Siddhartha Mishra · 0 citations
#small language model Preprint Aug 2026

The Von-Neumann State-Space Transformer for neural decoding

A von-Neumann inspired hypothesis of efficient computation as an alternative for neural decoding, a memory-augmented Transformer whose feed-forward block is a low-rank instruction bank: a shared base operator plus a small set of learned low-rank instructions, from which a per-token code synthesizes the weight matrix ac...

Morteza Sarafyazd · 0 citations
Preprint Aug 2026

A Calibrated Test of Internal Action Maps: State Signals Without Global Affine Closure

This work test whether action maps fitted without a source reach its natural post-action activation and compose and validate the geometric branch on a known affine S_5 carrier: all held-source folds pass one-step, composition, inverse, decoding, and commutativity gates.

De-Kun Yang · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.