The Transformer (2017) is a neural network architecture enabling machines to learn patterns in sequential data without recurrence, powering modern AI. It democratized intelligence itself—a revolutionary tool that makes tools, echoing the Age of Revolutions' redistribution of power and knowledge.
Vaswani et al., Google Brain & University of Toronto. In June 2017, eight researchers—Ashish Vaswani, Noam Shazeer, Parmar Aidan, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Łukasz Kaiser, Illia Polosukhin—published "Attention Is All You Need" in *Advances in Neural Information Processing Systems*. The paper introduced the Transformer, a sequence-to-sequence model built entirely on attention mechanisms, abandoning recurrence. It was not the first attention mechanism (Bahdanau et al., 2014), but the first to scale attention alone to industrial strength. Within five years, Transformers had become the substrate of GPT, BERT, and nearly all large language models. The architecture redistributed computational power from specialized hardware (GPUs optimized for recurrence) to parallelizable matrix operations—a leveling of the playing field analogous to the printing press or the steam engine.
Specifications
Layers
6 encoder, 6 decoder (N=6)
Architecture
Encoder-Decoder with multi-head self-attention
Attention Heads
8 (in original; varies in practice)
Core Innovation
Scaled dot-product attention; no recurrence or convolution
Model Dimension
512 (d_model in original)
Parallelization
Full; O(1) depth for sequence length n (vs. O(n) for RNNs)
Publication Date
June 12, 2017
Computational Cost
~3.3 × 10^8 FLOPs per training step (original)
Feed-Forward Hidden
2048 (d_ff in original)
Positional Encoding
Sinusoidal; no learned parameters
Training Data (Original)
WMT 2014 English-German, English-French corpora
Engineering
The Transformer replaces the recurrent neural network's sequential processing loop with a single, massively parallel attention operation. At its core: Query (Q), Key (K), and Value (V) matrices are derived from input embeddings. Attention weights are computed as softmax(QK^T / √d_k), then applied to V. This operation—Scaled Dot-Product Attention—can be computed for all positions simultaneously, eliminating the bottleneck that made RNNs slow to train on long sequences. Multi-head attention repeats this operation h times in parallel (h=8 in the original), each with different learned projections, allowing the model to attend to different representation subspaces. The encoder stacks N=6 identical layers, each containing a multi-head self-attention sublayer and a position-wise feed-forward network (two dense layers with ReLU). The decoder is similar but adds a cross-attention layer that attends to encoder outputs. Layer normalization and residual connections stabilize training. Positional encodings—sine and cosine functions of different frequencies—inject sequence order information, since attention itself is permutation-invariant. This design achieves O(1) sequential depth (all positions computed in parallel) versus O(n) for RNNs, while maintaining O(n²) memory and computation per sequence.
Parts & Labels
Masking
Causal mask in decoder self-attention prevents attending to future tokens; padding mask in encoder/decoder ignores <pad> tokens
Decoder Stack
N=6 identical layers; generates output token-by-token, attends to encoder and previous decoder outputs
Encoder Stack
N=6 identical layers; processes input sequence in parallel
Cross-Attention
Decoder attends to encoder outputs; Q from decoder, K,V from encoder
Input Embedding
Learned dense projection from vocabulary to d_model dimensions
Layer Normalization
Applied before each sublayer (pre-norm variant) or after (post-norm); stabilizes gradient flow
Two dense layers with ReLU: FFN(x) = max(0, xW₁ + b₁)W₂ + b₂
Output Linear & Softmax
Projects decoder output to vocabulary logits; softmax produces probability distribution over tokens
Multi-Head Self-Attention
h parallel scaled dot-product attention operations; outputs concatenated and projected
Scaled Dot-Product Attention
Attention(Q,K,V) = softmax(QK^T / √d_k)V; d_k = d_model / h
Historical Overview
The Transformer emerged at a moment of crisis in deep learning for language. Recurrent neural networks (RNNs, LSTMs, GRUs) had dominated sequence modeling since the 1990s, but they were fundamentally sequential: each hidden state depended on the previous one, making parallelization impossible and long-range dependencies hard to learn. By 2016, attention mechanisms—introduced by Bahdanau et al. (2014) for machine translation—had become standard bolted-on components, but they were used *alongside* recurrence, not instead of it. The Transformer paper asked a radical question: what if attention *is* the model? Vaswani et al. showed that a pure attention-based architecture, trained on 8 NVIDIA P100 GPUs for 3.5 days, outperformed the state-of-the-art RNN-based system (Gehring et al.'s convolutional seq2seq model) on WMT 2014 English-German translation. The BLEU score jumped from 25.16 to 28.4—a massive leap. More importantly, the Transformer trained 3.5× faster and could be scaled to longer sequences without the gradient-flow collapse that plagued RNNs. Within months, the architecture was adopted by Google for production machine translation. By 2018, it had become the foundation for BERT (Devlin et al.) and GPT (Radford et al.), which applied it to language understanding and generation at scale. By 2023, every major large language model—GPT-4, PaLM, LLaMA, Claude—was built on Transformers or Transformer variants.
Why It Existed
The Transformer solved a specific, urgent engineering problem: how to train deep sequence models fast enough to scale to billions of parameters and terabytes of data. RNNs were slow because their sequential dependency graph forced training to process sequences step-by-step, even on parallel hardware. Attention mechanisms had shown that models could learn to focus on relevant parts of the input without recurrence, but early attention-based models still used RNNs as a backbone. The Transformer eliminated that backbone entirely, replacing it with pure attention—a operation that is naturally parallelizable across all sequence positions. This unlocked two revolutions: (1) *speed*—training time dropped from weeks to days, enabling much larger models; (2) *scale*—without the vanishing-gradient problem that plagued deep RNNs, Transformers could be stacked 24, 48, or 96 layers deep, and trained on billions of tokens. Economically, the Transformer arrived at the moment when GPU clusters became commodity infrastructure and the internet had generated enough text (Common Crawl, Wikipedia, Books) to train billion-parameter models. Philosophically, it embodied a shift from *engineering intelligence* (hand-crafted features, explicit rules) to *learning structure from data* (end-to-end training on raw text). The Transformer made it possible to ask: what if we just scaled up the model, the data, and the compute? The answer—GPT-3, GPT-4—reshaped AI from an academic discipline into an industrial force.
Daily Use
In 2017–2024, the Transformer became invisible infrastructure. A user typing into Google Search, Gmail autocomplete, or ChatGPT was interacting with Transformers without knowing it. Machine translation (Google Translate), code completion (GitHub Copilot), image generation (DALL-E, Stable Diffusion—which use Transformer-based diffusion models), and speech recognition (Whisper) all rely on Transformers. In research, Transformers are the default architecture for any sequence-to-sequence task: summarization, question-answering, dialogue, time-series forecasting, protein folding (AlphaFold 2 uses Transformer-like attention), and even image classification (Vision Transformers, 2020). In industry, Transformers power recommendation systems (YouTube, Netflix), content moderation (detecting spam, hate speech), and drug discovery. A software engineer in 2024 might use a Transformer-based model via an API (OpenAI, Anthropic, Hugging Face) without ever touching the architecture directly—much as a driver uses an internal combustion engine without understanding thermodynamics. The Transformer has become the *lingua franca* of machine learning, the way the steam engine became the lingua franca of industrial power.
Crew / Personnel
Llion Jones
Google Brain; optimization and training stability
Alec Radford
OpenAI; applied Transformer to language modeling (GPT, GPT-2, GPT-3)
Jacob Devlin
Google AI; applied Transformer to bidirectional pretraining (BERT)
Noam Shazeer
Google Brain; co-designed multi-head attention and scaling strategies
Parmar Aidan
Google Brain; contributed to positional encoding and layer normalization
Yoshua Bengio
University of Montreal; foundational work on deep learning and attention; intellectual godfather
Aidan N. Gomez
University of Toronto (visiting Google); contributed to decoder design
Ashish Vaswani
Lead author; Google Brain; designed attention mechanism and overall architecture
Ilya Sutskever
OpenAI; not an author but championed Transformer scaling (GPT series)
Łukasz Kaiser
Google Brain; tensor2tensor framework, reproducibility
Jakob Uszkoreit
Google Brain; advised on sequence modeling and efficiency
Illia Polosukhin
Google Brain; implementation, experiments, and validation
Construction
The Transformer was constructed in TensorFlow (Google's open-source framework) and released with code in the tensor2tensor library (June 2017). The original model was trained on 8 NVIDIA P100 GPUs (16 GB memory each) for 3.5 days on the WMT 2014 English-German translation task (~4.5 million sentence pairs). Training used the Adam optimizer (learning rate 2.0, warmup 4000 steps, decay schedule), batch size 25,000 tokens, and dropout (0.1) for regularization. The model was implemented in pure TensorFlow operations—no custom CUDA kernels—making it portable and reproducible. Key hyperparameters: d_model=512, d_ff=2048, h=8 heads, N=6 layers, dropout=0.1, attention dropout=0.1. Positional encodings were computed once and cached. The decoder used autoregressive generation: at each step, the model sampled the next token from the softmax distribution and fed it back as input (greedy or beam search). Inference was slower than training (O(n) sequential steps for an n-token output) but still faster than RNNs because each step was a single forward pass through the full model, not a recurrent loop. The code was released open-source, enabling thousands of researchers to reproduce, modify, and scale the architecture. By 2018, Hugging Face's Transformers library had become the standard interface, abstracting away TensorFlow/PyTorch differences and providing pre-trained checkpoints.
Variations
The original Transformer was encoder-decoder (for sequence-to-sequence tasks like translation). Variations emerged rapidly: (1) *Decoder-only* (GPT, GPT-2, GPT-3, LLaMA, Mistral)—removed encoder, used causal masking in self-attention, trained on language modeling (predict next token). This became the dominant variant for large language models. (2) *Encoder-only* (BERT, RoBERTa, ALBERT)—removed decoder, trained bidirectionally on masked language modeling (predict masked tokens). Used for classification, NER, question-answering. (3) *Sparse attention*—replaced O(n²) full attention with local windows (Longformer, BigBird) or learned sparsity patterns (Linformer, Performer) to handle longer sequences. (4) *Multi-query attention* (Shazeer, 2019)—shared K,V across heads, reducing memory and compute. (5) *Grouped query attention* (Ainslie et al., 2023)—intermediate between multi-head and multi-query. (6) *Vision Transformer* (Dosovitskiy et al., 2020)—applied Transformer to image patches instead of tokens; no convolution. (7) *Diffusion Transformers* (Peebles & Xie, 2023)—replaced U-Net with Transformer for image generation (DiT). (8) *Mixture of Experts* (Shazeer et al., 2017; Lepikhin et al., 2020)—replaced dense feed-forward with sparse routing to different expert networks; enabled trillion-parameter models. (9) *Retrieval-augmented* (Lewis et al., 2020)—added a retrieval module to fetch relevant documents before generation. (10) *Prefix/prompt tuning*—froze pre-trained weights, added learnable prefix tokens for task-specific adaptation. Each variation traded off speed, memory, and expressiveness.
Bahdanau et al. introduce attention mechanismAttention allows RNNs to focus on relevant parts of input
2016
Gehring et al. propose convolutional sequence-to-sequence modelsConvolution replaces recurrence for faster training
June 12, 2017
Vaswani et al. publish 'Attention Is All You Need'Transformer architecture introduced; pure attention, no recurrence or convolution
2017
Google deploys Transformer in production machine translationGoogle Translate switches to Transformer-based models
June 2018
Devlin et al. introduce BERTBidirectional Encoder Representations from Transformers
June 2018
Radford et al. release GPT (OpenAI)Generative Pre-trained Transformer; decoder-only, language modeling
February 2019
Radford et al. release GPT-21.5 billion parameters; demonstrates few-shot learning
October 2020
Dosovitskiy et al. introduce Vision Transformer (ViT)Applies Transformer to image classification; no convolution
June 2021
Lepikhin et al. introduce Switch TransformersSparse mixture of experts; 1.6 trillion parameters
January 2022
Radford et al. release GPT-3175 billion parameters; demonstrates in-context learning
November 2022
OpenAI releases ChatGPTGPT-3.5 fine-tuned with RLHF; 100 million users in 2 months
Famous Examples
T5 (Google, 2019)
11B parameters (largest). Unified text-to-text framework: all NLP tasks (translation, summarization, QA, classification) framed as seq2seq. Encoder-decoder Transformer.
LLaMA (Meta, 2023)
7B–65B parameters. Efficient Transformer trained on 1.4T tokens. Outperforms GPT-3 (175B) on many benchmarks. Enables open-source LLM research.
BERT (Google, 2018)
340M parameters (base), 110M (base). Bidirectional pretraining on masked language modeling. State-of-the-art on GLUE, SQuAD. Standard for text classification, NER, question-answering.
GPT-2 (OpenAI, 2019)
1.5B parameters. Demonstrates few-shot learning and coherent long-form text generation. Withheld from public release initially due to misuse concerns; released later.
GPT-3 (OpenAI, 2020)
175B parameters, trained on 570GB text. Demonstrates in-context learning: can perform translation, Q&A, arithmetic, code generation from few examples in the prompt. Powers ChatGPT.
GPT-4 (OpenAI, 2023)
Reported ~1.7T parameters (sparse mixture of experts). Multimodal (text + image). State-of-the-art on reasoning, coding, math. Closed-source; available via API.
DALL-E (OpenAI, 2021)
3.5B parameters. Transformer-based image generation from text. Trained on 250M image-text pairs. Generates novel, creative images.
ELECTRA (Google, 2020)
Replaced masked language modeling with discriminative pretraining (replaced token detection). More sample-efficient than BERT.
Claude (Anthropic, 2023)
100B parameters (estimated). Transformer trained with Constitutional AI (RLHF guided by principles). Emphasis on safety, long context (100k tokens).
RoBERTa (Facebook, 2019)
355M parameters. Improved BERT training procedure (longer training, larger batches, more data). Outperforms BERT on GLUE, SuperGLUE.
Vision Transformer (Google, 2020)
ViT-L/16 (304M params). Applies Transformer to image patches. Matches ResNet-50 on ImageNet when pre-trained on ImageNet-21k.
Stable Diffusion (Stability AI, 2022)
860M parameters (UNet) + 123M (text encoder). Diffusion model with Transformer-based text encoder. Democratized image generation (open-source, runs on consumer GPUs).
Archaeological Finds
The Transformer has no physical artifacts—it is pure mathematics and code. However, archaeological evidence exists in digital archives: (1) The original paper (Vaswani et al., 2017) is hosted on arXiv (1706.03762) and cited 100,000+ times as of 2024, making it one of the most influential ML papers ever. (2) The tensor2tensor codebase (GitHub: tensorflow/tensor2tensor) contains the original TensorFlow implementation, still publicly accessible. (3) Hugging Face's Transformers library (GitHub: huggingface/transformers, launched 2018) has become the de facto standard interface; it hosts 1M+ pre-trained model checkpoints, creating a digital museum of Transformer variants. (4) Model weights for GPT-2, BERT, RoBERTa, T5, and others are archived in Hugging Face Model Hub, allowing researchers to inspect and reuse them. (5) Training logs, hyperparameters, and reproducibility details are documented in papers and on GitHub, enabling exact reconstruction. (6) The OpenAI API (launched 2020) provides access to GPT-3 and GPT-4 without releasing weights, creating a 'black box' artifact—the model exists but is not directly inspectable. (7) Leaked internal documents (e.g., Google's PaLM paper, 2022) and patent filings reveal proprietary Transformer variants and scaling laws. (8) The Chinchilla scaling laws (Hoffmann et al., 2022) and subsequent work (Kaplan et al., 2020) provide empirical evidence of how Transformer performance scales with model size, data, and compute—a digital 'fossil record' of the architecture's capabilities.
Comparison Panel
Transformer (2017–present)
Memory
O(n²) for sequence length n; quadratic in sequence length
Inference
Slow for long outputs (autoregressive); O(n) sequential steps, but each step is parallel
Scalability
Excellent; scales to 175B+ parameters with proper optimization
Training Speed
Fast; 3.5× faster than RNNs; scales to 10B+ parameters
Parallelization
Fully parallel; O(1) depth; all positions computed simultaneously
Long-Range Dependencies
Excellent; attention directly connects all pairs of positions
Convolutional Neural Network (CNN, 1998–2016)
Memory
O(n) for sequence length; fixed receptive field per layer
Inference
Fast; O(1) depth; but receptive field limits context
Scalability
Good for images; less natural for sequences
Training Speed
Fast; can train on GPUs efficiently
Parallelization
Parallel across space; O(log n) depth with stacking
Long-Range Dependencies
Limited receptive field; requires many layers to attend to distant positions
Recurrent Neural Network (RNN/LSTM, 1997–2017)
Memory
O(n) for sequence length n; hidden state must be carried forward
Inference
O(n) sequential steps; slow for long outputs
Scalability
Limited; difficult to train models >1B parameters
Training Speed
Slow; weeks to months for billion-parameter models
Parallelization
Sequential; O(n) depth; cannot parallelize across time steps
Long-Range Dependencies
Difficult; vanishing/exploding gradients over long sequences
Interesting Facts
The Transformer paper (Vaswani et al., 2017) was rejected by several conferences before acceptance at NeurIPS 2017; it is now the most-cited ML paper of the 2010s.
The original Transformer was trained on 8 NVIDIA P100 GPUs for 3.5 days; GPT-3 required ~1,000 V100 GPUs for ~300 days, a 100,000× increase in compute.
Positional encodings in the original Transformer use sine/cosine functions, not learned embeddings; this choice was motivated by the ability to extrapolate to longer sequences than seen during training.
Multi-head attention with h=8 heads is not optimal for all tasks; Vision Transformer uses h=12 or h=16; some models use h=1 (single-head attention).
The Transformer's O(n²) memory complexity limits sequence length; a 4096-token sequence requires 16M attention weights; a 1M-token sequence requires 1T weights (infeasible on consumer GPUs).
Layer normalization before (pre-norm) vs. after (post-norm) each sublayer significantly affects training stability; pre-norm is more stable for deep models but post-norm can achieve better final performance.
The feed-forward network (FFN) in each Transformer layer is the largest component by parameter count; in GPT-3, FFN accounts for ~2/3 of parameters, attention for ~1/3.
Causal masking in decoder self-attention prevents the model from attending to future tokens; this is essential for autoregressive generation but breaks bidirectionality (BERT uses no masking for bidirectional pretraining).
The Transformer's attention mechanism is a weighted average; it cannot perform true reasoning or logical operations, yet GPT-3 and GPT-4 exhibit surprising reasoning abilities through scaling.
Beam search (keeping top-k hypotheses) is slower than greedy decoding (sampling top-1) but produces higher-quality outputs; ChatGPT uses nucleus sampling (top-p) for diversity.
The Transformer was designed for machine translation but has become the default for nearly all sequence tasks: NLP, vision, speech, time-series, protein folding, drug discovery.
Scaling laws for Transformers (Kaplan et al., 2020; Hoffmann et al., 2022) show that loss scales as a power law: L(N,D) ∝ N^(-α) + D^(-β), enabling prediction of model performance before training.
The Transformer's success enabled the emergence of foundation models—large models pre-trained on diverse data and fine-tuned or prompted for downstream tasks—a paradigm shift from task-specific models.
Attention patterns learned by Transformers are often interpretable; researchers have found that attention heads learn to focus on syntactic dependencies, named entities, or semantic relationships.
The Transformer's quadratic memory complexity led to sparse attention variants (Longformer, BigBird, Linformer) that reduce complexity to O(n log n) or O(n), enabling longer sequences.
Vision Transformer (ViT) proved that Transformers are not inherently linguistic; they work on any tokenizable data, suggesting a universal architecture for learning from sequences.
Mixture of Experts Transformers (Switch Transformers, GLaM) use learned routing to activate only a subset of parameters per token, enabling trillion-parameter models with manageable compute.
The Transformer's emergence coincided with the rise of transfer learning in NLP; pre-training on large corpora and fine-tuning on small task-specific datasets became standard practice.
Prompt engineering—crafting inputs to elicit desired outputs from language models—emerged as a new skill; GPT-3's few-shot learning ability made prompts a form of programming.
The Transformer's success in language led to its adoption in other domains: AlphaFold 2 uses Transformer-like attention for protein structure prediction; Perceiver uses Transformers for multimodal learning.
Quotations
Text
Attention is all you need.
Attribution
Vaswani et al., title of the Transformer paper, 2017
Text
The dominant sequence transduction models are based on complex recurrent or convolutional neural networks in an encoder-decoder configuration. The best performing models also connect the encoder and decoder through an attention mechanism. We propose a new simple network architecture, the Transformer, based solely on attention mechanisms, dispensing with recurrence and convolutions entirely.
Attribution
Vaswani et al., 'Attention Is All You Need,' abstract, 2017
Text
The Transformer achieves 28.4 BLEU on WMT 2014 English-German, outperforcing all of the previously reported models including ensembles, while being significantly faster to train than any of the previous state-of-the-art models.
Attribution
Vaswani et al., 2017
Text
We believe the lack of recurrence might be offset by the multi-head attention mechanism, which we hypothesize expands the model's ability to attend to different representation subspaces.
Attribution
Vaswani et al., on why attention alone suffices, 2017
Text
Language models are unsupervised multitask learners.
Attribution
Radford et al., GPT-2 paper title, 2019
Text
We find that scaling up language models greatly improves task-agnostic, few-shot performance, sometimes even reaching competitiveness with prior state-of-the-art fine-tuned models.
Attribution
Brown et al., GPT-3 paper, 2020
Text
An image is worth 16x16 words: Transformers for image recognition at scale.
Attribution
Dosovitskiy et al., Vision Transformer paper title, 2020
Text
The Transformer architecture has become the de facto standard for natural language processing, and is increasingly being applied to other domains such as computer vision and speech processing.
Attribution
Devlin et al., BERT paper, 2018
Text
Scale is all you need.
Attribution
Paraphrase of Vaswani et al., reflecting the empirical finding that scaling Transformers improves performance across tasks, 2020s
Text
Transformers have democratized access to state-of-the-art NLP models, enabling researchers and practitioners without massive compute budgets to fine-tune and deploy models.
Attribution
Hugging Face team, on the impact of open-source Transformers, 2018–2024
Sources
Url
https://arxiv.org/abs/1706.03762
Note
The foundational Transformer paper; introduces multi-head self-attention, positional encoding, and encoder-decoder architecture.
Type
primary
Citation
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, Ł., & Polosukhin, I. (2017). Attention is all you need. *Advances in Neural Information Processing Systems* (NeurIPS), 30, 5998–6008.
Url
https://arxiv.org/abs/2005.14165
Note
GPT-3 paper; demonstrates in-context learning and scaling laws for Transformers.
Type
primary
Citation
Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J. D., Dhariwal, P., ... & Amodei, D. (2020). Language models are few-shot learners. *Advances in Neural Information Processing Systems* (NeurIPS), 33, 1877–1901.
Url
https://arxiv.org/abs/1810.04805
Note
BERT paper; applies Transformer to bidirectional pretraining via masked language modeling.
Type
primary
Citation
Devlin, J., Chang, M. W., Lee, K., & Toutanova, K. (2018). BERT: Pre-training of deep bidirectional transformers for language understanding. *arXiv preprint arXiv:1810.04805*.
Url
https://arxiv.org/abs/2010.11929
Note
Vision Transformer paper; applies Transformer to image patches, demonstrating universality of the architecture.
Type
primary
Citation
Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., ... & Houlsby, N. (2020). An image is worth 16x16 words: Transformers for image recognition at scale. *arXiv preprint arXiv:2010.11929*.
Url
https://arxiv.org/abs/2001.08361
Note
Empirical scaling laws for Transformers; power-law relationships between model size, data, compute, and performance.
Type
secondary
Citation
Kaplan, J., McCandlish, S., Henighan, T., Brown, T. B., Chess, B., Child, R., ... & Amodei, D. (2020). Scaling laws for neural language models. *arXiv preprint arXiv:2001.08361*.
Url
https://arxiv.org/abs/2203.15556
Note
Chinchilla scaling laws; optimal allocation of compute between model size and training data.
Type
secondary
Citation
Hoffmann, J., Borgeaud, S., Mensch, A., Buchatskaya, E., Cai, T., Rutherford, A., ... & Sifre, L. (2022). Training compute-optimal large language models. *arXiv preprint arXiv:2203.15556*.
Url
https://openai.com/research/language-unsupervised
Note
GPT paper; applies Transformer to autoregressive language modeling and demonstrates transfer learning.
Type
secondary
Citation
Radford, A., Narasimhan, K., Salimans, T., & Sutskever, I. (2018). Improving language understanding by generative pre-training. *OpenAI Blog*.
Url
https://arxiv.org/abs/2006.16668
Note
Mixture of Experts Transformers; sparse routing enables trillion-parameter models.
Type
secondary
Citation
Lepikhin, D., Lee, H., Xu, Y., Chen, D., Firat, O., Huang, Y., ... & Zhou, Y. (2020). GShard: Scaling giant models with conditional computation and automatic sharding. *arXiv preprint arXiv:2006.16668*.
Url
https://arxiv.org/abs/1409.0473
Note
Attention mechanism paper; precursor to Transformers; attention was originally used with RNNs.
Type
secondary
Citation
Bahdanau, D., Cho, K., & Bengio, Y. (2014). Neural machine translation by jointly learning to align and translate. *arXiv preprint arXiv:1409.0473*.
Url
https://doi.org/10.1162/neco.1997.9.8.1735
Note
LSTM paper; dominant sequence model before Transformers; addressed vanishing gradient problem in RNNs.
Type
secondary
Citation
Hochreiter, S., & Schmidhuber, J. (1997). Long short-term memory. *Neural Computation*, 9(8), 1735–1780.