Tapered Language Models
Not on the map. Why?
Abstract (arXiv)
Modern language models, including transformer, recurrent, and memory-based variants, share a common chassis: a stack of identical layers in which parameters are allocated uniformly across depth. This is a default inherited from the original transformer and largely unchanged since, yet a growing body of evidence suggests that layers contribute non-uniformly to the final output, with later layers refining the residual stream rather than transforming it. We ask whether parameter capacity should reflect this asymmetry. Our controlled experiment shows that, under a fixed budget, allocating more capacity to earlier layers and less to later layers improves perplexity over a uniform-width baseline, while the reverse allocation hurts. Building on this result, we introduce Tapered Language Models (TLMs), an architectural principle in which a parameter-bearing component is monotonically tapered across depth under a fixed total budget. MLPs are the natural site for this instantiation: they dominate parameter count across all modern LM families and expose width as a single, clean axis of variation. Across three model scales and four architectures (Transformer, Gated Attention, Hope-attention, and Titans), tapering MLP width via a smooth cosine schedule consistently improves perplexity and downstream benchmark performance over uniform baselines, at no additional parameter or compute cost. These findings establish depth-aware capacity allocation as a simple, architecture-agnostic axis of language model design, a free lever hidden in plain sight.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 58 of its 63 references that are in the map. First posted on arXiv 22 Jun 2026.
Builds on
58 of 63 references.
References · 58
- 2017Attention Is All You Needcited by 59,932
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2023Visual Instruction Tuningcited by 7,792
- 2022Scalable Diffusion Models with Transformerscited by 5,931
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2020GLU Variants Improve Transformercited by 1,724
38 more
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
- 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,283
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 814
- 2022Simplified State Space Layers for Sequence Modelingcited by 776
- 2023Retentive Network: A Successor to Transformer for Large Language Modelscited by 594
- 2023Eliciting Latent Predictions from Transformers with the Tuned Lenscited by 579
- 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 471
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
- 2023Resurrecting Recurrent Neural Networks for Long Sequencescited by 397
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
- 2024Learning to (Learn at Test Time): RNNs with Expressive Hidden Statescited by 329
- 2024xLSTM: Extended Long Short-Term Memorycited by 320
- 2024Titans: Learning to Memorize at Test Timecited by 303
- 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 302
- 2022Confident Adaptive Language Modelingcited by 297
- 2025Layer by Layer: Uncovering Hidden Representations in Language Modelscited by 293
- 2025Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Freecited by 266
- 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 242
- 2024Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Modelscited by 232
- 2019Depth-Adaptive Transformercited by 227
- 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 219
- 2024Samba: Simple Hybrid State Space Models for Efficient Unlimited Context Language Modelingcited by 167
- 2020Funnel-Transformer: Filtering out Sequential Redundancy for Efficient Language Processingcited by 161
- 2020Liquid Time-constant Networkscited by 160
- 2024Eagle and Finch: RWKV with Matrix-Valued States and Dynamic Recurrencecited by 155
- 2024The Remarkable Robustness of LLMs: Stages of Inference?cited by 138
- 2022Liquid Structural State-Space Modelscited by 134
- 2025RWKV-7 "Goose" with Expressive Dynamic State Evolutioncited by 134
- 2023The Truth is in There: Improving Reasoning in Language Models with Layer-Selective Rank Reductioncited by 120
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 120
- 2023MatFormer: Nested Transformer for Elastic Inferencecited by 79
- 2025DeltaProduct: Improving State-Tracking in Linear RNNs via Householder Productscited by 69
- 2025Nested Learning: The Illusion of Deep Learning Architecturescited by 69
- 2025Test-time regression: a unifying framework for designing sequence models with associative memorycited by 63
- 2025It's All Connected: A Journey Through Test-Time Memorization, Attentional Bias, Retention, and Online Optimizationcited by 60
50 most cited of 58 All 58 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.