Looped Transformers achieve logical‑reasoning gains without any extra generated tokens. By reusing the same Transformer block multiple times at inference, they deepen the computation on‑the‑fly; although the model size remains unchanged, deeper loops naturally increase inference time compared to a single‑pass forward pass.
Before this work, most reasoning systems either relied on chain‑of‑thought prompting—adding token‑by‑token steps that linearly increase runtime—or fixed‑depth decision heads that could not allocate more compute to hard questions. Neither approach let a model dynamically deepen its thinking without paying the cost of additional output tokens.
Repeating the same layers at inference lifts JevBench accuracy from 63.2 % at depth 1 to 76.2 % at depth 4 for a 2.6 B checkpoint, a full 13‑point jump on a standard logical reasoning benchmark [1].
Most of that boost comes from the hard tier: LEV gains ten correct answers out of 72 standard items and nineteen out of 111 hard items when moving from depth 1 to depth 4, while easy questions are already solved at the shallowest level [1].
The papers also warn that deeper loops do not automatically solve all inference shortcomings. Early reasoning steps may produce richer pragmatic readings that later collapse to literal answers; “Answering from that early reading, an exploratory inference‑time remedy, recovers these implicatures without losing literal accuracy” [2]. This suggests a missed opportunity: decision models could expose intermediate loop states as optional outputs, but the current implementations treat them as internal bookkeeping only.
If looping layers can be toggled at runtime, developers can upgrade the reasoning performance of existing checkpoints with no extra memory or model‑size overhead. Benchmarks that measure logical and scalar inference should therefore be re‑run with a configurable loop depth, and production services ought to expose a “depth” knob rather than committing to a single forward pass.
Top comments (0)