mlsanityData to 14 Oct 2026

The Context-Ready Transformer

arXiv 2606.27538 ↗First posted 25 Jun 2026cs.CL cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

We introduce the context-ready transformer, a new recurrent neural network architecture built from a D-layer transformer block that pre-contextualizes each token before it enters the block. During left-to-right generation, a correction network combines the previous position's block output -- a cached summary of past context -- with the current token embedding, so the tokenenters the block already contextualized rather than as a raw embedding. At sequential inference, the correction chain makes the architecture a recurrent neural network. For training, we unroll the correction process K times over the full sequence, processing all positions in parallel at each step. A pretrained transformer can also be converted to a context-ready model by adding a zero-initialized correction FFN and fine-tuning. We evaluate across widths, depths, block sizes, and two datasets, with all comparisons against standard transformers, variants, and ablations. A D=5 model beats a 12-layer transformer while generating 1.7x faster on an A100. With K=10, a single-layermodel (D=1) beats a 6-layer transformer with a 2.6x inference speedup, and sequential inference matches parallel K=10 to within 0.01 PPL. The architecture benefits most from wide representations and long contexts. On a pointer-chasing task, D=1 trained with BPTT solves all 10 composition levels, while standard transformers exhibit staircase-like depth dependence.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 26 references that are in the map. First posted on arXiv 25 Jun 2026.

Builds on

17 of 26 references.

References · 17

  1. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
  2. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
  3. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
  4. 2023RWKV: Reinventing RNNs for the Transformer Eracited by 827
  5. 2018Universal Transformerscited by 647
  6. 2019Deep Equilibrium Modelscited by 615
  7. 2016Adaptive Computation Time for Recurrent Neural Networkscited by 506
  8. 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 415
  9. 2024xLSTM: Extended Long Short-Term Memorycited by 327
  10. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
  11. 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decodingcited by 298
  12. 2024Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Modelscited by 242
5 more
  1. 2022The Parallelism Tradeoff: Limitations of Log-Precision Transformerscited by 193
  2. 2021PonderNet: Learning to Pondercited by 168
  3. 2024CLLMs: Consistency Large Language Modelscited by 72
  4. 2020Accelerating Feedforward Computation via Parallel Nonlinear Equation Solvingcited by 52
  5. 2026ADEPT: Adaptive Dynamic Early-Exit Process for Transformerscited by 4

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Equivalence of Context and Parameter Updates in Modern Transformer Blocks
  2. 2026The Recurrent Transformer: Greater Effective Depth and Efficient Decoding
  3. 2025Compress, Gather, and Recompute: REFORMing Long-Context Processing in Transformers
  4. 2026Latent Recurrent Transformer: Architecture Exploration, Training Strategies, and Scaling Behavior
  5. 2024Linearizing Large Language Models
  6. 2024Universal In-Context Approximation By Prompting Fully Recurrent Models
  7. 2023Block-State Transformers
  8. 2025Pimba: A Processing-in-Memory Acceleration for Post-Transformer Large Language Model Serving