Language Models are Unsupervised Multitask Learners
Language Models are Unsupervised Multitask Learners
Metadata
- Slug:
gpt2_2019 - Year: 2019
- Venue: OpenAI technical report
- Authors: Alec Radford et al.
- Reading status: read complete
- Compute regime: Hyperscale dense LLM training
- Primary sources: PDF, extracted text
Compute Setup
The extracted paper text does not list exact training hardware, accelerator type, cluster size, wall-clock training time, or power. It thanks "Googlers who helped us with training infrastructure," but it does not name GPUs, TPUs, or a specific system. Under the project rule, the device context can only be inferred as late-2018/early-2019 large datacenter accelerator training; no exact chip should be claimed from this source.
The compute scale is nevertheless explicit in model and data terms. WebText is built by scraping the text subset of 45 million outbound Reddit links with at least 3 karma, then deduplicating and cleaning to slightly over 8 million documents and about 40GB of text. Four Transformer language models are trained: 117M parameters with 12 layers and d_model 768; 345M with 24 layers and d_model 1024; 762M with 36 layers and d_model 1280; and 1542M with 48 layers and d_model 1600. The vocabulary is 50,257 byte-level BPE tokens, context size is increased from 512 to 1024 tokens, and batch size is 512.
Bottleneck
The paper frames the main bottleneck as task/data construction rather than only hardware throughput. Prior NLP systems typically use separate supervised datasets and task-specific training runs. GPT-2 asks whether a sufficiently large language model trained on broad web text can infer task behavior from natural-language context without gradient updates.
Compute still binds the result. The paper states that all models still underfit WebText, which is a direct sign that the training run had not exhausted the data/model capacity frontier. Scaling improves many tasks with model size, and the experiments "continue into the 1B+ parameter regime." Dense decoder-only Transformers also carry a clear device budget: self-attention scales with context length, MLPs scale with width and depth, and batch size 512 implies substantial accelerator memory and data-parallel throughput. At inference time, the 1024-token context is both a capability and a budget, because examples, documents, dialogue history, and prompts must all fit in one forward-pass window.
Method Adaptation
GPT-2 adapts the Transformer LM to broad multitask use by removing task-specific interfaces. It trains one autoregressive byte-level BPE language model on WebText and evaluates it in zero-shot form. Task descriptions and examples are expressed as text in the context rather than as separate heads, labels, or fine-tuning procedures. This converts many NLP tasks into next-token prediction workloads.
The model design is also stability-oriented for scale. It largely follows GPT but moves layer normalization to the input of each sub-block, adds a final layer normalization, scales residual-layer initialization by 1/sqrt(N) for N residual layers, increases the context to 1024, and uses the larger batch size of 512. Byte-level BPE keeps the model able to represent arbitrary strings without a huge Unicode base vocabulary, while avoiding the poor compression of raw bytes. The data pipeline is part of the compute method: rather than train on all of Common Crawl, the paper filters through human-curated Reddit links to improve text quality per token processed.
Evidence
The central benchmark evidence is zero-shot transfer. GPT-2 improves state of the art on 7 of 8 tested language-modeling datasets without training or fine-tuning on those datasets. On LAMBADA, perplexity improves from the prior 99.8 result to 8.63 for the 1542M model; the paper also reports language-model accuracy rising from 19% to 52.66%, and a stop-word-filtered variant reaching 63.24%. On CBT, GPT-2 reaches 93.30% on common nouns and 89.05% on named entities in the table.
For reading comprehension, greedy decoding on CoQA reaches 55 F1 on the development set without using the 127,000+ manually collected question-answer pairs that supervised baselines used. For translation, GPT-2 performs poorly from English to French at 5 BLEU but reaches 11.5 BLEU from French to English, despite the WebText filtering step intentionally removing non-English webpages and leaving only about 10MB of detected French. For Natural Questions, GPT-2 answers 4.1% exactly, 5.3 times the simple question-type baseline, and its most confident 1% of answers reach 63.1% accuracy.
These results are uneven, but their compute implication is strong: scaling a single dense LM and feeding tasks through context can buy many behaviors that previously required separate training jobs.
Historical Effect
GPT-2 is the bridge from Transformer language modeling to the later scaling-law and few-shot LLM era. Its historical contribution is not a new accelerator kernel; it is the claim that broad pretraining plus parameter scale converts task diversity into a data-and-compute problem. The absence of exact hardware detail is itself notable: the paper reports model/data scale and benchmark behavior, while the training infrastructure remains outside the card's source-supported facts.
Limits
Exact hardware, training time, cluster size, and energy are not listed. The largest model still underfits WebText, so results are not at a compute-saturated optimum. Zero-shot performance remains far from usable on many tasks, especially summarization, translation, and open-domain QA. The 1024-token context limits in-context task specification, and evaluation raises contamination concerns that the paper addresses through overlap analysis but cannot eliminate completely.
Links
- Parent regime: compute spine
- Later linked card: GPT-3 2020
- Method index: transformer, scaling_laws
- Ledger updates: compute bottlenecks