ELMo (arXiv February; the authors' note says it was posted to OpenReview in October 2017), ULMFiT (January), GPT-1 (June) and BERT (October) all appeared in 2018. All four wrote the same sentence in different architectures, pretrain a language model on large text first and then adapt it to the task (ELMo by adding its representations with weights frozen, the other three by fine-tuning per task), and BERT cites GPT-1 in its reference list.
Scaling was measured. Hestness et al. (2017) found generalization error following a power law in data size; Kaplan et al. (2020) found loss following power laws in model size, data and compute; Hoffmann et al. (2022) found compute-optimal training scales model and tokens in equal proportion.
GPT-3 (May 2020) reported few-shot learning at 175 billion parameters, and InstructGPT (March 2022) reported that labelers preferred a 1.3-billion model aligned with human feedback to the 175-billion GPT-3. Between those two sentences stands chain-of-thought prompting (January 2022).
Pretraining and fine-tuning (2018)
In the first year after the Transformer of chapter 5, the use of language models changed. Howard and Ruder's ULMFiT (18 January 2018) fine-tuned a language model pretrained on a general corpus to target tasks with discriminative fine-tuning, slanted triangular learning rates and gradual unfreezing, cutting error by 18–24% on most of six classification datasets. ELMo (Peters et al.) (15 February 2018) is a contextualized word representation formed as a task-specific combination of all internal layers of a bidirectional LSTM language model. GPT-1 (Radford et al.) (11 June 2018, OpenAI report) trained a multilayer Transformer decoder on unlabeled text and fine-tuned it per task, improving the state of the art on 9 of 12 natural-language-understanding datasets. BERT (Devlin et al.) (11 October 2018) pretrained a Transformer encoder with a masked language model and next-sentence prediction and reported new state-of-the-art results on eleven tasks; its reference list cites GPT-1. The four differ in architecture, two LSTMs, one decoder, one encoder, but the first clause is the same: pretrain on large text first.
T5 (Raffel et al.) (23 October 2019) cast every text problem as text in, text out, compared pretraining objectives, architectures and datasets systematically, and released the C4 corpus. Retrieval-augmented generation (Lewis et al.) (22 May 2020) combined a pretrained generator with a retriever over a dense Wikipedia index and fine-tuned the pair end to end, one of the original texts for what the agents of chapter 7 come to call tools and memory.
Measuring scale
Hestness et al. (1 December 2017, Baidu) measured learning curves in translation, language modeling, images and speech and reported that generalization error falls as a power law in training-set size, with exponents (usually −0.07 to −0.35) that model changes barely move. Kaplan et al., "Scaling Laws for Neural Language Models" (23 January 2020) wrote that Transformer language-model loss follows power laws in model size, dataset size and compute, some trends spanning more than seven orders of magnitude, and derived that under a fixed compute budget it is efficient to train very large models and stop before convergence. Four months later GPT-3 (Brown et al.) (28 May 2020) trained a 175-billion-parameter model and evaluated it in few-shot settings where task and demonstrations are given only as text. Hoffmann et al., "Training Compute-Optimal Large Language Models" (29 March 2022) trained over 400 models and wrote that compute-optimal training scales model size and token count in equal proportion; Chinchilla, a 70-billion model trained on four times the data at the same compute, outperformed larger models. It revised Kaplan's conclusion. The Switch Transformer of Fedus, Zoph and Shazeer (11 January 2021; JMLR 2022) simplified the sparse mixture-of-experts routing of chapter 5 and pretrained a trillion-parameter model. PaLM (5 April 2022) trained a 540-billion-parameter dense model on 6,144 TPU v4 chips, and Wei et al., "Emergent Abilities" (15 June 2022) defined as emergent those abilities absent in smaller models and present in larger ones, which extrapolation cannot predict.
Eliciting reasoning
Chain-of-thought prompting (Wei et al.) (28 January 2022) reported that a few exemplars containing intermediate reasoning steps improve arithmetic, commonsense and symbolic reasoning. Self-consistency (Wang et al.) (21 March 2022) sampled several reasoning paths and chose the most consistent answer, adding 17.9 points on GSM8K, and Kojima et al. (24 May 2022) showed that the single sentence "Let's think step by step" enables zero-shot reasoning. The three papers change the prompt and the decoding, not the model's weights; ReAct in chapter 7 starts from exactly this point.
Alignment
Stiennon et al., "Learning to summarize from human feedback" (2 September 2020; NeurIPS 2020) carried the method of Christiano et al. (chapter 5) to language models, training a reward model on human comparisons of summaries and fine-tuning a summarization policy with PPO. InstructGPT (Ouyang et al.) (4 March 2022), which cites both that paper and Christiano 2017, fine-tuned GPT-3 with supervised learning on labeler demonstrations and then with reinforcement learning from human feedback on labeler rankings. One sentence of the result: labelers preferred the outputs of the 1.3-billion InstructGPT to those of the 175-billion GPT-3. It belongs to the problem Amodei et al. (chapter 5) called "scalable oversight". Bender et al., "On the Dangers of Stochastic Parrots" (3 March 2021, FAccT) asked how big is too big and recommended weighing environmental and financial costs and documenting data first. Bommasani et al., "On the Opportunities and Risks of Foundation Models" (16 August 2021, 214 pages) named models trained on broad data, generally with self-supervision at scale, and adapted to many downstream tasks "foundation models".
Beyond language
The Vision Transformer of Dosovitskiy et al. (22 October 2020; ICLR 2021) applied a standard Transformer directly to sequences of image patches and reported that, pretrained on large data, it matches or exceeds convolutional networks; CLIP (Radford et al.) (26 February 2021; ICML 2021) trained image and text encoders on 400 million internet image–text pairs to predict which caption goes with which image, and showed zero-shot transfer by naming visual concepts in natural language. These are the two original texts of the Transformer leaving language. AlphaFold (Jumper et al.) (15 July 2021, Nature) built knowledge of protein structure and multiple-sequence alignments into the network and reached accuracy competitive with experimental structures in a majority of CASP14 cases; the 2024 Nobel Prize in Chemistry citation points to it. Codex (Chen et al.) (7 July 2021) introduced a GPT fine-tuned on GitHub code and the HumanEval benchmark (28.8%, 70.2% with 100 samples), leading to SWE-bench in chapter 7. In games, AlphaZero (7 December 2018, Science) learned chess, shogi and Go with one algorithm, and MuZero (19 November 2019) planned with a learned model without even being given the rules. GPT-2 (OpenAI blog, 14 February 2019) reported a 1.5-billion model beginning to learn tasks zero-shot from WebText. The GPT-4 technical report (15 March 2023) reported a multimodal model with image and text input while stating that it gives no details of architecture, size, data or training method, and LLaMA (Touvron et al.) (27 February 2023) released 7- to 65-billion models trained on public data only, reporting that the 13-billion model outperforms GPT-3 on most benchmarks. The contrast between the two, a closed report and open weights, is the background of chapter 7.
What was and was not checked
All 29 papers were read. Only Bender et al. is quoted from the abstract as reconstructed by OpenAlex, without a page, because the publisher's page blocked automated access. arXiv papers were read in the latest downloaded version, in some cases a revision long after v1 (the card names the version). Candidates that did not pass the rule include World Models (2018), StyleGAN (2018), "The Bitter Lesson" (2019, a blog post), AlphaStar (2019), Pluribus (2019), DDPM (2020), score-based generation (2020), DALL·E (2021), LoRA (2021), S4 (2021), latent diffusion (2021), Constitutional AI (2022), Whisper (2022), DPO (2023) and Mamba (2023). Generative modeling and efficiency are under-represented, and we record that the two-textbook rule still works narrowly for work after 2020.
15 February 2018, arXiv v1. The arXiv comment says "originally posted to OpenReview 27 Oct 2017", but that record was not found, so v1 is used
Lineage
Solid lines are confirmed citations (OpenAlex or the citing paper's own reference list); dotted lines are influences stated in textbooks without a confirmed citation. Vertical position is the theme group.
Paper list (29)
Deep Learning Scaling is Predictable, Empirically
Joel Hestness, Sharan Narang, Newsha Ardalani, Gregory Diamos, Heewoo Jun, Hassan Kianinejad et al. · First public 2017-12-01 (arXiv v1) · Venue: arXiv:1712.00409 [cs.LG] (Baidu Research) · Pages 19 pp. (arXiv v1) · Citations (OpenAlex) 427 (checked 2026-11-03)
This paper presents a large scale empirical characterization of generalization error and model size growth as training sets grow.p. 1 (arXiv v1)
What changed. Measured learning curves in machine translation, language modeling, image classification and speech recognition and found that generalization error falls as a power law in training set size, with exponents (usually between -0.07 and -0.35) that model improvements shift in intercept but not in exponent. It also reported that model size grows sublinearly with data size.
Universal Language Model Fine-tuning for Text Classification
Jeremy Howard, Sebastian Ruder · First public 2018-01-18 (arXiv v1) · Venue: Proceedings of the 56th Annual Meeting of the ACL (Volume 1: Long Papers); arXiv:1801.06146 · Pages 12 pp. (arXiv v5) · Citations (OpenAlex) 4,036 (checked 2026-11-03)
We propose Universal Language Model Fine-tuning (ULMFiT), an effective transfer learning method that can be applied to any task in NLP, and introduce techniques that are key for fine-tuning a language model.p. 1 (arXiv v5)
What changed. The paper proposes ULMFiT, which pretrains a language model on a general-domain corpus and fine-tunes it on the target task using discriminative fine-tuning, slanted triangular learning rates and gradual unfreezing before training a classifier; it reports 18-24% error reductions on most of six text classification datasets.
Matthew E. Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee et al. · First public 2018-02-15 (arXiv v1) · Venue: Proceedings of NAACL-HLT 2018, Volume 1 (Long Papers); arXiv:1802.05365 · Pages 15 pp. (arXiv v2) · Citations (OpenAlex) 11,983 (checked 2026-11-03)
DOIarXiv · OpenReview (ICLR 2018 submission) 2017-10-27 per arXiv comment 'Originally posted to openreview 27 Oct 2017' (not independently verified); arXiv v2 2018-03-22; NAACL-HLT 2018 proceedings (June 2018), pp. 2227–2237 (Crossref 10.18653/v1/N18-1202)
We introduce a new type of deep contextualized word representation that models both (1) complex characteristics of word use (e.g., syntax and semantics), and (2) how these uses vary across linguistic contexts (i.e., to model polysemy).p. 1 (arXiv v2)
What changed. The paper introduces ELMo, word representations computed as a learned, task-specific linear combination of all internal layers of a bidirectional LSTM language model pre-trained on a large corpus; adding them to existing models improved results on six NLP tasks.
Improving Language Understanding by Generative Pre-Training
Radford · First public 2018-06-11 (tech report) · Venue: OpenAI technical report (unpublished preprint); the 2018 blog post linked it at s3-us-west-2.amazonaws.com/openai-assets/research-covers/language-unsupervised/language_understanding_paper.pdf · Pages 12 pp. (technical report PDF)
URL · Wayback capture of the blog post 2018-06-12; PDF metadata creationDate 2018-06-08 (file creation, not a public date)
We demonstrate that large gains on these tasks can be realized by generative pre-training of a language model on a diverse corpus of unlabeled text, followed by discriminative fine-tuning on each specific task.p. 1 (technical report PDF)
What changed. Trained a multi-layer Transformer decoder as a language model on unlabeled text and then fine-tuned it with task-aware input transformations on labeled tasks. The single task-agnostic model improved the state of the art on 9 of the 12 natural language understanding datasets studied.
We introduce a new language representation model called BERT, which stands for Bidirectional Encoder Representations from Transformers.p. 1 (arXiv v2)
What changed. The paper introduces BERT, a Transformer encoder pre-trained on unlabeled text with a masked language model objective and a next sentence prediction task so that representations condition on both left and right context; the pre-trained model is fine-tuned with one additional output layer and reports new state-of-the-art results on eleven NLP tasks.
A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez et al. · First public 2018-12-07 (journal issue) · Venue: Science 362(6419) · Pages 1140–1144 (journal); author manuscript 32 pp. · Citations (OpenAlex) 3,562 (checked 2026-11-03)
DOI · earlier preprint arXiv:1712.01815 v1 2017-12-05 (arXiv abstract page: [v1] Tue, 5 Dec 2017 18:45:38 UTC) under a different title, 'Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm'
In this paper, we generalize this approach into a single AlphaZero algorithm that can achieve superhuman performance in many challenging games.p. 1 (author manuscript)
What changed. The paper generalizes the AlphaGo Zero approach into a single algorithm, AlphaZero, that learns chess, shogi and Go by self-play reinforcement learning from random play given only the game rules, using a deep neural network and general-purpose Monte Carlo tree search; it defeated a world champion program in each of the three games.
Language Models are Unsupervised Multitask Learners
Radford · First public 2019-02-14 (tech report) · Venue: OpenAI technical report (not published in a journal or proceedings) · Pages 24 pp. (PDF, no printed page numbers)
URL · PDF creation date 2019-02-14; the blog post originally linked the PDF at d4mucfpksywv.cloudfront.net/better-language-models/
We demonstrate that language models begin to learn these tasks without any explicit supervision when trained on a new dataset of millions of webpages called WebText.PDF p. 1 (no printed page number)
What changed. The paper trains Transformer language models, the largest being the 1.5B-parameter GPT-2, on WebText, a new dataset of millions of webpages, and reports zero-shot performance on question answering, translation, reading comprehension and summarization without task-specific training, with performance improving log-linearly in model capacity.
Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer
Colin Raffel, Noam Shazeer, Roberts, Adam, Katherine Lee, Sharan Narang, Michael S Matena et al. · First public 2019-10-23 (arXiv v1) · Venue: Journal of Machine Learning Research 21(140) · Pages 1–67 · Citations (OpenAlex) 10,926 (checked 2026-11-03)
In this paper, we explore the landscape of transfer learning techniques for NLP by introducing a unified framework that converts all text-based language problems into a text-to-text format.p. 1 (arXiv v4, JMLR pagination)
What changed. Introduced a unified text-to-text framework that casts every text-based language problem as text in, text out, and used it to systematically compare pre-training objectives, architectures, unlabeled data sets and transfer approaches. Released the Colossal Clean Crawled Corpus (C4), the pre-trained models and code.
Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model
Julian Schrittwieser, Ioannis Antonoglou, Thomas Hubert, Karen Simonyan, Laurent Sifre, Simon Schmitt et al. · First public 2019-11-19 (arXiv v1) · Venue: arXiv preprint (cs.LG); later Nature 588(7839) · Pages 21 pp. (arXiv v2) · Citations (OpenAlex) 1,221 (checked 2026-11-03)
In this work we present the MuZero algorithm which, by combining a tree-based search with a learned model, achieves superhuman performance in a range of challenging and visually complex domains, without any knowledge of their underlying dynamics.p. 1 (arXiv v2)
What changed. Presented MuZero, which combines tree-based search with a learned model that predicts the reward, the action-selection policy and the value function. It set a new state of the art on 57 Atari games and matched AlphaZero on Go, chess and shogi without being given the game rules.
Jared Kaplan A, Sam McCandlish, Tom Henighan, Brown, Tom B., Benjamin Chess, Rewon Child et al. · First public 2020-01-23 (arXiv v1) · Venue: arXiv:2001.08361 [cs.LG] (preprint; single arXiv version) · Pages 30 pp. (arXiv v1) · Citations (OpenAlex) 1,749 (checked 2026-11-03)
The loss scales as a power-law with model size, dataset size, and the amount of compute used for training, with some trends spanning more than seven orders of magnitude.p. 1 (arXiv v1)
What changed. Measured how Transformer language-model cross-entropy loss depends on model size, dataset size and training compute, and fitted power laws to these trends. Used the fits to derive the allocation of a fixed compute budget, finding that compute-efficient training uses very large models stopped well before convergence.
Brown, Tom B., Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan A, Prafulla Dhariwal et al. · First public 2020-05-28 (arXiv v1) · Venue: arXiv preprint (cs.CL); later Advances in Neural Information Processing Systems 33 (NeurIPS 2020) · Pages 75 pp. (arXiv v4) · Citations (OpenAlex) 23,004 (checked 2026-11-03)
arXiv · arXiv v2 2020-06-01; arXiv v3 2020-06-05; arXiv v4 2020-07-22; NeurIPS 2020, Advances in Neural Information Processing Systems 33:1877-1901 (proceedings.neurips.cc)
Specifically, we train GPT-3, an autoregressive language model with 175 billion parameters, 10x more than any previous non-sparse language model, and test its performance in the few-shot setting.p. 1 (arXiv v4)
What changed. Trained GPT-3, a 175-billion-parameter autoregressive language model, and evaluated it on many NLP tasks in zero-, one- and few-shot settings where the task and demonstrations are given only as text, with no gradient updates or fine-tuning. The paper also reported limitations, a benchmark contamination analysis and broader societal impacts.
Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks
Patrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Naman Goyal et al. · First public 2020-05-22 (arXiv v1) · Venue: arXiv:2005.11401 [cs.CL]; published in Advances in Neural Information Processing Systems 33 (NeurIPS 2020) · Pages 19 pp. (arXiv v4) · Citations (OpenAlex) 3,048 (checked 2026-11-03)
arXiv · arXiv v2 Mon, 7 Dec 2020; v3 Mon, 29 Mar 2021; v4 Mon, 12 Apr 2021 (arXiv comment: Accepted at NeurIPS 2020); Advances in Neural Information Processing Systems 33 (NeurIPS 2020, Dec 2020; proceedings.neurips.cc abstract page)
We introduce RAG models where the parametric memory is a pre-trained seq2seq model and the non-parametric memory is a dense vector index of Wikipedia, accessed with a pre-trained neural retriever.p. 1 (arXiv v4)
What changed. Proposed retrieval-augmented generation (RAG): a pre-trained seq2seq generator combined with a pre-trained dense retriever over a Wikipedia index and fine-tuned end to end, in two variants (same retrieved passages for the whole sequence, or per token). It set the state of the art on three open-domain QA tasks in the authors' experiments.
Nisan Stiennon, Long Ouyang, Jeff Wu, Ziegler, Daniel M., Ryan Lowe, Chelsea Voss et al. · First public 2020-09-02 (arXiv v1) · Venue: Advances in Neural Information Processing Systems 33 (NeurIPS 2020) · Pages 45 pp. (arXiv v3) · Citations (OpenAlex) 550 (checked 2026-11-03)
arXiv · arXiv v2 2020-10-27; arXiv v3 2022-02-15 (version read); NeurIPS 2020 = Advances in Neural Information Processing Systems 33 (Dec 2020; proceedings.neurips.cc)
In this work, we show that it is possible to significantly improve summary quality by training a model to optimize for human preferences.p. 1 (arXiv v3)
What changed. Collects a dataset of human comparisons between summaries, trains a reward model to predict the human-preferred summary, and fine-tunes a summarization policy with reinforcement learning (PPO) against that reward model. Applies this to Reddit TL;DR and reports transfer to CNN/DM news articles without news-specific fine-tuning.
An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale
Alexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn, Xiaohua Zhai, Thomas Unterthiner et al. · First public 2020-10-22 (arXiv v1) · Venue: International Conference on Learning Representations (ICLR) 2021 · Pages 22 pp. (arXiv v2) · Citations (OpenAlex) 21,368 (checked 2026-11-03)
arXiv · arXiv v2 2021-06-03 (version read); ICLR 2021 conference paper (May 2021; PDF header 'Published as a conference paper at ICLR 2021'; listed at https://iclr.cc/virtual/2021/poster/3013)
We show that this reliance on CNNs is not necessary and a pure transformer applied directly to sequences of image patches can perform very well on image classification tasks.p. 1 (arXiv v2)
What changed. Applies a standard Transformer directly to sequences of linearly embedded image patches (Vision Transformer, ViT) for image classification, with minimal modifications. When pre-trained on large datasets and transferred to mid-sized or small benchmarks, ViT is reported to match or exceed convolutional networks with less training compute.
We simplify the MoE routing algorithm and design intuitive improved models with reduced communication and computational costs.p. 1 (arXiv v3)
What changed. Simplifies Mixture-of-Experts routing to the Switch Transformer, adds training techniques that allow large sparse models to be trained in bfloat16, and reports up to 7x pre-training speedups over T5-Base/T5-Large at equal compute. Pre-trains models up to a trillion parameters on the Colossal Clean Crawled Corpus.
Learning Transferable Visual Models From Natural Language Supervision
Alec Radford, Jong Wook Kim, Chris Hallacy, Ramesh, Aditya, Gabriel Goh, Sandhini Agarwal et al. · First public 2021-02-26 (arXiv v1) · Venue: Proceedings of the 38th International Conference on Machine Learning (ICML 2021), PMLR 139 · Pages 48 pp. (arXiv v1); PMLR 139:8748–8763 · Citations (OpenAlex) 15,291 (checked 2026-11-03)
arXiv · ICML 2021 = Proceedings of the 38th International Conference on Machine Learning, PMLR 139:8748–8763 (Jul 2021; proceedings.mlr.press/v139/radford21a.html)
We demonstrate that the simple pre-training task of predicting which caption goes with which image is an efficient and scalable way to learn SOTA image representations from scratch on a dataset of 400 million (image, text) pairs collected from the internet.p. 1 (arXiv v1)
What changed. Pre-trains image and text encoders on 400 million (image, text) pairs collected from the internet with the task of predicting which caption goes with which image (CLIP). Uses natural language to reference visual concepts for zero-shot transfer, benchmarked on over 30 existing computer vision datasets.
In this paper, we take a step back and ask: How big is too big?page unknown (abstract)
What changed. Asked what risks are associated with ever larger language models and what paths are available for mitigating them. Recommended weighing environmental and financial costs first, curating and documenting datasets, pre-development exercises tied to stakeholder values, and research directions beyond ever larger language models.
Mark I-Cheng Chen, Jerry Tworek, Heewoo Jun, Yuan, Qiming, Henrique Pondé de Oliveira Pinto, Jared Kaplan A et al. · First public 2021-07-07 (arXiv v1) · Venue: arXiv:2107.03374 [cs.LG] (OpenAI preprint) · Pages 35 pp. (arXiv v2) · Citations (OpenAlex) 1,436 (checked 2026-11-03)
We introduce Codex, a GPT language model fine-tuned on publicly available code from GitHub, and study its Python code-writing capabilities.p. 1 (arXiv v2)
What changed. Introduced Codex, a GPT model fine-tuned on public GitHub code, and the HumanEval benchmark measuring functional correctness of programs synthesized from docstrings. Codex solved 28.8% of HumanEval problems (GPT-3 0%), and 70.2% when 100 samples per problem were drawn.
Highly accurate protein structure prediction with AlphaFold
John Jumper, Richard Evans, Alexander Pritzel, Tim Green, Michael Figurnov, Olaf Ronneberger et al. · First public 2021-07-15 (journal (online publication)) · Venue: Nature 596(7873) · Pages 583–589 · Citations (OpenAlex) 43,764 (checked 2026-11-03)
DOI · Nature print issue 596(7873), 26 Aug 2021 (page header; Crossref published-print 2021-08-26)
Here we provide the first computational method that can regularly predict protein structures with atomic accuracy even in cases in which no similar structure is known.p. 583
What changed. Described an entirely redesigned version of the AlphaFold neural network that builds physical and biological knowledge about protein structure and multi-sequence alignments into the deep learning design. In CASP14 it predicted structures with accuracy competitive with experimental structures in a majority of cases.
On the Opportunities and Risks of Foundation Models
Rishi Bommasani, Drew A. Hudson, Ehsan Adeli, Russ Biagio Altman, Simran Arora, Sydney von Arx et al. · First public 2021-08-16 (arXiv v1) · Venue: arXiv:2108.07258 [cs.LG]; report of the Center for Research on Foundation Models (CRFM), Stanford Institute for Human-Centered Artificial Intelligence (HAI) · Pages 214 pp. (arXiv v3) · Citations (OpenAlex) 2,677 (checked 2026-11-03)
We call these models foundation models to underscore their critically central yet incomplete character.p. 1 (arXiv v3)
What changed. Introduced the term "foundation model" for models trained on broad data, generally with self-supervision at scale, that can be adapted to a wide range of downstream tasks. Surveyed their capabilities, technical principles, applications and societal impact, framing the shift through the concepts of emergence and homogenization.
Chain-of-Thought Prompting Elicits Reasoning in Large Language Models
Wei, Jason, Wang, Xuezhi, Dale Schuurmans, Maarten Bosma, Brian Ichter, Fei Xia et al. · First public 2022-01-28 (arXiv v1) · Venue: Advances in Neural Information Processing Systems 35 (NeurIPS 2022) · Pages 43 pp. (arXiv v6) · Citations (OpenAlex) 4,210 (checked 2026-11-03)
arXiv · arXiv v2 2022-04-06; v3 2022-06-01; v4 2022-06-13; v5 2022-10-10; v6 2023-01-10; NeurIPS 2022, Advances in Neural Information Processing Systems 35:24824-24837 (proceedings.neurips.cc, dated 2022-12-06)
We explore how generating a chain of thought—a series of intermediate reasoning steps—significantly improves the ability of large language models to perform complex reasoning.p. 1 (arXiv v6)
What changed. Introduced chain-of-thought prompting, in which a few exemplars containing intermediate reasoning steps are given in the prompt, and reported that it improves large language models on arithmetic, commonsense and symbolic reasoning tasks. With eight such exemplars, PaLM 540B reached state-of-the-art accuracy on GSM8K.
Jordan Hoffmann, Sebastian Borgeaud, Arthur Mensch, Elena Buchatskaya, Trevor Cai, Eliza Rutherford et al. · First public 2022-03-29 (arXiv v1) · Venue: arXiv preprint (cs.CL); later Advances in Neural Information Processing Systems 35 (NeurIPS 2022) · Pages 36 pp. (arXiv v1) · Citations (OpenAlex) 932 (checked 2026-11-03)
DOIarXiv · NeurIPS 2022, Advances in Neural Information Processing Systems 35:30016-30030, under the title "An empirical analysis of compute-optimal large language model training" (proceedings.neurips.cc, dated 2022-12-06)
By training over 400 language models ranging from 70 million to over 16 billion parameters on 5 to 500 billion tokens, we find that for compute-optimal training, the model size and the number of training tokens should be scaled equally: for every doubling of model size the number of training tokens should also be doubled.p. 1 (arXiv v1)
What changed. Estimated, from over 400 trained language models, how model size and number of training tokens should grow with a fixed compute budget, finding they should be scaled in equal proportions. Tested this with Chinchilla (70B parameters, 4x more data than Gopher at the same compute), which outperformed Gopher, GPT-3, Jurassic-1 and Megatron-Turing NLG on many downstream tasks.
Training language models to follow instructions with human feedback
Long Ouyang, Jeff Wu, Xu Jiang, Diogo Almeida, Carroll L. Wainwright, Pamela Mishkin et al. · First public 2022-03-04 (arXiv v1) · Venue: arXiv preprint (cs.CL); later Advances in Neural Information Processing Systems 35 (NeurIPS 2022) · Pages 68 pp. (arXiv v1) · Citations (OpenAlex) 4,208 (checked 2026-11-03)
arXiv · NeurIPS 2022, Advances in Neural Information Processing Systems 35:27730-27744 (proceedings.neurips.cc, dated 2022-12-06)
In this paper, we show an avenue for aligning language models with user intent on a wide range of tasks by fine-tuning with human feedback.p. 1 (arXiv v1)
What changed. Fine-tuned GPT-3 first with supervised learning on labeler demonstrations and then with reinforcement learning from human feedback on labeler rankings of outputs, producing InstructGPT. Labelers preferred outputs of the 1.3B InstructGPT model to those of the 175B GPT-3, with improvements in truthfulness and reductions in toxic output.
Self-Consistency Improves Chain of Thought Reasoning in Language Models
Xuezhi Wang, Wei, Jason, Dale Schuurmans, Quoc Viet Le, Ed H., Narang, Sharan et al. · First public 2022-03-21 (arXiv v1) · Venue: International Conference on Learning Representations (ICLR 2023) · Pages 24 pp. (arXiv v4) · Citations (OpenAlex) 809 (checked 2026-11-03)
arXiv · arXiv v2 2022-04-06 (added PaLM results); arXiv v3 2022-10-04 (added UL2 results); arXiv v4 2023-03-07 (ICLR camera-ready); ICLR 2023 (PDF header "Published as a conference paper at ICLR 2023"; arXiv comments)
In this paper, we propose a new decoding strategy, self-consistency, to replace the naive greedy decoding used in chain-of-thought prompting.p. 1 (arXiv v4)
What changed. Proposed self-consistency, a decoding strategy for chain-of-thought prompting that samples a diverse set of reasoning paths and selects the most consistent answer by marginalizing over them. Reported gains on arithmetic and commonsense benchmarks such as GSM8K (+17.9%) and SVAMP (+11.0%).
Aakanksha Chowdhery, Sharan Narang, Jacob Devlin, Maarten Bosma, Gaurav Mishra, Adam Roberts et al. · First public 2022-04-05 (arXiv v1) · Venue: arXiv:2204.02311 [cs.CL]; published in Journal of Machine Learning Research 24(240):1-113 (2023) · Pages 87 pp. (arXiv v5) · Citations (OpenAlex) 2,552 (checked 2026-11-03)
To further our understanding of the impact of scale on few-shot learning, we trained a 540-billion parameter, densely activated, Transformer language model, which we call Pathways Language Model (PaLM).p. 1 (arXiv v5)
What changed. Trained PaLM, a 540-billion-parameter dense Transformer language model, on 6144 TPU v4 chips using the Pathways system, and reported few-shot results on hundreds of language understanding, generation, reasoning, multilingual and code benchmarks. Also analyzed bias, toxicity and training-data memorization with respect to model scale.
Takeshi Kojima, Shixiang (Shane) Gu, Machel Reid, Yutaka Matsuo, Yusuke Iwasawa · First public 2022-05-24 (arXiv v1) · Venue: Advances in Neural Information Processing Systems 35 (NeurIPS 2022) · Pages 42 pp. (arXiv v4) · Citations (OpenAlex) 2,015 (checked 2026-11-03)
DOIarXiv · arXiv v2 2022-06-09; arXiv v3 2022-10-02; arXiv v4 2023-01-29; NeurIPS 2022, Advances in Neural Information Processing Systems 35:22199-22213 (proceedings.neurips.cc, dated 2022-12-06)
While these successes are often attributed to LLMs’ ability for few-shot learning, we show that LLMs are decent zero-shot reasoners by simply adding “Let’s think step by step” before each answer.p. 1 (arXiv v4)
What changed. Showed that adding the single prompt "Let's think step by step" before each answer (Zero-shot-CoT) raises the zero-shot accuracy of large language models on arithmetic, symbolic and other logical reasoning benchmarks without hand-crafted few-shot examples, e.g. MultiArith from 17.7% to 78.7% with text-davinci-002.
Wei, Jason, Yi Tay, Rishi Bommasani, Colin Raffel, Barret Zoph, Sebastian Borgeaud et al. · First public 2022-06-15 (arXiv v1) · Venue: arXiv:2206.07682 [cs.CL]; published in Transactions on Machine Learning Research (TMLR), 08/2022 · Pages 30 pp. (arXiv v2) · Citations (OpenAlex) 1,264 (checked 2026-11-03)
arXiv · arXiv v2 Wed, 26 Oct 2022 (comment: Transactions on Machine Learning Research (TMLR), 2022); PDF header: Published in Transactions on Machine Learning Research (08/2022), reviewed on OpenReview forum yzkSU5zdwD
We consider an ability to be emergent if it is not present in smaller models but is present in larger models.p. 1 (arXiv v2)
What changed. Defined emergent abilities of large language models as abilities absent in smaller models but present in larger ones, so that they cannot be predicted by extrapolating smaller-model performance. Surveyed such abilities reported in prior work in few-shot prompting and augmented prompting settings.
We introduce LLaMA, a collection of foundation language models ranging from 7B to 65B parameters.p. 1 (arXiv v1)
What changed. Released LLaMA, foundation language models from 7B to 65B parameters trained on trillions of tokens of publicly available data only, aiming at the best performance for a given inference budget. Reported that LLaMA-13B outperforms GPT-3 (175B) on most benchmarks and that LLaMA-65B is competitive with Chinchilla-70B and PaLM-540B.
OpenAI, Achiam, Josh, Adler, Steven, Agarwal, Sandhini, Ahmad, Lama, Akkaya, Ilge et al. · First public 2023-03-15 (arXiv v1) · Venue: arXiv:2303.08774 [cs.CL] (OpenAI technical report; the GPT-4 System Card is appended) · Pages 100 pp. (arXiv v6) · Citations (OpenAlex) 2,404 (checked 2026-11-03)
arXiv · arXiv v2 Thu, 16 Mar 2023; v3 Mon, 27 Mar 2023; v4 Tue, 19 Dec 2023; v5 Fri, 1 Mar 2024; v6 Mon, 4 Mar 2024 (comment: updated authors list; fixed author names and added citation)
We report the development of GPT-4, a large-scale, multimodal model which can accept image and text inputs and produce text outputs.p. 1 (arXiv v6)
What changed. Reported GPT-4, a Transformer-based multimodal model accepting image and text inputs, with exam and benchmark results and a post-training alignment process, and described infrastructure that allowed some aspects of its performance to be predicted from models trained with no more than 1/1,000th of its compute. The report states that it contains no further details about the architecture (including model size), hardware, training compute, dataset construction or training method.