AI History in Papers
한국어
Ch. 6 Pretraining and generation 2017–22

Pretraining and generative models (2017–2022)

Scale, self-supervision and alignment.

Key point

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.

Dates: the announced date and the original

WorkUsually quotedVerified first public date
GPT-1201811 June 2018, OpenAI blog post and report PDF (the post's title differs from the paper's)
GPT-2201914 February 2019, OpenAI blog post ("Better Language Models and Their Implications") and report PDF
GPT-3NeurIPS 202028 May 2020, arXiv v1
ChinchillaNeurIPS 202229 March 2022, arXiv v1; the NeurIPS version has a different title ("An empirical analysis of compute-optimal large language model training")
GPT-414 March 2023 (announcement)15 March 2023, arXiv v1 (the report)
ELMoNAACL 201815 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

Reinforcement learning and games Language and speech Vision and generative models Probability, statistics and origins Scale, alignment and safety 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025
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)

arXiv

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.

Cites (within this list): He et al. 2015, Luong et al. 2015, Sennrich et al. 2015
Cited by (within this list): Bommasani et al. 2021, Brown et al. 2020, Kaplan et al. 2020, OpenAI 2023, Radford et al. 2019, Radford et al. 2021, Raffel et al. 2019, Touvron et al. 2023

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)

DOI arXiv · arXiv v2 2018-05-14; v3 2018-05-15; v4 2018-05-17; v5 2018-05-23; ACL 2018 proceedings (July 2018), pp. 328–339 (Crossref 10.18653/v1/P18-1031, issued 2018)

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.

Cites (within this list): He et al. 2015, Ioffe & Szegedy 2015, Mikolov et al. 2013, Peters et al. 2018
Cited by (within this list): Bommasani et al. 2021, Brown et al. 2020, Devlin et al. 2018, Radford et al. 2018, Radford et al. 2019, Radford et al. 2021, Raffel et al. 2019

Deep contextualized word representations

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)

DOI arXiv · 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.

Cites (within this list): Ba et al. 2016, Collobert et al. 2011, Hochreiter & Schmidhuber 1995, Kingma & Ba 2014, Lafferty et al. 2001, Mikolov et al. 2013, Pennington et al. 2014, Srivastava et al. 2014
Cited by (within this list): Bender et al. 2021, Bommasani et al. 2021, Chen et al. 2021, Devlin et al. 2018, Howard & Ruder 2018, Radford et al. 2018, Radford et al. 2019, Radford et al. 2021, Raffel et al. 2019, Wei et al. 2022

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.

Cites (within this list): Ba et al. 2016, Bengio et al. 2006, Collobert et al. 2011, Hinton et al. 2006, Howard & Ruder 2018, Kingma & Ba 2014, Mikolov et al. 2013, Pennington et al. 2014, Peters et al. 2018, Sennrich et al. 2015, Vaswani et al. 2017
Cited by (within this list): Bommasani et al. 2021, Brown et al. 2020, Chen et al. 2021, Chowdhery et al. 2022, Devlin et al. 2018, Dosovitskiy et al. 2020, Fedus et al. 2021, Kaplan et al. 2020, Lewis et al. 2020, OpenAI 2023, Radford et al. 2019, Radford et al. 2021, Raffel et al. 2019, Stiennon et al. 2020, Touvron et al. 2023, Yao et al. 2023

BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding

Jacob Devlin, Ming-Wei Chang, Kenton Lee, Kristina Toutanova · First public 2018-10-11 (arXiv v1) · Venue: Proceedings of NAACL-HLT 2019, Volume 1 (Long and Short Papers); arXiv:1810.04805 · Pages 16 pp. (arXiv v2) · Citations (OpenAlex) 44,732 (checked 2026-11-03)

arXiv · arXiv v2 2019-05-24; NAACL-HLT 2019 proceedings (June 2019), pp. 4171–4186 (Crossref 10.18653/v1/N19-1423, issued 2019)

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.

Cites (within this list): Deng et al. 2009, Howard & Ruder 2018, Mikolov et al. 2013, Pennington et al. 2014, Peters et al. 2018, Radford et al. 2018, Vaswani et al. 2017, Wu et al. 2016
Cited by (within this list): Ahn et al. 2022, Bommasani et al. 2021, Brown et al. 2020, Chen et al. 2021, Chowdhery et al. 2022, Dosovitskiy et al. 2020, Fedus et al. 2021, Huang et al. 2022, Jumper et al. 2021, Kaplan et al. 2020, Kojima et al. 2022, Lewis et al. 2020, Liu et al. 2023, OpenAI 2023, Packer et al. 2023, Radford et al. 2019, Radford et al. 2021, Raffel et al. 2019, Schick et al. 2023, Touvron et al. 2023, Wei et al. 2022, Wei et al. 2022

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.

Cites (within this list): Campbell et al. 2002, Jouppi et al. 2017, Shannon 1949, Silver et al. 2016, Silver et al. 2017
Cited by (within this list): Ouyang et al. 2022, Schrittwieser et al. 2019

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.

Cites (within this list): Ba et al. 2016, Bengio et al. 2003, Collobert et al. 2011, Devlin et al. 2018, Hestness et al. 2017, Howard & Ruder 2018, Krizhevsky et al. 2012, Mikolov et al. 2013, Pennington et al. 2014, Peters et al. 2018, Radford et al. 2018, Sennrich et al. 2015, Sutskever et al. 2014, Vaswani et al. 2017
Cited by (within this list): Bender et al. 2021, Bommasani et al. 2021, Brown et al. 2020, Chen et al. 2021, DeepSeek-AI 2025, Dosovitskiy et al. 2020, Kaplan et al. 2020, Kojima et al. 2022, Lewis et al. 2020, OpenAI 2023, Ouyang et al. 2022, Radford et al. 2021, Raffel et al. 2019, Schick et al. 2023, Stiennon et al. 2020, Touvron et al. 2023, Wang et al. 2022, Wei et al. 2022, Yao et al. 2023

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)

arXiv · arXiv v2 2019-10-24; arXiv v3 2020-07-28; arXiv v4 2023-09-19; JMLR 21(140):1-67, 2020 (PDF header: Submitted 1/20; Revised 6/20; Published 6/20; jmlr.org/papers/v21/20-074.html)

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.

Cites (within this list): Ba et al. 2016, Bahdanau et al. 2014, Deng et al. 2009, Devlin et al. 2018, Graves 2013, He et al. 2015, Hestness et al. 2017, Hinton et al. 2015, Howard & Ruder 2018, Mikolov et al. 2013, Mikolov et al. 2013, Pennington et al. 2014, Peters et al. 2018, Radford et al. 2018, Radford et al. 2019, Sennrich et al. 2015, Shazeer et al. 2017, Srivastava et al. 2014, Sutskever et al. 2014, Vaswani et al. 2017, Wu et al. 2016
Cited by (within this list): Ahn et al. 2022, Bender et al. 2021, Bommasani et al. 2021, Brown et al. 2020, Chen et al. 2021, Chowdhery et al. 2022, Fedus et al. 2021, Hoffmann et al. 2022, Kaplan et al. 2020, Kojima et al. 2022, Lewis et al. 2020, OpenAI 2023, Radford et al. 2021, Stiennon et al. 2020, Touvron et al. 2023, Wang et al. 2023, Wei et al. 2022, Wei et al. 2022

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)

DOI arXiv · arXiv v2 2020-02-21; Nature 588(7839):604-609, published online 2020-12-23, print issue 2020-12-24 (Crossref 10.1038/s41586-020-03051-4)

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.

Cites (within this list): Campbell et al. 2002, Coulom 2006, Kocsis & Szepesvári 2006, Krizhevsky et al. 2012, Mnih et al. 2015, Silver et al. 2016, Silver et al. 2017, Silver et al. 2018, Sutton & Barto 1998
Cited by (within this list): none

Scaling Laws for Neural Language Models

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)

arXiv

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.

Cites (within this list): Devlin et al. 2018, Hestness et al. 2017, Kingma & Ba 2014, Krizhevsky et al. 2012, Radford et al. 2018, Radford et al. 2019, Raffel et al. 2019, Sennrich et al. 2015, Vaswani et al. 2017
Cited by (within this list): Bommasani et al. 2021, Brown et al. 2020, Chen et al. 2021, Chowdhery et al. 2022, DeepSeek-AI 2025, Fedus et al. 2021, Hoffmann et al. 2022, OpenAI 2023, Radford et al. 2021, Touvron et al. 2023, Wei et al. 2022, Wei et al. 2022

Language Models are Few-Shot Learners

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.

Cites (within this list): Devlin et al. 2018, Hestness et al. 2017, Hinton et al. 2015, Howard & Ruder 2018, Kaplan et al. 2020, Lewis et al. 2020, Mikolov et al. 2013, Pennington et al. 2014, Radford et al. 2018, Radford et al. 2019, Raffel et al. 2019, Shazeer et al. 2017, Vaswani et al. 2017
Cited by (within this list): Ahn et al. 2022, Bender et al. 2021, Bommasani et al. 2021, Chen et al. 2021, Chowdhery et al. 2022, DeepSeek-AI 2025, Dosovitskiy et al. 2020, Fedus et al. 2021, Greshake et al. 2023, Hoffmann et al. 2022, Huang et al. 2022, Kojima et al. 2022, Liu et al. 2023, Mialon et al. 2023, Nakano et al. 2021, OpenAI 2023, Ouyang et al. 2022, Packer et al. 2023, Park et al. 2023, Radford et al. 2021, Schick et al. 2023, Shen et al. 2023, Stiennon et al. 2020, Touvron et al. 2023, Wang et al. 2022, Wang et al. 2023, Wei et al. 2022, Wei et al. 2022, Yao et al. 2022, Yao et al. 2023

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.

Cites (within this list): Devlin et al. 2018, Kingma & Ba 2014, Radford et al. 2018, Radford et al. 2019, Raffel et al. 2019, Vaswani et al. 2017, Weston et al. 2014
Cited by (within this list): Bommasani et al. 2021, Brown et al. 2020, Hoffmann et al. 2022, Nakano et al. 2021, Packer et al. 2023, Yao et al. 2022

Learning to summarize from human feedback

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.

Cites (within this list): Brown et al. 2020, Christiano et al. 2017, Glorot & Bengio 2010, Kingma & Ba 2014, Radford et al. 2018, Radford et al. 2019, Raffel et al. 2019, Schulman et al. 2017, Vaswani et al. 2017, Wu et al. 2016
Cited by (within this list): Bommasani et al. 2021, Chen et al. 2021, Nakano et al. 2021, Ouyang et al. 2022

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.

Cites (within this list): Brown et al. 2020, Deng et al. 2009, Devlin et al. 2018, He et al. 2015, Ioffe & Szegedy 2015, Kingma & Ba 2014, Krizhevsky et al. 2012, LeCun et al. 1989, Radford et al. 2018, Radford et al. 2019, Vaswani et al. 2017
Cited by (within this list): Bommasani et al. 2021, Radford et al. 2021, Shen et al. 2023

Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity

William Fedus, Barret Zoph, Noam Shazeer · First public 2021-01-11 (arXiv v1) · Venue: Journal of Machine Learning Research 23(120) · Pages 1–40 (printed header; 40 pp., arXiv v3) · Citations (OpenAlex) 988 (checked 2026-11-03)

arXiv · arXiv v2 2022-04-30; arXiv v3 2022-06-16 (version read); JMLR 23(120), 2022 (printed header: Submitted 8/21; Revised 3/22; Published 4/22; jmlr.org/papers/v23/21-0998.html)

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.

Cites (within this list): Brown et al. 2020, Devlin et al. 2018, Hinton et al. 2015, Hochreiter & Schmidhuber 1995, Jacobs et al. 1991, Kaplan et al. 2020, Radford et al. 2018, Raffel et al. 2019, Shazeer et al. 2017, Srivastava et al. 2014, Sutton & Barto 1998, Vaswani et al. 2017
Cited by (within this list): Bender et al. 2021, Bommasani et al. 2021, Chowdhery et al. 2022, Hoffmann et al. 2022, Ouyang et al. 2022, Wei et al. 2022

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.

Cites (within this list): Bengio et al. 2003, Blei et al. 2003, Brown et al. 2020, Deng et al. 2009, Devlin et al. 2018, Dosovitskiy et al. 2020, He et al. 2015, Hestness et al. 2017, Howard & Ruder 2018, Ioffe & Szegedy 2015, Kaplan et al. 2020, Kingma & Ba 2014, Krizhevsky et al. 2012, Mikolov et al. 2013, Pennington et al. 2014, Peters et al. 2018, Radford et al. 2018, Radford et al. 2019, Raffel et al. 2019, Sennrich et al. 2015, Vaswani et al. 2017
Cited by (within this list): Ahn et al. 2022, Bommasani et al. 2021, Chen et al. 2021, Huang et al. 2022

On the Dangers of Stochastic Parrots: Can Language Models Be Too Big?

Emily M. Bender, Timnit Gebru, Angelina McMillan-Major, Shmargaret Shmitchell · First public 2021-03-03 (conference) · Venue: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency (FAccT '21), ACM · Pages 610–623 · Citations (OpenAlex) 6,988 (checked 2026-11-03)

DOI

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.

Cites (within this list): Brown et al. 2020, Fedus et al. 2021, Hinton et al. 2015, Mikolov et al. 2013, Pennington et al. 2014, Peters et al. 2018, Radford et al. 2019, Raffel et al. 2019, Vaswani et al. 2017
Cited by (within this list): Ahn et al. 2022, Bommasani et al. 2021, Chen et al. 2021, Chowdhery et al. 2022, Greshake et al. 2023, Hoffmann et al. 2022, OpenAI 2023, Ouyang et al. 2022, Wei et al. 2022

Evaluating Large Language Models Trained on Code

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)

arXiv · arXiv v2 Wed, 14 Jul 2021 (comment: corrected typos, added references, added authors, added acknowledgements)

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.

Cites (within this list): Bender et al. 2021, Brown et al. 2020, Devlin et al. 2018, Graves 2013, Graves et al. 2014, Kaplan et al. 2020, Mikolov et al. 2013, Peters et al. 2018, Radford et al. 2018, Radford et al. 2019, Radford et al. 2021, Raffel et al. 2019, Stiennon et al. 2020, Sutskever et al. 2014, van den Oord et al. 2016, Vaswani et al. 2017
Cited by (within this list): Bommasani et al. 2021, Chowdhery et al. 2022, DeepSeek-AI 2025, Hong et al. 2023, Huang et al. 2022, Jimenez et al. 2023, Kapoor et al. 2024, Liu et al. 2023, OpenAI 2023, Ouyang et al. 2022, Shinn et al. 2023, Touvron et al. 2023, Wang et al. 2022, Wang et al. 2023, Wei et al. 2022, Yang et al. 2024, Yao et al. 2024, Zhou et al. 2023

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.

Cites (within this list): Devlin et al. 2018, He et al. 2015, Vaswani et al. 2017
Cited by (within this list): none

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)

arXiv · arXiv v2 Wed, 18 Aug 2021; v3 Tue, 12 Jul 2022

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.

Cites (within this list): Amodei et al. 2016, Bahdanau et al. 2014, Bender et al. 2021, Brown et al. 2020, Chen et al. 2021, Deng et al. 2009, Devlin et al. 2018, Dosovitskiy et al. 2020, Fedus et al. 2021, Girshick et al. 2013, Glorot & Bengio 2010, Goodfellow et al. 2014, Graves et al. 2014, He et al. 2015, Hestness et al. 2017, Hinton et al. 2006, Hinton et al. 2015, Hochreiter & Schmidhuber 1995, Howard & Ruder 2018, Jouppi et al. 2017, Kaplan et al. 2020, Kingma & Welling 2013, Krizhevsky et al. 2012, LeCun et al. 2015, Lewis et al. 2020, Marr 1982, Mikolov et al. 2010, Mikolov et al. 2013, Nair & Hinton 2010, Pennington et al. 2014, Peters et al. 2018, Radford et al. 2018, Radford et al. 2019, Radford et al. 2021, Raffel et al. 2019, Russell & Norvig 1995, Sennrich et al. 2015, Shannon 1948, Shazeer et al. 2017, Silver et al. 2016, Simonyan & Zisserman 2014, Sohl-Dickstein et al. 2015, Stiennon et al. 2020, Szegedy et al. 2013, Szegedy et al. 2014, Turing 1950, van den Oord et al. 2016, Vaswani et al. 2017, Weston et al. 2014
Cited by (within this list): Ahn et al. 2022, Chowdhery et al. 2022, Greshake et al. 2023, OpenAI 2023, Ouyang et al. 2022, Park et al. 2023, Wang et al. 2023, Wei et al. 2022

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.

Cites (within this list): Ahn et al. 2022, Brown et al. 2020, Chen et al. 2021, Devlin et al. 2018, Graves et al. 2014, Hochreiter & Schmidhuber 1995, Kaplan et al. 2020, Ouyang et al. 2022, Peters et al. 2018, Raffel et al. 2019, Vaswani et al. 2017, Wang et al. 2022, Wei et al. 2022
Cited by (within this list): Ahn et al. 2022, Chowdhery et al. 2022, DeepSeek-AI 2025, Greshake et al. 2023, Hong et al. 2023, Huang et al. 2022, Kojima et al. 2022, Liu et al. 2023, OpenAI 2023, Packer et al. 2023, Park et al. 2023, Shen et al. 2023, Shinn et al. 2023, Wang et al. 2022, Wang et al. 2023, Wei et al. 2022, Yao et al. 2022, Yao et al. 2023, Zhou et al. 2023

Training Compute-Optimal Large Language Models

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)

DOI arXiv · 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.

Cites (within this list): Bender et al. 2021, Brown et al. 2020, Fedus et al. 2021, Jouppi et al. 2017, Kaplan et al. 2020, Kingma & Ba 2014, Lewis et al. 2020, Raffel et al. 2019, Vaswani et al. 2017
Cited by (within this list): Chowdhery et al. 2022, Liu et al. 2023, OpenAI 2023, Touvron et al. 2023, Wei et al. 2022

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.

Cites (within this list): Bender et al. 2021, Bommasani et al. 2021, Brown et al. 2020, Chen et al. 2021, Christiano et al. 2017, Fedus et al. 2021, Nakano et al. 2021, Radford et al. 2019, Schulman et al. 2017, Silver et al. 2018, Stiennon et al. 2020
Cited by (within this list): Ahn et al. 2022, Chowdhery et al. 2022, DeepSeek-AI 2025, Greshake et al. 2023, Huang et al. 2022, Kojima et al. 2022, Liu et al. 2023, Mialon et al. 2023, OpenAI 2023, Packer et al. 2023, Park et al. 2023, Shen et al. 2023, Touvron et al. 2023, Wei et al. 2022, Wei et al. 2022, Zhou et al. 2023

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%).

Cites (within this list): Ackley et al. 1985, Brown et al. 2020, Chen et al. 2021, Chowdhery et al. 2022, Kojima et al. 2022, Radford et al. 2019, Wei et al. 2022
Cited by (within this list): DeepSeek-AI 2025, Hong et al. 2023, Kojima et al. 2022, Liu et al. 2023, Shen et al. 2023, Touvron et al. 2023, Wei et al. 2022, Wei et al. 2022, Yao et al. 2022, Yao et al. 2023

PaLM: Scaling Language Modeling with Pathways

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)

arXiv · arXiv v2 Thu, 7 Apr 2022; v3 Tue, 19 Apr 2022; v4 Thu, 29 Sep 2022; v5 Wed, 5 Oct 2022; Journal of Machine Learning Research 24(240):1-113, 2023 (jmlr.org/papers/v24/22-1144.html)

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.

Cites (within this list): Bender et al. 2021, Bommasani et al. 2021, Brown et al. 2020, Chen et al. 2021, Devlin et al. 2018, Fedus et al. 2021, Hoffmann et al. 2022, Kaplan et al. 2020, Kingma & Ba 2014, Ouyang et al. 2022, Radford et al. 2018, Raffel et al. 2019, Shazeer et al. 2017, Vaswani et al. 2017, Wei et al. 2022
Cited by (within this list): Ahn et al. 2022, Hong et al. 2023, Huang et al. 2022, Kojima et al. 2022, Liu et al. 2023, OpenAI 2023, Schick et al. 2023, Shen et al. 2023, Touvron et al. 2023, Wang et al. 2022, Wang et al. 2023, Wei et al. 2022, Yao et al. 2022, Yao et al. 2023

Large Language Models are Zero-Shot Reasoners

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)

DOI arXiv · 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.

Cites (within this list): Ahn et al. 2022, Brown et al. 2020, Chowdhery et al. 2022, Devlin et al. 2018, Ouyang et al. 2022, Radford et al. 2019, Raffel et al. 2019, Vaswani et al. 2017, Wang et al. 2022, Wei et al. 2022
Cited by (within this list): DeepSeek-AI 2025, Huang et al. 2022, OpenAI 2023, Shen et al. 2023, Wang et al. 2022, Wei et al. 2022, Yao et al. 2022

Emergent Abilities of Large Language Models

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.

Cites (within this list): Ahn et al. 2022, Bender et al. 2021, Bommasani et al. 2021, Brown et al. 2020, Chowdhery et al. 2022, Devlin et al. 2018, Fedus et al. 2021, Hoffmann et al. 2022, Kaplan et al. 2020, Kojima et al. 2022, Ouyang et al. 2022, Radford et al. 2019, Raffel et al. 2019, Wang et al. 2022, Wei et al. 2022
Cited by (within this list): DeepSeek-AI 2025, OpenAI 2023, Schick et al. 2023, Shen et al. 2023, Touvron et al. 2023, Wang et al. 2023, Wei et al. 2022

LLaMA: Open and Efficient Foundation Language Models

Hugo Touvron, Thibaut Lavril, Gautier Izacard, Xavier Martinet, Marie-Anne Lachaux, Timothée Lacroix et al. · First public 2023-02-27 (arXiv v1) · Venue: arXiv:2302.13971 [cs.CL] (Meta AI preprint; single arXiv version) · Pages 27 pp. (arXiv v1) · Citations (OpenAlex) 4,527 (checked 2026-11-03)

arXiv

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.

Cites (within this list): Bengio et al. 2003, Brown et al. 1990, Brown et al. 2020, Chen et al. 2021, Chowdhery et al. 2022, Devlin et al. 2018, Elman 1988, Graves 2013, Hestness et al. 2017, Hochreiter & Schmidhuber 1995, Hoffmann et al. 2022, Kaplan et al. 2020, Mikolov et al. 2010, Ouyang et al. 2022, Radford et al. 2018, Radford et al. 2019, Raffel et al. 2019, Sennrich et al. 2015, Shannon 1948, Turing 1950, Vaswani et al. 2017, Wang et al. 2022, Wei et al. 2022
Cited by (within this list): OpenAI 2023, Shen et al. 2023, Wang et al. 2023, Yao et al. 2023

GPT-4 Technical Report

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.

Cites (within this list): Ba et al. 2016, Bender et al. 2021, Bommasani et al. 2021, Brown et al. 2020, Chen et al. 2021, Chowdhery et al. 2022, Christiano et al. 2017, Devlin et al. 2018, Hestness et al. 2017, Hoffmann et al. 2022, Kaplan et al. 2020, Kojima et al. 2022, Ouyang et al. 2022, Radford et al. 2018, Radford et al. 2019, Raffel et al. 2019, Schick et al. 2023, Schulman et al. 2017, Shazeer et al. 2017, Touvron et al. 2023, Vaswani et al. 2017, Wei et al. 2022, Wei et al. 2022
Cited by (within this list): DeepSeek-AI 2025, Greshake et al. 2023, Hong et al. 2023, Liu et al. 2023, Mialon et al. 2023, Shen et al. 2023, Shinn et al. 2023, Wang et al. 2023, Xie et al. 2024, Yang et al. 2024, Yao et al. 2023, Zhou et al. 2023