ArXiv

Tapered Language Models

Authors
Reza Bayat, Ali Behrouz, Aaron Courville
Categories
cs.LG, cs.AI, cs.CL
arXiv
https://arxiv.org/abs/2606.23670v1
PDF
https://arxiv.org/pdf/2606.23670v1

Brief

Tapered Language Models (TLMs) argue that uniform per-layer parameter allocation is suboptimal: earlier layers benefit from more capacity while later layers can be slimmer. The authors run controlled experiments showing that tapering MLP width via a smooth cosine schedule (more width early, less later) improves perplexity and downstream benchmarks versus uniform-width baselines. Results hold across three model scales and four architectures; full paper available on arXiv (abstract provided).

Why it matters

Bayat, Behrouz, and Courville (arXiv 2026-06-22) find that, under a fixed parameter budget, allocating more capacity to early layers and less to later layers reduces perplexity, whereas the reverse (heavier later layers) hurts performance.

Key details

  • They introduce Tapered Language Models (TLMs): tapering MLP width across depth with a smooth cosine schedule. Across three model scales and four architectures (Transformer, Gated Attention, Hope-attention, and Titans), tapering consistently improves perplexity and downstream benchmark performance at no extra parameter or compute cost.
Source evidence

Abstract

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.