AbbIE: Autoregressive Block-Based Iterative Encoder for Efficient Sequence Modeling
Not on the map. Why?
Abstract (arXiv)
We introduce the Autoregressive Block-Based Iterative Encoder (AbbIE), a novel recursive generalization of the encoder-only Transformer architecture, which achieves better perplexity than a standard Transformer and allows for the dynamic scaling of compute resources at test time. This simple, recursive approach is a complement to scaling large language model (LLM) performance through parameter and token counts. AbbIE performs its iterations in latent space, but unlike latent reasoning models, does not require a specialized dataset or training protocol. We show that AbbIE upward generalizes (ability to generalize to arbitrary iteration lengths) at test time by only using 2 iterations during train time, far outperforming alternative iterative methods. AbbIE's ability to scale its computational expenditure based on the complexity of the task gives it an up to 12% improvement in zero-shot in-context learning tasks versus other iterative and standard methods and up to 5% improvement in language perplexity. The results from this study open a new avenue to Transformer performance scaling. We perform all of our evaluations on model sizes up to 350M parameters.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 42 of its 51 references that are in the map. First posted on arXiv 11 Jul 2025.
Builds on
42 of 51 references.
References · 42
- 2017Attention Is All You Needcited by 60,361
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
- 2019Root Mean Square Layer Normalizationcited by 1,480
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
30 more
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
- 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 950
- 2020On Layer Normalization in the Transformer Architecturecited by 922
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 897
- 2021Show Your Work: Scratchpads for Intermediate Computation with Language Modelscited by 886
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 827
- 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 797
- 2023Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizescited by 737
- 2018Universal Transformerscited by 647
- 2022Efficiently Scaling Transformer Inferencecited by 539
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 439
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 415
- 2022The Stack: 3 TB of permissively licensed source codecited by 359
- 2025SmolLM2: When Smol Goes Big -- Data-Centric Training of a Small Language Modelcited by 335
- 2023Finding Neurons in a Haystack: Case Studies with Sparse Probingcited by 334
- 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
- 2018An Empirical Model of Large-Batch Trainingcited by 281
- 2023Looped Transformers as Programmable Computerscited by 237
- 2024Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durationscited by 170
- 2023Beyond Chinchilla-Optimal: Accounting for Inference in Language Model Scaling Lawscited by 159
- 2023Looped Transformers are Better at Learning Learning Algorithmscited by 149
- 2024Hopping Too Late: Exploring the Limitations of Large Language Models on Multi-Hop Queriescited by 78
- 2024Relaxed Recursive Transformers: Effective Parameter Sharing with Layer-wise LoRAcited by 78
- 2024From Tokens to Words: On the Inner Lexicon of LLMscited by 48
- 2025LLM Unlearning via Neural Activation Redirectioncited by 41
- 2022Path Independent Equilibrium Models Can Better Exploit Test-Time Computationcited by 38
- 2024AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Modelscited by 36
- 2023VISIT: Visualizing and Interpreting the Semantic Information Flow of Transformerscited by 32
- 20244-bit Shampoo for Memory-Efficient Network Trainingcited by 18
- 2024Memory Is All You Need: An Overview of Compute-in-Memory Architectures for Accelerating Large Language Model Inferencecited by 15
Built on by
Citing papers per year: 2025: 4; 2026: 3.
7 papers.
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 133
- 2025Teaching Pretrained Language Models to Think Deeper with Retrofitted Recurrencecited by 47
- 2025Encode, Think, Decode: Scaling test-time reasoning with recursive latent thoughtscited by 24
- 2026SpiralFormer: Looped Transformers Can Learn Hierarchical Dependencies via Multi-Resolution Recursioncited by 12
- 2025MeSH: Memory-as-State-Highways for Recursive Transformerscited by 8
- 2026LatentChem: From Textual CoT to Latent Thinking in Chemical Reasoningcited by 8
- 2026Squeezing More from Limited Data with Recursive Transformerscited by 0
- 2026Squeezing More from Limited Data with Recursive Transformers27 Aug 2026
- 2026SpiralFormer: Looped Transformers Can Learn Hierarchical Dependencies via Multi-Resolution Recursion12 Feb 2026
- 2026LatentChem: From Textual CoT to Latent Thinking in Chemical Reasoning6 Feb 2026
- 2025Teaching Pretrained Language Models to Think Deeper with Retrofitted Recurrence10 Nov 2025
- 2025MeSH: Memory-as-State-Highways for Recursive Transformers9 Oct 2025
- 2025Encode, Think, Decode: Scaling test-time reasoning with recursive latent thoughts8 Oct 2025
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computation14 Jul 2025
Similar, not cited
Close in wording, no citation either way
- 2025Speed Always Wins: A Survey on Efficient Architectures for Large Language Models
- 2025Return of the Encoder: Maximizing Parameter Efficiency for SLMs
- 2025Training and Inference Efficiency of Encoder-Decoder Speech Models
- 2024Think Big, Generate Quick: LLM-to-SLM for Fast Autoregressive Decoding
- 2023Task-agnostic Distillation of Encoder-Decoder Language Models
- 2026Distilling Sequential Computation in Transformer Language Models
- 2025ReSSFormer: A Recursive Sparse Structured Transformer for Scalable and Long-Context Reasoning
- 2024Block Transformer: Global-to-Local Language Modeling for Fast Inference