AIAny

Attention Is All You Need

The 2017 paper that replaced recurrence with pure self-attention, making sequence models fully parallelizable — and, almost as a side effect, laying the architectural foundation for nearly every large language model that followed, from BERT to GPT.

Introduction

It is hard to overstate how much this eight-page paper rearranged AI. The title was almost a provocation — that attention alone, with no recurrence or convolution, was enough — yet within a few years every frontier language model was a descendant of the architecture it introduced. The deeper point was never translation quality; it was that dropping sequential computation made models trivially parallelizable, which is exactly what later let them scale to billions of parameters.

Key Findings
  • Attention replaces recurrence. The Transformer drops RNNs and CNNs entirely, using self-attention to relate any two positions in constant path length — so long-range dependencies stop being the bottleneck.
  • Parallelism unlocks scale. Without step-by-step recurrence, training parallelizes across the whole sequence; the model reached 28.4 BLEU on WMT'14 English-German at a fraction of prior training cost — the property that later made large-scale pretraining feasible.
  • Multi-head attention and positional encoding. Multiple heads capture different relationships at once, while positional encodings reinject the order that recurrence used to provide for free.
  • It generalizes. The same architecture transferred beyond translation to parsing and, eventually, to essentially all of language and multimodal modeling.
Why It Still Matters / When to Skip

Great fit if you want to read the single most load-bearing paper behind modern LLMs, or to understand attention, multi-head, and positional encoding from the source. Look elsewhere if you want the modern training recipe — scaling laws, RLHF, and decoder-only designs all came later; this is the architectural origin, not a current playbook.

Information

  • Websitearxiv.org
  • OrganizationsGoogle Brain, Google Research, University of Toronto
  • AuthorsAshish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Lukasz Kaiser, Illia Polosukhin
  • Published date2017/06/12

More Items

Introduces Declarative Attention (DA), a zero-shot protocol that has LMs declare which parts of long context to attend to during chain-of-thought, letting the runtime build dynamic attention masks and skip most KV-cache reads. Produces large token savings (up to ~52% on Gemma-4-31B) with modest accuracy loss.

Generates compact keyword sets for both queries and items with LLMs and matches them directly via an inverted index. Uses supervised fine-tuning to align keyword spaces, then alternates GRPO-based reinforcement learning on query- and item-side generators to co-evolve representations and maximize retrieval F1 while staying compatible with keyword-based infrastructure.

Studies looping shared transformer layers in Mixture-of-Experts models under matched budgets and proposes SMELT: loop the middle half twice while matching per-token FLOPs, non-embedding parameters, and KV cache. Shows 6.8–18.0% training-FLOPs savings on the compute-optimal frontier, stronger downstream gains on code and long-context tasks.