AI History in Papers
한국어
Ch. 5 Deep learning 2012–17

Deep learning (2012–2017)

Deep networks, GPUs and large datasets arrive together.

Key point

2012

Krizhevsky, Sutskever and Hinton, "ImageNet Classification with Deep Convolutional Neural Networks" was presented at NIPS in December 2012: a network of five convolutional and three fully connected layers, 60 million parameters, trained with non-saturating neurons, a GPU convolution implementation and dropout, reaching 17.0% top-5 error on the LSVRC-2010 test set and, as an ensemble, 15.3% in ILSVRC-2012. A month earlier, in the November IEEE Signal Processing Magazine, "Deep Neural Networks for Acoustic Modeling in Speech Recognition" gave the shared view of four groups (Toronto, MSR, Google, IBM) that DNN acoustic models beat GMM-HMMs on TIMIT and five large-vocabulary tasks. Cireşan et al.'s multi-column deep networks (arXiv v1 13 February 2012; CVPR 2012) and Le et al.'s large-scale unsupervised feature learning (arXiv v1 29 December 2011; ICML 2012) belong to the same months; the latter reported units responding to faces learned from 10 million unlabeled images. It is the year in which chapter 4's conditions — ImageNet, GPU training, rectified units, layer-wise initialization — came together.

Learning representations (2013–2014)

word2vec (Mikolov et al.) (arXiv v1, 16 January 2013) proposed CBOW and skip-gram for learning word vectors from very large corpora at low cost; the follow-up paper of October added negative sampling and phrase vectors. GloVe (Pennington, Socher and Manning) (October 2014, EMNLP) did the same from a co-occurrence matrix. These three carried the distributed representations of Bengio 2003 (chapter 4) into practice. Graves's sequence generation (4 August 2013) showed an LSTM synthesizing handwriting by predicting one data point at a time, and the Neural Turing Machine of Graves, Wayne and Danihelka (20 October 2014) coupled a network to external memory through attention, and five days earlier the memory networks of Weston, Chopra and Bordes (15 October 2014) combined a readable and writable long-term memory with inference components for question answering. The two are the original texts of the memory strand in chapter 7.

In vision, R-CNN (arXiv v1, 11 November 2013; CVPR 2014) applied CNNs to region proposals and changed detection; VGG (4 September 2014) and GoogLeNet (17 September 2014) pushed depth to 16–22 layers. Szegedy et al., "Intriguing properties of neural networks" (21 December 2013) showed that hardly perceptible perturbations can make a network misclassify, opening the study of adversarial examples. On the training side, dropout (June 2014, JMLR), Adam (22 December 2014), batch normalization (11 February 2015) and layer normalization (21 July 2016) became handles that later networks widely use.

Three generative models

The variational autoencoder of Kingma and Welling (20 December 2013), the generative adversarial network of Goodfellow et al. (10 June 2014) and the diffusion model of Sohl-Dickstein et al. (12 March 2015) appeared within two years. They solve the same problem by different routes, training a model that produces new samples from the data distribution by gradient methods: the GAN as a minimax game between generator and discriminator, the VAE by reparameterizing a variational bound, diffusion by learning the reverse of a forward process that slowly destroys structure. DCGAN (19 November 2015) and WaveNet (12 September 2016) continued those routes for images and raw audio.

From translation to attention

The RNN encoder–decoder of Cho et al. (3 June 2014) and seq2seq (Sutskever, Vinyals and Le) (10 September 2014) set up the frame in which one RNN puts a sentence into a vector and another takes it out. Bahdanau, Cho and Bengio (1 September 2014) treated that fixed-length vector as a bottleneck and proposed an extension that, for each target word, softly searches the source for relevant positions, learning "to align and translate jointly": this mechanism is attention. Luong et al. (17 August 2015) refined it into global and local attention; the subword units of Sennrich et al. (31 August 2015) solved the rare-word problem with byte-pair encoding; Google's GNMT (26 September 2016) bundled all of it into an 8-layer LSTM production system. Then Vaswani et al., "Attention Is All You Need" (arXiv v1, 12 June 2017; NIPS 2017) removed recurrence altogether: 28.4 BLEU English–German, 41.8 BLEU English–French. The language models of chapter 6 stand on this architecture.

Deep reinforcement learning

Mnih et al., "Playing Atari with Deep Reinforcement Learning" (19 December 2013) trained a convolutional network with a variant of Q-learning to play seven games from raw pixels; the Nature version (25 February 2015) added a periodically updated target network to the experience replay already in the 2013 paper and reported a level comparable to a professional games tester on most of 49 games. Both cite TD-Gammon from chapter 4; the Nature paper's reference list does not include the 2013 preprint. TRPO (19 February 2015) and DDPG (9 September 2015) extended policy gradients to continuous actions and large networks; A3C (Mnih et al.) (4 February 2016) ran several actor-learners asynchronously instead of using experience replay and exceeded the Atari state of the art on a single multicore CPU. PPO (Schulman et al.) (20 July 2017) simplified TRPO with a surrogate objective of clipped probability ratios, the algorithm later used by reinforcement learning from human feedback in chapter 6. Christiano et al., "Deep reinforcement learning from human preferences" (12 June 2017) learned a reward model from human preferences between pairs of trajectory segments and trained a policy on it, learning Atari and MuJoCo tasks without the true reward; its references cite Amodei et al. 2016 and DQN, and it is the direct forerunner of InstructGPT in chapter 6. AlphaGo (Silver et al.) (Nature online, 27 January 2016) combined a supervised policy network, a reinforcement-learned policy network and a value network with the Monte Carlo tree search of chapter 4 and beat the European champion 5–0; AlphaGo Zero (19 October 2017) beat that AlphaGo 100–0 trained by self-play alone, without human games. The AlphaGo paper cites Sutton 1988 and Sutton 1999.

At the edges

Residual learning (He et al.) (10 December 2015) let layers learn residuals with respect to their inputs, trained 152 layers and won ILSVRC 2015 with an ensemble's 3.57% top-5 ImageNet error; the box on the priority of residual connections follows. Distillation (9 March 2015) trains a small model from the knowledge of a large one. The Nature review of LeCun, Bengio and Hinton (27 May 2015) and Schmidhuber's Neural Networks overview (arXiv v1 30 April 2014; January 2015 issue) wrote the history of the same field differently in the same year; among the latter's 888 references, citation lines to 47 papers of this version were confirmed (41 in OpenAlex, 6 from the reference list). The sparsely gated mixture of experts of Shazeer et al. (23 January 2017; ICLR 2017) revived the mixture of experts of Jacobs 1991 (chapter 4), letting a gating network pick a sparse combination of thousands of experts per example in a 137-billion-parameter language model, the forerunner of the Switch Transformer in chapter 6. Amodei et al., "Concrete Problems in AI Safety" (21 June 2016) set side effects, reward hacking, safe exploration and distributional shift as research problems and leads to the alignment work of chapter 6. Google's TPU paper (arXiv v1 16 April 2017; ISCA 2017) is the chapter's only hardware point: an inference ASIC deployed in Google datacenters since 2015, compared with the CPU and GPU of its time.

What was and was not checked

All 46 papers were read. arXiv papers were read in the latest downloaded version, so quotation pages refer to that version, which the card names. The four Nature papers (DQN, the review, AlphaGo, AlphaGo Zero) were read in publisher-typeset copies or author manuscripts on author, laboratory or repository sites. Candidates that did not pass the rule include Faster R-CNN, YOLO, U-Net, Highway Networks, Show-Attend-Tell, GCN and DeepStack.

Priority: convolutional networks and residual connections

QuestionEarlier workLater workVerified in this version
Shift-invariant multilayer pattern recognitionFukushima 1980, Neocognitron (Biological Cybernetics 36: 193–202, April 1980)LeCun et al. 1989 (Neural Computation 1: 541–551, December 1989)LeCun 1989 cites Fukushima 1980 in its reference list. Krizhevsky 2012 cites neither
Shortcut connections in deep networksSrivastava, Greff and Schmidhuber, "Highway Networks", arXiv 1505.00387, v1 3 May 2015He et al., "Deep Residual Learning for Image Recognition", arXiv 1512.03385, v1 10 December 2015He 2015 cites Highway Networks in its reference list. Highway did not pass the selection rule (bibliography from arXiv metadata)
Benchmark results of GPU-trained deep networksCireşan et al. 2010 (arXiv 1 March 2010) · Cireşan et al. 2012 (arXiv 13 February 2012)Krizhevsky et al. 2012 (NIPS, December 2012)Krizhevsky 2012 cites Cireşan 2012 (arXiv 1202.2745) in its reference list; it does not cite Cireşan 2010

Dates: preprint and conference

From 2013 most points on this site sit at the arXiv v1 date. The year usually quoted is mostly the conference year.

WorkUsually quotedarXiv v1Conference or journal
TransformerNIPS 20172017-06-12NIPS 2017 (December)
ResNetCVPR 20162015-12-10CVPR 2016
Attention (Bahdanau et al.)ICLR 20152014-09-01ICLR 2015
R-CNNCVPR 20142013-11-11CVPR 2014
Schmidhuber's overview20152014-04-30Neural Networks, January 2015
DQN2015 (Nature)2013-12-19Nature, 25 February 2015 (a separate paper)

Lineage

Neural network learning Reinforcement learning and games Language and speech Vision and generative models Probability, statistics and origins Scale, alignment and safety 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019
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 (46)

Building high-level features using large scale unsupervised learning

Le · First public 2011-12-29 (arXiv v1) · Venue: Proceedings of the 29th International Conference on Machine Learning (ICML 2012), Edinburgh · Pages 8 pp. (ICML 2012 PDF, no printed page numbers)

URL · arXiv v2 22 May 2012; v3 12 Jun 2012; v4 11 Jul 2012; v5 12 Jul 2012; ICML 2012, Edinburgh (PDF footer 'Appearing in Proceedings of the 29th International Conference on Machine Learning, Edinburgh, Scotland, UK, 2012')

Contrary to what appears to be a widely-held intuition, our experimental results reveal that it is possible to train a face detector without having to label images as containing a face or not.p. 1 (ICML 2012 PDF)

What changed. Trained a 9-layer locally connected sparse autoencoder with pooling and local contrast normalization (1 billion connections) on 10 million unlabeled 200x200 images, using model parallelism and asynchronous SGD on 1,000 machines for three days, and found units that respond to faces, cat faces and human bodies without labeled data. Starting from these features, the network reached 15.8% accuracy on 20,000 ImageNet categories.

Cites (within this list): Bengio et al. 2006, Ciresan et al. 2010, Deng et al. 2009, Hinton et al. 2006, Hinton & Salakhutdinov 2006, LeCun et al. 1998, Raina et al. 2009
Cited by (within this list): Schmidhuber 2014, Shazeer et al. 2017, Sutskever et al. 2014, Szegedy et al. 2013

Multi-column deep neural networks for image classification

Dan Claudiu Ciresan, Ueli Meier, Jürgen Schmidhuber · First public 2012-02-13 (arXiv v1) · Venue: 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · Pages 8 pp. (author copy, numbered 1-8; proceedings pp. 3642–3649 per Crossref) · Citations (OpenAlex) 3,746 (checked 2026-11-03)

DOI · CVPR 2012, June 2012 (Crossref published-print 2012-06, pp. 3642-3649)

We also show how combining several DNN columns into a Multi-column DNN (MCDNN) further decreases the error rate by 30-40%.p. 1 (IDSIA author copy)

What changed. Trained wide and deep convolutional networks with winner-take-all neurons by online back-propagation on GPUs and averaged several such columns, trained on differently preprocessed inputs, into a multi-column DNN. The authors report near-human performance on MNIST, a traffic sign result better than human performance, and improved results on several other image classification benchmarks.

Cites (within this list): Bengio et al. 2006, Ciresan et al. 2010, Fukushima 1980, LeCun et al. 1998, Werbos 1974
Cited by (within this list): Krizhevsky et al. 2012, Schmidhuber 2014, Sutskever et al. 2014

Deep Neural Networks for Acoustic Modeling in Speech Recognition

Geoffrey E. Hinton, Li Deng, Dong Yu, George E. Dahl, Abdelrahman Mohamed, Navdeep Jaitly et al. · First public 2012-11 (journal issue) · Venue: IEEE Signal Processing Magazine 29(6) · Pages 82–97 (final, per Crossref); proof pp. [2]–[17] · Citations (OpenAlex) 10,175 (checked 2026-11-03)

DOI · Crossref DOI created 2012-10-19; proof PDF created 2012-08-14 (metadata only)

Deep neural networks (DNNs) that have many hidden layers and are trained using new methods have been shown to outperform GMMs on a variety of speech recognition benchmarks, sometimes by a large margin.proof p. [2] (final pagination not seen)

What changed. Reviews the shared views of four groups (Toronto, MSR, Google, IBM) on DNN acoustic models trained with generative pretraining and discriminative fine-tuning, reporting results on TIMIT and five LVCSR tasks against GMM-HMM systems.

Cites (within this list): Ciresan et al. 2010, Glorot & Bengio 2010, Hinton 2000, Hinton et al. 2006, Hinton & Salakhutdinov 2006, Pearl 1988, Rumelhart et al. 1986
Cited by (within this list): Ba et al. 2016, Goodfellow et al. 2014, Hinton et al. 2015, Kingma & Ba 2014, LeCun et al. 2015, Schmidhuber 2014, Shazeer et al. 2017, Sutskever et al. 2014, Szegedy et al. 2013

ImageNet Classification with Deep Convolutional Neural Networks

Krizhevsky · First public 2012-12 (conference) · Venue: Advances in Neural Information Processing Systems 25 (NIPS 2012), Curran Associates · Pages 1–9 (PDF pagination; NeurIPS BibTeX gives no page range)

URL

We trained a large, deep convolutional neural network to classify the 1.2 million high-resolution images in the ImageNet LSVRC-2010 contest into the 1000 different classes.p. 1

What changed. Trains a deep convolutional network (five convolutional and three fully connected layers, 60 million parameters) on ImageNet LSVRC-2010 using non-saturating neurons, a GPU convolution implementation and dropout, reporting 37.5% top-1 and 17.0% top-5 test error and a 15.3% top-5 entry in ILSVRC-2012.

Cites (within this list): Breiman 2001, Ciresan et al. 2012, Deng et al. 2009, Nair & Hinton 2010
Cited by (within this list): Amodei et al. 2016, Ba et al. 2016, Bommasani et al. 2021, Cho et al. 2014, Dosovitskiy et al. 2020, Girshick et al. 2013, Goodfellow et al. 2014, He et al. 2015, Hinton et al. 2015, Jouppi et al. 2017, Kaplan et al. 2020, Kingma & Ba 2014, LeCun et al. 2015, Lillicrap et al. 2015, Mnih et al. 2013, Mnih et al. 2015, Radford et al. 2019, Radford et al. 2021, Schmidhuber 2014, Schrittwieser et al. 2019, Shazeer et al. 2017, Silver et al. 2016, Silver et al. 2017, Simonyan & Zisserman 2014, Srivastava et al. 2014, Sutskever et al. 2014, Szegedy et al. 2013, Szegedy et al. 2014

Efficient Estimation of Word Representations in Vector Space

Tomáš Mikolov, Kai Chen, Greg S. Corrado, Dean, Jeffrey · First public 2013-01-16 (arXiv v1) · Venue: arXiv:1301.3781 [cs.CL] · Pages 12 pp. (arXiv v3) · Citations (OpenAlex) 25,992 (checked 2026-11-03)

arXiv · v2 2013-03-07; v3 2013-09-07

We propose two novel model architectures for computing continuous vector representations of words from very large data sets.p. 1 (arXiv v3)

What changed. Proposes two log-linear architectures (CBOW and Skip-gram) for learning word vectors from very large corpora at lower computational cost, evaluated on a syntactic and semantic word similarity test set.

Cites (within this list): Bengio et al. 2003, Collobert et al. 2011, Elman 1988, Mikolov et al. 2010, Mikolov et al. 2013, Rumelhart et al. 1986
Cited by (within this list): Ba et al. 2016, Bommasani et al. 2021, Brown et al. 2020, Mikolov et al. 2013, Pennington et al. 2014, Raffel et al. 2019, Szegedy et al. 2013

Generating Sequences With Recurrent Neural Networks

Alex Graves · First public 2013-08-04 (arXiv v1) · Venue: arXiv:1308.0850 [cs.NE] · Pages 43 pp. (arXiv v5) · Citations (OpenAlex) 2,890 (checked 2026-11-03)

arXiv · v2 2013-08-11; v3 2014-02-21; v4 2014-04-02; v5 2014-06-05

This paper shows how Long Short-term Memory recurrent neural networks can be used to generate complex sequences with long-range structure, simply by predicting one data point at a time.p. 1 (arXiv v5)

What changed. Shows LSTM recurrent networks generating text and online handwriting by predicting one data point at a time, and extends this to handwriting synthesis conditioned on a text sequence.

Cites (within this list): Bengio et al. 1994, Hochreiter & Schmidhuber 1995
Cited by (within this list): Ba et al. 2016, Bahdanau et al. 2014, Chen et al. 2021, Graves et al. 2014, Kingma & Ba 2014, Raffel et al. 2019, Sutskever et al. 2014, Touvron et al. 2023, Vaswani et al. 2017, Weston et al. 2014

Distributed Representations of Words and Phrases and their Compositionality

Tomáš Mikolov, Ilya Sutskever, Kai Chen, Greg S. Corrado, Jeff Dean · First public 2013-10-16 (arXiv v1) · Venue: arXiv:1310.4546 [cs.CL] · Pages 9 pp. (arXiv v1) · Citations (OpenAlex) 24,513 (checked 2026-11-03)

arXiv

We also describe a simple alternative to the hierarchical softmax called negative sampling.p. 1 (arXiv v1)

What changed. Presents extensions to the continuous Skip-gram model: subsampling of frequent words and negative sampling as an alternative to the hierarchical softmax. Also describes a method for finding phrases in text and learning vector representations for them.

Cites (within this list): Bengio et al. 2003, Mikolov et al. 2013, Rumelhart et al. 1986
Cited by (within this list): Bender et al. 2021, Chen et al. 2021, Cho et al. 2014, Devlin et al. 2018, Howard & Ruder 2018, LeCun et al. 2015, Mikolov et al. 2013, Pennington et al. 2014, Peters et al. 2018, Radford et al. 2015, Radford et al. 2018, Radford et al. 2019, Radford et al. 2021, Raffel et al. 2019

Rich feature hierarchies for accurate object detection and semantic segmentation

Ross Girshick, Jeff Donahue, Trevor Darrell, Jitendra Malik · First public 2013-11-11 (arXiv v1) · Venue: IEEE Conference on Computer Vision and Pattern Recognition (CVPR) 2014 (doi:10.1109/CVPR.2014.81); copy read is arXiv:1311.2524v5 tech report · Pages 21 pp. (arXiv v5) · Citations (OpenAlex) 32,677 (checked 2026-11-03)

DOI · CVPR 2014 (arXiv comments "Extended version of our CVPR 2014 paper"; changelog: v2 = CVPR 2014 camera-ready, arXiv 2014-04-15); arXiv v5 2014-10-22

Since we combine region proposals with CNNs, we call our method R-CNN: Regions with CNN features.p. 1 (arXiv v5)

What changed. Applies high-capacity CNNs to bottom-up region proposals for object detection and segmentation. It uses supervised pre-training on an auxiliary task followed by domain-specific fine-tuning when labeled data are scarce, and reports more than 30% relative mAP improvement on VOC 2012.

Cites (within this list): Deng et al. 2009, Fukushima 1980, Krizhevsky et al. 2012, LeCun et al. 1989, LeCun et al. 1998, Simonyan & Zisserman 2014
Cited by (within this list): Bommasani et al. 2021, He et al. 2015, LeCun et al. 2015, Schmidhuber 2014, Simonyan & Zisserman 2014, Szegedy et al. 2013, Szegedy et al. 2014

Auto-Encoding Variational Bayes

Diederik P. Kingma, Max Welling · First public 2013-12-20 (arXiv v1) · Venue: arXiv:1312.6114 [stat.ML] · Pages 14 pp. (arXiv v11) · Citations (OpenAlex) 20,041 (checked 2026-11-03)

arXiv · v2–v10 2013-12-23 to 2014-05-01; v11 2022-12-10 (arXiv comment: fixes a typo in the abstract, no other changes)

We introduce a stochastic variational inference and learning algorithm that scales to large datasets and, under some mild differentiability conditions, even works in the intractable case.p. 1 (arXiv v11)

What changed. Introduces a reparameterization of the variational lower bound giving the SGVB estimator, and the AEVB algorithm that fits a recognition model to the intractable posterior; with neural networks this yields the variational auto-encoder.

Cites (within this list): none
Cited by (within this list): Bommasani et al. 2021, Goodfellow et al. 2014, Kingma & Ba 2014, Radford et al. 2015, Sohl-Dickstein et al. 2015

Playing Atari with Deep Reinforcement Learning

Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, Daan Wierstra et al. · First public 2013-12-19 (arXiv v1) · Venue: arXiv:1312.5602 [cs.LG]; NIPS Deep Learning Workshop 2013 · Pages 9 pp. (arXiv v1) · Citations (OpenAlex) 9,458 (checked 2026-11-03)

arXiv · NIPS Deep Learning Workshop 2013 (arXiv comments field)

We present the first deep learning model to successfully learn control policies directly from high-dimensional sensory input using reinforcement learning.p. 1 (arXiv v1)

What changed. Trains a convolutional neural network with a variant of Q-learning to estimate future rewards directly from raw Atari 2600 pixels. The same architecture and learning algorithm were applied to seven games without adjustment.

Cites (within this list): Krizhevsky et al. 2012, Nair & Hinton 2010, Sutton & Barto 1998, Tesauro 1995, Watkins & Dayan 1992
Cited by (within this list): Christiano et al. 2017, Lillicrap et al. 2015, Mnih et al. 2016, Schmidhuber 2014, Schulman et al. 2015, Wang et al. 2023

Intriguing properties of neural networks

Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow et al. · First public 2013-12-21 (arXiv v1) · Venue: arXiv:1312.6199 [cs.CV] · Pages 10 pp. (arXiv v4) · Citations (OpenAlex) 8,137 (checked 2026-11-03)

arXiv · arXiv v2 2014-01-03; v3 2014-02-13; v4 2014-02-19

We can cause the network to misclassify an image by applying a certain hardly perceptible perturbation, which is found by maximizing the network’s prediction error.p. 1 (arXiv v4)

What changed. Reports two properties of deep networks. The semantic information in high layers is carried by the space of units rather than by individual units, and hardly perceptible input perturbations found by maximizing prediction error can make a network misclassify an image, sometimes transferring across networks.

Cites (within this list): Deng et al. 2009, Girshick et al. 2013, Hinton et al. 2012, Krizhevsky et al. 2012, Le et al. 2011, Mikolov et al. 2013
Cited by (within this list): Amodei et al. 2016, Bommasani et al. 2021

Deep learning in neural networks: An overview

Jürgen Schmidhuber · First public 2014-04-30 (arXiv v1) · Venue: Neural Networks 61, 85–117 (journal); read as arXiv:1404.7828 v4 [cs.NE] / Technical Report IDSIA-03-14 · Pages 88 pp. (arXiv v4) · Citations (OpenAlex) 18,573 (checked 2026-11-03)

DOI · arXiv v2 2014-05-28; v3 2014-07-02; v4 2014-10-08; Neural Networks 61 (Crossref published-print 2015-01)

Shallow and deep learners are distinguished by the depth of their credit assignment paths, which are chains of possibly learnable, causal links between actions and effects.p. 1 (arXiv v4)

What changed. A historical survey of deep learning in neural networks covering supervised learning (including the history of backpropagation), unsupervised learning, reinforcement learning, evolutionary computation and indirect search for programs encoding networks. It distinguishes shallow and deep learners by the depth of their credit assignment paths.

Cites (within this list): Barto et al. 1983, Bellman 1957, Bengio et al. 1994, Bengio et al. 2006, Breiman 1994, Ciresan et al. 2010, Ciresan et al. 2012, Dempster et al. 1976, Elman 1988, Fukushima 1980, Girshick et al. 2013, Hebb 1949, Hinton 2000, Hinton et al. 2006, Hinton & Salakhutdinov 2006, Hinton et al. 2012, Hochreiter 1991, Hochreiter & Schmidhuber 1995, Holland 1975, Hopfield 1982, Hornik et al. 1988, Kaelbling et al. 1998, Krizhevsky et al. 2012, Le et al. 2011, LeCun et al. 1989, LeCun et al. 1998, McCulloch & Pitts 1943, Minsky 1961, Minsky & Papert 1969, Mnih et al. 2013, Nair & Hinton 2010, Raina et al. 2009, Rosenblatt 1958, Russell & Norvig 1995, Samuel 1959, Schapire 1989, Schuster & Paliwal 1997, Shannon 1948, Sutskever et al. 2014, Sutton & Barto 1998, Sutton et al. 1999, Szegedy et al. 2014, Watkins 1989, Watkins & Dayan 1992, Werbos 1974, Werbos 1982, Williams 1992
Cited by (within this list): none

Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation

Kyunghyun Cho, Bart van Merriënboer, Çağlar Gülçehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk et al. · First public 2014-06-03 (arXiv v1) · Venue: Conference on Empirical Methods in Natural Language Processing (EMNLP 2014); arXiv:1406.1078 [cs.CL] · Pages 15 pp. (arXiv v3) · Citations (OpenAlex) 3,322 (checked 2026-11-03)

arXiv · EMNLP 2014 (arXiv comments field); arXiv v2 2014-07-24; v3 2014-09-03

In this paper, we propose a novel neural network model called RNN Encoder–Decoder that consists of two recurrent neural networks (RNN).p. 1 (arXiv v3)

What changed. Proposes the RNN Encoder–Decoder, in which one RNN encodes a symbol sequence into a fixed-length vector and another decodes it, both trained jointly. The paper also introduces a gated hidden unit. Phrase-pair scores from the model are used as an additional feature in a phrase-based SMT system.

Cites (within this list): Bengio et al. 2003, Hochreiter & Schmidhuber 1995, Krizhevsky et al. 2012, Mikolov et al. 2013
Cited by (within this list): Ba et al. 2016, Bahdanau et al. 2014, LeCun et al. 2015, Luong et al. 2015, Sennrich et al. 2015, Sutskever et al. 2014, Vaswani et al. 2017, Wu et al. 2016

Generative Adversarial Nets

Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair et al. · First public 2014-06-10 (arXiv v1) · Venue: arXiv:1406.2661 [stat.ML] · Pages 9 pp. (arXiv v1) · Citations (OpenAlex) 4,476 (checked 2026-11-03)

arXiv

We propose a new framework for estimating generative models via an adversarial process, in which we simultaneously train two models: a generative model G that captures the data distribution, and a discriminative model D that estimates the probability that a sample came from the training data rather than G.p. 1 (arXiv v1)

What changed. Proposes training a generative model G and a discriminative model D together as a minimax two-player game, with G trained to maximize the probability of D making a mistake. When both are multilayer perceptrons, the system is trained with backpropagation without Markov chains or approximate inference networks.

Cites (within this list): Hinton et al. 2006, Hinton et al. 2012, Kingma & Welling 2013, Krizhevsky et al. 2012, LeCun et al. 1998
Cited by (within this list): Amodei et al. 2016, Bommasani et al. 2021, Radford et al. 2015, Sohl-Dickstein et al. 2015

Dropout: A Simple Way to Prevent Neural Networks from Overfitting

Srivastava · First public 2014-06 (journal issue) · Venue: Journal of Machine Learning Research 15(56): 1929–1958 (2014) · Pages 1929–1958

URL

The key idea is to randomly drop units (along with their connections) from the neural network during training.p. 1929

What changed. Describes dropout, a regularization technique that randomly drops units and their connections during training, and approximates averaging over the thinned networks at test time with a single network that has scaled-down weights. It reports results on vision, speech, document classification and computational biology benchmarks.

Cites (within this list): Hinton et al. 2006, Hinton & Salakhutdinov 2006, Krizhevsky et al. 2012, LeCun et al. 1989, Tibshirani 1996
Cited by (within this list): Fedus et al. 2021, Hinton et al. 2015, Ioffe & Szegedy 2015, LeCun et al. 2015, Peters et al. 2018, Raffel et al. 2019, Vaswani et al. 2017

Neural Machine Translation by Jointly Learning to Align and Translate

Dzmitry Bahdanau, Kyunghyun Cho, Yoshua Bengio · First public 2014-09-01 (arXiv v1) · Venue: International Conference on Learning Representations (ICLR) 2015; arXiv:1409.0473 [cs.CL] · Pages 15 pp. (arXiv v7) · Citations (OpenAlex) 16,214 (checked 2026-11-03)

arXiv · ICLR 2015 (PDF header "Published as a conference paper at ICLR 2015"; arXiv comments "Accepted at ICLR 2015 as oral presentation"); arXiv v7 2016-05-19

In order to address this issue, we introduce an extension to the encoder–decoder model which learns to align and translate jointly.p. 1 (arXiv v7)

What changed. Treats the fixed-length vector of the basic encoder–decoder as a bottleneck. It extends the model so that, for each target word, it (soft-)searches the source sentence for relevant positions and predicts the word from the context vectors of those positions.

Cites (within this list): Bengio et al. 1994, Bengio et al. 2003, Cho et al. 2014, Graves 2013, Hochreiter 1991, Hochreiter & Schmidhuber 1995, Schuster & Paliwal 1997, Sutskever et al. 2014
Cited by (within this list): Bommasani et al. 2021, Graves et al. 2014, LeCun et al. 2015, Luong et al. 2015, Raffel et al. 2019, Sennrich et al. 2015, Shazeer et al. 2017, Sutskever et al. 2014, Vaswani et al. 2017, Weston et al. 2014, Wu et al. 2016

Very Deep Convolutional Networks for Large-Scale Image Recognition

Karen Simonyan, Andrew Zisserman · First public 2014-09-04 (arXiv v1) · Venue: International Conference on Learning Representations (ICLR) 2015; arXiv:1409.1556 [cs.CV] · Pages 14 pp. (arXiv v6) · Citations (OpenAlex) 88,417 (checked 2026-11-03)

arXiv · ICLR 2015 (PDF header "Published as a conference paper at ICLR 2015"); arXiv v6 2015-04-10

Our main contribution is a thorough evaluation of networks of increasing depth using an architecture with very small (3 × 3) convolution filters, which shows that a significant improvement on the prior-art configurations can be achieved by pushing the depth to 16–19 weight layers.p. 1 (arXiv v6)

What changed. Evaluates convolutional networks of increasing depth built from very small (3 × 3) filters, reporting improvements at 16–19 weight layers. These networks formed the authors' ImageNet Challenge 2014 submission, and the two best models were released publicly.

Cites (within this list): Deng et al. 2009, Girshick et al. 2013, Glorot & Bengio 2010, Krizhevsky et al. 2012, LeCun et al. 1989, Szegedy et al. 2014
Cited by (within this list): Ba et al. 2016, Bommasani et al. 2021, Girshick et al. 2013, He et al. 2015, LeCun et al. 2015

Sequence to Sequence Learning with Neural Networks

Ilya Sutskever, Oriol Vinyals, Quoc Viet Le · First public 2014-09-10 (arXiv v1) · Venue: arXiv:1409.3215 [cs.CL]; Advances in Neural Information Processing Systems 27 (NIPS 2014) · Pages 9 pp. (arXiv v3) · Citations (OpenAlex) 17,279 (checked 2026-11-03)

arXiv · arXiv v2 2014-10-29; arXiv v3 2014-12-14; NIPS 2014 (cited as Advances in Neural Information Processing Systems 27, pp. 3104–3112 in the reference list of sennrich2015)

In this paper, we present a general end-to-end approach to sequence learning that makes minimal assumptions on the sequence structure.p. 1 (arXiv v3)

What changed. Uses one multilayered LSTM to map an input sequence to a fixed-dimensional vector and another deep LSTM to decode the target sequence from it, reporting 34.8 BLEU on WMT 2014 English-French. Also reports that reversing the order of source words improved performance.

Cites (within this list): Bahdanau et al. 2014, Bengio et al. 1994, Bengio et al. 2003, Cho et al. 2014, Ciresan et al. 2012, Graves 2013, Hinton et al. 2012, Hochreiter 1991, Hochreiter & Schmidhuber 1995, Krizhevsky et al. 2012, Le et al. 2011, LeCun et al. 1998, Mikolov et al. 2010, Rumelhart et al. 1986
Cited by (within this list): Ba et al. 2016, Bahdanau et al. 2014, Chen et al. 2021, Graves et al. 2014, LeCun et al. 2015, Luong et al. 2015, Radford et al. 2019, Raffel et al. 2019, Schmidhuber 2014, Sennrich et al. 2015, Shazeer et al. 2017, Vaswani et al. 2017, Wu et al. 2016

Going Deeper with Convolutions

Christian Szegedy, Wei Liu, Yangqing Jia, Pierre Sermanet, Scott Reed, Dragomir Anguelov et al. · First public 2014-09-17 (arXiv v1) · Venue: arXiv:1409.4842 [cs.CV]; later published at the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2015) · Pages 12 pp. (arXiv v1) · Citations (OpenAlex) 1,460 (checked 2026-11-03)

arXiv · CVPR 2015 (June 2015)

We propose a deep convolutional neural network architecture codenamed Inception, which was responsible for setting the new state of the art for classification and detection in the ImageNet Large-Scale Visual Recognition Challenge 2014 (ILSVRC14).p. 1 (arXiv v1)

What changed. Introduced the Inception architecture, which increases network depth and width under a fixed computational budget, and its 22-layer instance GoogLeNet used in the ILSVRC 2014 classification and detection submissions. GoogLeNet used 12 times fewer parameters than the 2012 Krizhevsky et al. network.

Cites (within this list): Girshick et al. 2013, Krizhevsky et al. 2012, LeCun et al. 1989, LeCun et al. 1998
Cited by (within this list): Bommasani et al. 2021, He et al. 2015, Ioffe & Szegedy 2015, Jouppi et al. 2017, LeCun et al. 2015, Schmidhuber 2014, Simonyan & Zisserman 2014

Neural Turing Machines

Alex Graves, Greg Wayne, Ivo Danihelka · First public 2014-10-20 (arXiv v1) · Venue: arXiv:1410.5401 [cs.NE] · Pages 26 pp. (arXiv v2) · Citations (OpenAlex) 1,058 (checked 2026-11-03)

arXiv · arXiv v2 2014-12-10

We extend the capabilities of neural networks by coupling them to external memory resources, which they can interact with by attentional processes.p. 1 (arXiv v2)

What changed. Couples a neural network controller to an external memory accessed through attentional read and write operations, so that the combined system is differentiable end-to-end and trainable by gradient descent. Preliminary experiments show it inferring simple algorithms such as copying, sorting and associative recall from examples.

Cites (within this list): Bahdanau et al. 2014, Chomsky 1956, Graves 2013, Hochreiter & Schmidhuber 1995, Hopfield 1982, Sutskever et al. 2014
Cited by (within this list): Amodei et al. 2016, Bommasani et al. 2021, Chen et al. 2021, LeCun et al. 2015, Wei et al. 2022, Weston et al. 2014

GloVe: Global Vectors for Word Representation

Jeffrey Pennington, Richard Socher, Christopher D. Manning · First public 2014-10 (conference) · Venue: Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), Doha, Qatar, Association for Computational Linguistics (doi:10.3115/v1/D14-1162) · Pages 1532–1543 · Citations (OpenAlex) 33,593 (checked 2026-11-03)

DOI

The result is a new global log-bilinear regression model that combines the advantages of the two major model families in the literature: global matrix factorization and local context window methods.p. 1532

What changed. Analyzes the model properties needed for linear regularities in word vectors and proposes GloVe, a global log-bilinear regression model trained on the nonzero entries of a word–word co-occurrence matrix. It reports 75% on a word-analogy task.

Cites (within this list): Bengio et al. 2003, Collobert et al. 2011, Mikolov et al. 2013, Mikolov et al. 2013
Cited by (within this list): Bender et al. 2021, Bommasani et al. 2021, Brown et al. 2020, Devlin et al. 2018, Peters et al. 2018, Radford et al. 2018, Radford et al. 2019, Radford et al. 2021, Raffel et al. 2019

Memory Networks

Jason Weston, Sumit Chopra, Antoine Bordes · First public 2014-10-15 (arXiv v1) · Venue: International Conference on Learning Representations (ICLR) 2015; arXiv:1410.3916 · Pages 15 pp. (arXiv v11) · Citations (OpenAlex) 545 (checked 2026-11-03)

arXiv · arXiv v2–v11 (16 Oct 2014 to 29 Nov 2015); ICLR 2015 (v11 header: 'Published as a conference paper at ICLR 2015')

In this work, we introduce a class of models called memory networks that attempt to rectify this problem.p. 1 (arXiv v11)

What changed. Introduces memory networks, models that combine inference components with a long-term memory that can be read and written, organized as input, generalization, output and response components. Evaluates them on large-scale question answering and on a simulated-world QA task requiring chaining of supporting sentences.

Cites (within this list): Bahdanau et al. 2014, Graves 2013, Graves et al. 2014, Hochreiter & Schmidhuber 1995, Mikolov et al. 2010
Cited by (within this list): Bommasani et al. 2021, LeCun et al. 2015, Lewis et al. 2020

Adam: A Method for Stochastic Optimization

Diederik P. Kingma, Jimmy Lei Ba · First public 2014-12-22 (arXiv v1) · Venue: 3rd International Conference on Learning Representations (ICLR) 2015; arXiv:1412.6980 [cs.LG] · Pages 15 pp. (arXiv v9) · Citations (OpenAlex) 98,946 (checked 2026-11-03)

arXiv · ICLR 2015, San Diego (PDF header and arXiv comments); arXiv v9 2017-01-30

We introduce Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments.p. 1 (arXiv v9)

What changed. Introduces Adam, a stochastic optimization method that adapts per-parameter step sizes from estimates of the first and second moments of the gradients. It gives a regret bound under the online convex framework and describes AdaMax, a variant based on the infinity norm.

Cites (within this list): Graves 2013, Hinton & Salakhutdinov 2006, Hinton et al. 2012, Kingma & Welling 2013, Krizhevsky et al. 2012
Cited by (within this list): Ba et al. 2016, Chowdhery et al. 2022, Dosovitskiy et al. 2020, Hoffmann et al. 2022, Kaplan et al. 2020, Lewis et al. 2020, Lillicrap et al. 2015, Mnih et al. 2016, Peters et al. 2018, Radford et al. 2015, Radford et al. 2018, Radford et al. 2021, Schulman et al. 2017, Shazeer et al. 2017, Stiennon et al. 2020, Vaswani et al. 2017, Wu et al. 2016

Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift

Sergey Ioffe, Christian Szegedy · First public 2015-02-11 (arXiv v1) · Venue: arXiv:1502.03167 [cs.LG]; ICML 2015 · Pages 11 pp. (arXiv v3) · Citations (OpenAlex) 27,821 (checked 2026-11-03)

arXiv · arXiv v2 2015-02-13; arXiv v3 2015-03-02; ICML 2015 (cited as In ICML, 2015 in the he2015 reference list)

We refer to this phenomenon as internal covariate shift, and address the problem by normalizing layer inputs.p. 1 (arXiv v3)

What changed. Introduces Batch Normalization, which normalizes layer inputs over each training mini-batch as part of the model architecture. On an ImageNet model it reached the same accuracy with 14 times fewer training steps, and an ensemble reached 4.9% top-5 validation error.

Cites (within this list): Glorot & Bengio 2010, LeCun et al. 1998, Nair & Hinton 2010, Srivastava et al. 2014, Szegedy et al. 2014
Cited by (within this list): Ba et al. 2016, Dosovitskiy et al. 2020, He et al. 2015, Howard & Ruder 2018, Lillicrap et al. 2015, Radford et al. 2015, Radford et al. 2021, Shazeer et al. 2017, Silver et al. 2017

Human-level control through deep reinforcement learning

Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A. Rusu, Joel Veness, Marc G. Bellemare et al. · First public 2015-02-25 (journal (online publication)) · Venue: Nature 518(7540), Letter, doi:10.1038/nature14236 · Pages 529–533 · Citations (OpenAlex) 30,376 (checked 2026-11-03)

DOI · Nature print issue 2015-02-26 (vol. 518, no. 7540)

We demonstrate that the deep Q-network agent, receiving only the pixels and the game score as inputs, was able to surpass the performance of all previous algorithms and achieve a level comparable to that of a professional human games tester across a set of 49 games, using the same algorithm, network architecture and hyperparameters.p. 529

What changed. Introduces the deep Q-network, which learns control policies from pixels and game score with end-to-end reinforcement learning, using experience replay and a periodically updated target network. It was tested on 49 Atari 2600 games with one algorithm, architecture and hyperparameter set.

Cites (within this list): Fukushima 1980, Hinton & Salakhutdinov 2006, Kaelbling et al. 1998, Krizhevsky et al. 2012, LeCun et al. 1998, Nair & Hinton 2010, Sutton & Barto 1998, Tesauro 1995, Watkins & Dayan 1992
Cited by (within this list): Amodei et al. 2016, Christiano et al. 2017, LeCun et al. 2015, Lillicrap et al. 2015, Mnih et al. 2016, Schrittwieser et al. 2019, Schulman et al. 2017, Silver et al. 2016, Silver et al. 2017

Trust Region Policy Optimization

John Schulman, Sergey Levine, Philipp Moritz, Michael I. Jordan, Pieter Abbeel · First public 2015-02-19 (arXiv v1) · Venue: ICML 2015, Lille, France, JMLR W&CP vol. 37 · Pages 16 pp. (arXiv v5) · Citations (OpenAlex) 4,363 (checked 2026-11-03)

arXiv · arXiv v2 2015-05-18; v3 2015-06-08; v4 2016-06-06; v5 2017-04-20; ICML 2015 (arXiv comment and PDF footnote)

By making several approximations to the theoretically-justified procedure, we develop a practical algorithm, called Trust Region Policy Optimization (TRPO).p. 1 (arXiv v5)

What changed. Describes an iterative policy optimization procedure with guaranteed monotonic improvement and a practical approximation of it, TRPO, which is similar to natural policy gradient methods. It was tested on simulated robotic swimming, hopping and walking and on Atari games from screen images.

Cites (within this list): Barto et al. 1983, Mnih et al. 2013
Cited by (within this list): Christiano et al. 2017, Lillicrap et al. 2015, Mnih et al. 2016, Schulman et al. 2017

Distilling the Knowledge in a Neural Network

Geoffrey E. Hinton, Oriol Vinyals, Dean, Jeff · First public 2015-03-09 (arXiv v1) · Venue: arXiv:1503.02531 [stat.ML]; NIPS 2014 Deep Learning Workshop · Pages 9 pp. (arXiv v1) · Citations (OpenAlex) 14,199 (checked 2026-11-03)

arXiv · NIPS 2014 Deep Learning Workshop (arXiv comment; workshop date and public copy not checked)

Once the cumbersome model has been trained, we can then use a different kind of training, which we call “distillation” to transfer the knowledge from the cumbersome model to a small model that is more suitable for deployment.p. 1 (arXiv v1)

What changed. Proposes distillation: training a small model to transfer the knowledge of a large model or ensemble, shown on MNIST and on a commercial speech acoustic model. Also introduces ensembles of specialist models that learn to distinguish fine-grained classes the full models confuse.

Cites (within this list): Hinton et al. 2012, Jacobs et al. 1991, Krizhevsky et al. 2012, Srivastava et al. 2014
Cited by (within this list): Bender et al. 2021, Bommasani et al. 2021, Brown et al. 2020, DeepSeek-AI 2025, Fedus et al. 2021, Raffel et al. 2019

Deep Unsupervised Learning using Nonequilibrium Thermodynamics

Jascha Sohl‐Dickstein, Weiss, Eric A., Niru Maheswaranathan, Surya Ganguli · First public 2015-03-12 (arXiv v1) · Venue: ICML 2015, Lille, France, JMLR W&CP vol. 37 · Pages 18 pp. (arXiv v8) · Citations (OpenAlex) 2,637 (checked 2026-11-03)

arXiv · arXiv v2–v8 2015-04-02 to 2015-11-18; ICML 2015 (PDF footnote: Proceedings of the 32nd ICML, Lille, France, 2015)

The essential idea, inspired by non-equilibrium statistical physics, is to systematically and slowly destroy structure in a data distribution through an iterative forward diffusion process.p. 1 (arXiv v8)

What changed. Builds a generative model by slowly destroying structure in data with an iterative forward diffusion process and learning a reverse diffusion process that restores it. The model allows learning, sampling and probability evaluation with thousands of layers or time steps.

Cites (within this list): Goodfellow et al. 2014, Hinton 2000, Kingma & Welling 2013
Cited by (within this list): Bommasani et al. 2021, Radford et al. 2015

Deep learning

Yann LeCun, Yoshua Bengio, Geoffrey E. Hinton · First public 2015-05-27 (journal (online publication)) · Venue: Nature 521(7553), Review, doi:10.1038/nature14539 · Pages 436–444 · Citations (OpenAlex) 84,170 (checked 2026-11-03)

DOI · Nature print issue 2015-05-28 (vol. 521, no. 7553)

Deep learning allows computational models that are composed of multiple processing layers to learn representations of data with multiple levels of abstraction.p. 436

What changed. A review describing deep learning as representation learning with multiple levels of representation trained with backpropagation, covering convolutional nets for images, video, speech and audio and recurrent nets for sequential data such as text and speech.

Cites (within this list): Bahdanau et al. 2014, Bengio et al. 1994, Bengio et al. 2003, Bengio et al. 2006, Cho et al. 2014, Collobert et al. 2011, Girshick et al. 2013, Graves et al. 2014, Hinton et al. 2006, Hinton & Salakhutdinov 2006, Hinton et al. 2012, Hochreiter 1991, Hochreiter & Schmidhuber 1995, Krizhevsky et al. 2012, LeCun et al. 1998, Mikolov et al. 2013, Mnih et al. 2015, Raina et al. 2009, Rumelhart et al. 1986, Simonyan & Zisserman 2014, Srivastava et al. 2014, Sutskever et al. 2014, Szegedy et al. 2014, Waibel et al. 1987, Werbos 1974, Weston et al. 2014
Cited by (within this list): Bommasani et al. 2021, Silver et al. 2016, Silver et al. 2017

Effective Approaches to Attention-based Neural Machine Translation

Minh-Thang Luong, Hieu Pham, Christopher D. Manning · First public 2015-08-17 (arXiv v1) · Venue: arXiv:1508.04025 [cs.CL]; published in Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing (EMNLP 2015) · Pages 11 pp. (arXiv v5) · Citations (OpenAlex) 742 (checked 2026-11-03)

arXiv · arXiv v2 18 Aug 2015; v3 19 Aug 2015; v4 29 Aug 2015; v5 20 Sep 2015 (comments: 'EMNLP 2015 camera-ready version'); EMNLP 2015 (Sep 2015)

This paper examines two simple and effective classes of attentional mechanism: a global approach which always attends to all source words and a local one that only looks at a subset of source words at a time.p. 1 (arXiv v5)

What changed. Proposed and compared global attention, which attends to all source words, and local attention, which attends to a subset of source positions, for neural machine translation. On WMT English-German, local attention gave a 5.0 BLEU gain over non-attentional systems, and an ensemble reached 25.9 BLEU on WMT'15 English to German.

Cites (within this list): Bahdanau et al. 2014, Cho et al. 2014, Sutskever et al. 2014
Cited by (within this list): Hestness et al. 2017, Sennrich et al. 2015, Shazeer et al. 2017, Vaswani et al. 2017, Wu et al. 2016

Neural Machine Translation of Rare Words with Subword Units

Rico Sennrich, Barry Haddow, Alexandra Birch · First public 2015-08-31 (arXiv v1) · Venue: arXiv:1508.07909 [cs.CL]; Proceedings of ACL 2016 (P16-1162) · Pages 11 pp. (arXiv v5) · Citations (OpenAlex) 952 (checked 2026-11-03)

DOI arXiv · arXiv v2 2015-11-27; v3 2016-03-17; v4 2016-06-03; v5 2016-06-10 (comment: accepted at ACL 2016); ACL 2016 (doi:10.18653/v1/P16-1162)

In this paper, we introduce a simpler and more effective approach, making the NMT model capable of open-vocabulary translation by encoding rare and unknown words as sequences of subword units.p. 1 (arXiv v5)

What changed. Makes neural machine translation open-vocabulary by encoding rare and unknown words as sequences of subword units, including a segmentation based on byte pair encoding. Reports gains over a back-off dictionary baseline of up to 1.1 and 1.3 BLEU on WMT 15 English-German and English-Russian.

Cites (within this list): Bahdanau et al. 2014, Cho et al. 2014, Luong et al. 2015, Sutskever et al. 2014
Cited by (within this list): Bommasani et al. 2021, Hestness et al. 2017, Kaplan et al. 2020, Radford et al. 2018, Radford et al. 2019, Radford et al. 2021, Raffel et al. 2019, Touvron et al. 2023, Vaswani et al. 2017, Wu et al. 2016

Continuous control with deep reinforcement learning

Timothy Lillicrap, Jonathan J. Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa et al. · First public 2015-09-09 (arXiv v1) · Venue: ICLR 2016 (conference paper); arXiv:1509.02971 [cs.LG] · Pages 14 pp. (arXiv v6) · Citations (OpenAlex) 10,767 (checked 2026-11-03)

arXiv · arXiv v2 2015-11-18; v3 2016-01-07; v4 2016-01-19; v5 2016-02-29; v6 2019-07-05; ICLR 2016 (PDF header)

We present an actor-critic, model-free algorithm based on the deterministic policy gradient that can operate over continuous action spaces.p. 1 (arXiv v6)

What changed. Adapts ideas from Deep Q-Learning to continuous action domains with an actor-critic algorithm based on the deterministic policy gradient. With one algorithm and network setup it solves more than 20 simulated physics tasks, some directly from raw pixels.

Cites (within this list): Ioffe & Szegedy 2015, Kingma & Ba 2014, Krizhevsky et al. 2012, Mnih et al. 2013, Mnih et al. 2015, Schulman et al. 2015, Watkins & Dayan 1992
Cited by (within this list): Mnih et al. 2016, Wang et al. 2023

Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks

Alec Radford, Luke Metz, Soumith Chintala · First public 2015-11-19 (arXiv v1) · Venue: arXiv:1511.06434 [cs.LG]; submitted to ICLR 2016 · Pages 16 pp. (arXiv v2) · Citations (OpenAlex) 12,219 (checked 2026-11-03)

arXiv · arXiv v2 2016-01-07 (comment: Under review as a conference paper at ICLR 2016)

We introduce a class of CNNs called deep convolutional generative adversarial networks (DCGANs), that have certain architectural constraints, and demonstrate that they are a strong candidate for unsupervised learning.p. 1 (arXiv v2)

What changed. Proposes architectural constraints for convolutional GANs (DCGANs) and reuses the trained generator and discriminator as feature extractors for supervised tasks. Reports that the networks learn a hierarchy of representations from object parts to scenes.

Cites (within this list): Deng et al. 2009, Goodfellow et al. 2014, Ioffe & Szegedy 2015, Kingma & Welling 2013, Kingma & Ba 2014, Mikolov et al. 2013, Nair & Hinton 2010, Sohl-Dickstein et al. 2015
Cited by (within this list): none

Deep Residual Learning for Image Recognition

Kaiming He, Xiangyu Zhang, Shaoqing Ren, Jian Sun · First public 2015-12-10 (arXiv v1) · Venue: arXiv:1512.03385 [cs.CV], technical report (arXiv comment: Tech report) · Pages 12 pp. (arXiv v1) · Citations (OpenAlex) 4,192 (checked 2026-11-03)

arXiv

We present a residual learning framework to ease the training of networks that are substantially deeper than those used previously.p. 1 (arXiv v1)

What changed. Reformulates network layers as learning residual functions with reference to the layer inputs and trains residual nets of up to 152 layers on ImageNet. An ensemble reached 3.57% error on the ImageNet test set (1st place, ILSVRC 2015 classification).

Cites (within this list): Bengio et al. 1994, Girshick et al. 2013, Glorot & Bengio 2010, Hochreiter & Schmidhuber 1995, Ioffe & Szegedy 2015, Krizhevsky et al. 2012, LeCun et al. 1989, Nair & Hinton 2010, Simonyan & Zisserman 2014, Szegedy et al. 2014
Cited by (within this list): Bommasani et al. 2021, Dosovitskiy et al. 2020, Hestness et al. 2017, Howard & Ruder 2018, Jumper et al. 2021, Radford et al. 2021, Raffel et al. 2019, Shazeer et al. 2017, Silver et al. 2017, van den Oord et al. 2016, Vaswani et al. 2017, Wu et al. 2016

Mastering the game of Go with deep neural networks and tree search

David Silver, Aja Huang, Chris J. Maddison, Arthur Guez, Laurent Sifre, George van den Driessche et al. · First public 2016-01-27 (journal (online publication)) · Venue: Nature 529(7587) · Pages 484–489 · Citations (OpenAlex) 15,607 (checked 2026-11-03)

DOI · Nature issue 2016-01-28 (vol. 529, no. 7587)

Here we introduce a new approach to computer Go that uses ‘value networks’ to evaluate board positions and ‘policy networks’ to select moves.p. 484

What changed. The paper introduces AlphaGo, which combines policy networks trained by supervised learning from human expert games and by reinforcement learning from self-play, a value network, and Monte Carlo tree search; it won 99.8% of games against other Go programs and defeated the European Go champion 5 games to 0.

Cites (within this list): Campbell et al. 2002, Coulom 2006, Kocsis & Szepesvári 2006, Krizhevsky et al. 2012, LeCun et al. 2015, Mnih et al. 2015, Sutton 1988, Sutton & Barto 1998, Sutton et al. 1999, Williams 1992
Cited by (within this list): Amodei et al. 2016, Bommasani et al. 2021, Christiano et al. 2017, Jouppi et al. 2017, Schrittwieser et al. 2019, Silver et al. 2017, Silver et al. 2018

Asynchronous Methods for Deep Reinforcement Learning

Volodymyr Mnih, Adrià Puigdomènech Badia, Mehdi Mirza, Alex Graves, Timothy Lillicrap, Tim Harley et al. · First public 2016-02-04 (arXiv v1) · Venue: Proceedings of the 33rd International Conference on Machine Learning (ICML 2016), New York, JMLR W&CP vol. 48 · Pages 19 pp. (arXiv v2, incl. supplementary material) · Citations (OpenAlex) 7,126 (checked 2026-11-03)

arXiv · arXiv v2 16 Jun 2016; ICML 2016, New York (Proceedings of the 33rd ICML, JMLR W&CP volume 48, per v2 page 1 footer)

We propose a conceptually simple and lightweight framework for deep reinforcement learning that uses asynchronous gradient descent for optimization of deep neural network controllers.p. 1 (arXiv v2)

What changed. Proposes running multiple actor-learners asynchronously in parallel on multiple environment instances instead of using experience replay, and gives asynchronous variants of four standard RL algorithms including advantage actor-critic (A3C). Reports that the asynchronous actor-critic exceeded the previous Atari state of the art while training on a single multi-core CPU, and also handled continuous motor control and 3D maze navigation.

Cites (within this list): Hochreiter & Schmidhuber 1995, Kingma & Ba 2014, Lillicrap et al. 2015, Mnih et al. 2013, Mnih et al. 2015, Schulman et al. 2015, Sutton & Barto 1998, Watkins 1989, Williams 1992
Cited by (within this list): Christiano et al. 2017, Schulman et al. 2017, Silver et al. 2017, Wang et al. 2023

Concrete Problems in AI Safety

Dario Amodei, Olah, Chris, Jacob Steinhardt, Paul F. Christiano, John Schulman, Dan Mané · First public 2016-06-21 (arXiv v1) · Venue: arXiv preprint arXiv:1606.06565 [cs.AI] · Pages 29 pp. (arXiv v2) · Citations (OpenAlex) 1,313 (checked 2026-11-03)

arXiv · arXiv v2 2016-07-25

In this paper we discuss one such potential impact: the problem of accidents in machine learning systems, defined as unintended and harmful behavior that may emerge from poor design of real-world AI systems.p. 1 (arXiv v2)

What changed. The paper sets out five practical research problems on accident risk in machine learning systems (avoiding side effects, avoiding reward hacking, scalable supervision, safe exploration, distributional shift), reviews prior work on each and proposes experiments.

Cites (within this list): Goodfellow et al. 2014, Graves et al. 2014, Kaelbling et al. 1998, Krizhevsky et al. 2012, McCarthy & Hayes 1969, Mnih et al. 2015, Silver et al. 2016, Sutton & Barto 1998, Szegedy et al. 2013
Cited by (within this list): Bommasani et al. 2021, Christiano et al. 2017

Layer Normalization

Jimmy Lei Ba, Jamie Kiros, Geoffrey E. Hinton · First public 2016-07-21 (arXiv v1) · Venue: arXiv preprint arXiv:1607.06450 [stat.ML] · Pages 14 pp. (arXiv v1) · Citations (OpenAlex) 4,438 (checked 2026-11-03)

arXiv

In this paper, we transpose batch normalization into layer normalization by computing the mean and variance used for normalization from all of the summed inputs to the neurons in a layer on a single training case.p. 1 (arXiv v1)

What changed. The paper introduces layer normalization, which computes normalization statistics from all summed inputs to the neurons of a layer on a single training case, so the computation is identical at training and test time and can be applied at each time step of a recurrent network; experiments report reduced training time.

Cites (within this list): Cho et al. 2014, Graves 2013, Hinton et al. 2012, Ioffe & Szegedy 2015, Kingma & Ba 2014, Krizhevsky et al. 2012, Mikolov et al. 2013, Simonyan & Zisserman 2014, Sutskever et al. 2014
Cited by (within this list): OpenAI 2023, Peters et al. 2018, Radford et al. 2018, Radford et al. 2019, Raffel et al. 2019, Vaswani et al. 2017

WaveNet: A Generative Model for Raw Audio

Aäron van den Oord, Sander Dieleman, Heiga Zen, Karen Simonyan, Oriol Vinyals, Alexander Graves et al. · First public 2016-09-12 (arXiv v1) · Venue: arXiv preprint arXiv:1609.03499 [cs.SD] · Pages 15 pp. (arXiv v2) · Citations (OpenAlex) 4,901 (checked 2026-11-03)

arXiv · arXiv v2 2016-09-19

This paper introduces WaveNet, a deep neural network for generating raw audio waveforms.p. 1 (arXiv v2)

What changed. The paper introduces WaveNet, a fully probabilistic autoregressive model of raw audio waveforms built from dilated causal convolutions, and applies it to text-to-speech, multi-speaker speech generation, music modeling and phoneme recognition.

Cites (within this list): He et al. 2015, Hochreiter & Schmidhuber 1995, Nair & Hinton 2010
Cited by (within this list): Bommasani et al. 2021, Chen et al. 2021

Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation

Yonghui Wu, Mike Schuster, Zhifeng Chen, Quoc Viet Le, Mohammad Norouzi, Wolfgang Macherey et al. · First public 2016-09-26 (arXiv v1) · Venue: arXiv preprint arXiv:1609.08144 [cs.CL] (Google technical report) · Pages 23 pp. (arXiv v2) · Citations (OpenAlex) 5,315 (checked 2026-11-03)

arXiv · arXiv v2 2016-10-08

In this work, we present GNMT, Google’s Neural Machine Translation system, which attempts to address many of these issues.p. 1 (arXiv v2)

What changed. The paper describes GNMT, a production neural machine translation system with an 8-layer LSTM encoder and decoder, residual and attention connections, wordpiece sub-word units, low-precision inference, and beam search with length normalization and a coverage penalty; human side-by-side evaluation showed an average 60% reduction in translation errors against Google's phrase-based system.

Cites (within this list): Bahdanau et al. 2014, Brown et al. 1990, Cho et al. 2014, He et al. 2015, Hochreiter & Schmidhuber 1995, Kingma & Ba 2014, Luong et al. 2015, Schuster & Paliwal 1997, Sennrich et al. 2015, Sutskever et al. 2014
Cited by (within this list): Devlin et al. 2018, Jouppi et al. 2017, Raffel et al. 2019, Shazeer et al. 2017, Stiennon et al. 2020, Vaswani et al. 2017

Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer

Noam Shazeer, Azalia Mirhoseini, Krzysztof Maziarz, Andy Davis, Quoc Viet Le, Geoffrey E. Hinton et al. · First public 2017-01-23 (arXiv v1) · Venue: arXiv preprint arXiv:1701.06538 (cs.LG); International Conference on Learning Representations (ICLR) 2017 · Pages 19 pp. (arXiv v1) · Citations (OpenAlex) 933 (checked 2026-11-03)

arXiv · ICLR 2017 conference poster (Apr 2017; iclr.cc archive poster list, board C13)

We introduce a Sparsely-Gated Mixture-of-Experts layer (MoE), consisting of up to thousands of feed-forward sub-networks.p. 1 (arXiv v1)

What changed. Introduces a Sparsely-Gated Mixture-of-Experts layer in which a trainable gating network selects a sparse combination of up to thousands of feed-forward expert networks for each example. Applies it between stacked LSTM layers, with up to 137 billion parameters, to language modeling and machine translation.

Cites (within this list): Bahdanau et al. 2014, He et al. 2015, Hinton et al. 2012, Hochreiter & Schmidhuber 1995, Ioffe & Szegedy 2015, Jacobs et al. 1991, Kingma & Ba 2014, Krizhevsky et al. 2012, Le et al. 2011, Luong et al. 2015, Sutskever et al. 2014, Wu et al. 2016
Cited by (within this list): Bommasani et al. 2021, Brown et al. 2020, Chowdhery et al. 2022, Fedus et al. 2021, OpenAI 2023, Raffel et al. 2019, Vaswani et al. 2017

In-Datacenter Performance Analysis of a Tensor Processing Unit

Norman Paul Jouppi, Cliff Young, Nishant P. Patil, David A. Patterson, Gaurav Agrawal, Raminder S. Bajwa et al. · First public 2017-04-16 (arXiv v1) · Venue: arXiv:1704.04760 [cs.AR]; published in Proceedings of the 44th Annual International Symposium on Computer Architecture (ISCA '17) · Pages 17 pp. (arXiv v1) · Citations (OpenAlex) 4,535 (checked 2026-11-03)

DOI · ISCA 2017, Toronto, 24-28 Jun 2017 (Crossref published-print 2017-06-24, proceedings pp. 1-12)

Despite low utilization for some applications, the TPU is on average about 15X - 30X faster than its contemporary GPU or CPU, with TOPS/Watt about 30X - 80X higher.p. 1 (arXiv v1)

What changed. Described the Tensor Processing Unit, a custom ASIC deployed in Google datacenters since 2015 for neural-network inference and built around a 65,536-MAC 8-bit matrix multiply unit, and compared it with a Haswell CPU and an Nvidia K80 GPU on production MLP, CNN and LSTM workloads.

Cites (within this list): Krizhevsky et al. 2012, Silver et al. 2016, Szegedy et al. 2014, Wu et al. 2016
Cited by (within this list): Bommasani et al. 2021, Hoffmann et al. 2022, Silver et al. 2017, Silver et al. 2018

Deep reinforcement learning from human preferences

Paul F. Christiano, Jan Leike, Brown, Tom B., Miljan Martic, Shane Legg, Dario Amodei · First public 2017-06-12 (arXiv v1) · Venue: Advances in Neural Information Processing Systems 30 (NIPS 2017); arXiv:1706.03741 · Pages 17 pp. (arXiv v4) · Citations (OpenAlex) 1,058 (checked 2026-11-03)

arXiv · arXiv v2 2 Jul 2017; v3 13 Jul 2017; v4 17 Feb 2023; NIPS 2017 (Advances in Neural Information Processing Systems 30)

Our approach is to learn a reward function from human feedback and then to optimize that reward function.p. 2 (arXiv v4)

What changed. Fits a reward model to non-expert human preferences between pairs of short trajectory segments while simultaneously training a policy on the predicted reward, so deep RL agents can be trained without access to the true reward function. Shows Atari games and MuJoCo locomotion tasks learned with feedback on less than 1% of agent interactions, and novel behaviors learned from about an hour of human time.

Cites (within this list): Amodei et al. 2016, Mnih et al. 2013, Mnih et al. 2015, Mnih et al. 2016, Schulman et al. 2015, Silver et al. 2016
Cited by (within this list): DeepSeek-AI 2025, OpenAI 2023, Ouyang et al. 2022, Stiennon et al. 2020

Attention Is All You Need

Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez et al. · First public 2017-06-12 (arXiv v1) · Venue: Advances in Neural Information Processing Systems 30 (NIPS 2017), Long Beach; arXiv:1706.03762 · Pages 15 pp. (arXiv v7) · Citations (OpenAlex) 120,404 (checked 2026-11-03)

arXiv · arXiv v2 2017-06-19; v3 2017-06-20; v4 2017-06-30; v5 2017-12-06; NIPS 2017 (Dec 2017); v6 2023-07-24; v7 2023-08-02

We propose a new simple network architecture, the Transformer, based solely on attention mechanisms, dispensing with recurrence and convolutions entirely.p. 1 (arXiv v7)

What changed. The paper proposes the Transformer, a sequence transduction architecture built only on attention (scaled dot-product and multi-head attention) without recurrence or convolution; it reports 28.4 BLEU on WMT 2014 English-to-German and 41.8 BLEU on English-to-French, and applies the model to English constituency parsing.

Cites (within this list): Ba et al. 2016, Bahdanau et al. 2014, Cho et al. 2014, Graves 2013, He et al. 2015, Hochreiter & Schmidhuber 1995, Kingma & Ba 2014, Luong et al. 2015, Sennrich et al. 2015, Shazeer et al. 2017, Srivastava et al. 2014, Sutskever et al. 2014, 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, Devlin et al. 2018, Dosovitskiy et al. 2020, Fedus et al. 2021, Hoffmann et al. 2022, Jumper et al. 2021, Kaplan et al. 2020, Kojima et al. 2022, Lewis et al. 2020, OpenAI 2023, Packer et al. 2023, Radford et al. 2018, Radford et al. 2019, Radford et al. 2021, Raffel et al. 2019, Stiennon et al. 2020, Touvron et al. 2023, Wei et al. 2022

Proximal Policy Optimization Algorithms

John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, Oleg Klimov · First public 2017-07-20 (arXiv v1) · Venue: arXiv preprint arXiv:1707.06347 (cs.LG), OpenAI · Pages 12 pp. (arXiv v2) · Citations (OpenAlex) 10,618 (checked 2026-11-03)

arXiv · arXiv v2 2017-08-28 (version read; PDF stamp 28 Aug 2017); no peer-reviewed venue found

We propose a novel objective with clipped probability ratios, which forms a pessimistic estimate (i.e., lower bound) of the performance of the policy.p. 1 (arXiv v2)

What changed. Proposes proximal policy optimization (PPO), a family of policy gradient methods that alternate between sampling data and optimizing a surrogate objective with clipped probability ratios over multiple epochs of minibatch updates. Tests it on simulated robotic locomotion and Atari game playing against other policy gradient methods.

Cites (within this list): Kingma & Ba 2014, Mnih et al. 2015, Mnih et al. 2016, Schulman et al. 2015, Williams 1992
Cited by (within this list): DeepSeek-AI 2025, Nakano et al. 2021, OpenAI 2023, Ouyang et al. 2022, Stiennon et al. 2020, Wang et al. 2023

Mastering the game of Go without human knowledge

David Silver, Julian Schrittwieser, Karen Simonyan, Ioannis Antonoglou, Aja Huang, Arthur Guez et al. · First public 2017-10-19 (journal (online publication)) · Venue: Nature 550(7676) · Pages 354–359 (journal); author manuscript 42 pp. · Citations (OpenAlex) 9,080 (checked 2026-11-03)

DOI · Nature issue 2017-10-19 (vol. 550, no. 7676)

Here, we introduce an algorithm based solely on reinforcement learning, without human data, guidance, or domain knowledge beyond game rules.p. 1 (author manuscript)

What changed. The paper introduces AlphaGo Zero, trained only by self-play reinforcement learning from random play with a single neural network that takes the board stones as input and a tree search without Monte Carlo rollouts; it won 100-0 against the previously published AlphaGo.

Cites (within this list): Coulom 2006, Fukushima 1980, He et al. 2015, Ioffe & Szegedy 2015, Jouppi et al. 2017, Kocsis & Szepesvári 2006, Krizhevsky et al. 2012, LeCun et al. 2015, Mnih et al. 2015, Mnih et al. 2016, Silver et al. 2016, Sutton 1988, Sutton & Barto 1998
Cited by (within this list): DeepSeek-AI 2025, Schrittwieser et al. 2019, Silver et al. 2018, Yao et al. 2023