Deep learning techniques fell into place one after another, and AI beat top professionals at Go and shogi. Predictions flew around: 47%, within 5 years, 2045. In Japan, the name "the third AI boom" spread. This chapter checks what became possible, what was said, and what happened, using original sources and interactive figures.
012015 · Training tricks
Evening out each layer's inputs
Why were networks with 10 or 20 stacked layers so hard to train?
A deep network fixes its weights by sending the output error back toward the input (backpropagation, Chapter 8). On the way back, the signal is multiplied at every layer by the weight and by the slope of the neuron. The S-shaped sigmoid function has a slope of 0.25 or less, so the slopes alone shrink the signal to about one-millionth over 10 layers.
Chapter 9 covered the 2010–2012 tricks of ReLU and weight initialization. In 2015, batch normalization by Sergey Ioffe and Christian Szegedy of Google rescales the values entering a layer to mean 0 and variance 1, separately for each small batch of data learned at one time. The figure on the right measures a 20-layer network: the spread of values going forward (blue) and the signal coming back (purple). Switch between ReLU, weight initialization, and batch normalization to compare them.
returning signal ≈ signal at the output × (w₁·f′₁) × (w₂·f′₂) × … × (wL·f′L)
f′
slope of the neuron (0.25 or less for sigmoid, 0 or 1 for ReLU)
w
weight
L
number of layers
What you think you knowThe popular story:Batch normalization works because it fixes the shifting distribution of values entering a layer The original source says:The paper thought so, and reported reaching the same accuracy with 14 times fewer training steps. A 2018 MIT paper put in its title, and reported that networks still trained about as well even when the distributions were deliberately shifted. Why it works is still not settled.
What happened to ReLU and weight initialization
In 2011, Xavier Glorot and colleagues at the University of Montreal wrote that deep networks can learn well even without pre-training that uses no correct answers. The 2012 AlexNet paper reported learning several times faster than with tanh. The weight initialization made for ReLU was proposed by Kaiming He and colleagues in 2015. The names, and the story of Kunihiko Fukushima's activation function of the same shape in 1968, are in Chapters 9 and 4.
Sources & confidence (1)Evening out each layer's inputs
11 February 2015Verified in the original
Batch Normalization: rescale the values entering a layer to mean 0 and variance 1 for each batch of examples, so that training goes faster (2015)
Batch normalization is a method that builds into a network a step that rescales the values entering a middle layer so that, for each group of data used at one time in training (a mini-batch), the mean is 0 and the variance is 1, and then restores the scale and offset with two learned numbers, γ and β (scale and shift). Google's Ioffe and Szegedy thought that learning is slowed because the distribution of values entering the next layer changes every time the weights of the previous layer change (the paper named this internal covariate shift). They wrote that with this method the learning rate can be made much larger, less care is needed in choosing the initial weights, and in some cases dropout is no longer needed. In an image recognition network, it reached the same accuracy with 14 times fewer training steps. For the combined networks, they reported an error of 4.9% on ImageNet's top-5 rule (4.8% on the test set) and wrote that this exceeded the accuracy of the human raters.
The popular story:People say “batch normalization works because it reduces the shift in the distribution of values entering a layer (internal covariate shift)” (the 2015 paper's own title says so) The original source says:a 2018 MIT paper put in its title, and reported that even when noise with a non-zero mean and non-unit variance, changing at every step, was deliberately added after batch normalization to shift the distribution, training went almost as well. Instead, it wrote that what helps is making the landscape of the error against the correct answers (the optimization landscape) smoother. It is an example of the explanation of why a method works being questioned after the method became widely used.
What we still don’t know:Why batch normalization works is still being researched after the 2018 paper, and it cannot be said to be settled (papers later than 2018 have not been opened yet).
What the figure shows:The returning signal is multiplied by slope × weight at each layer, so multiplying by sigmoid slopes of 0.25 or less 20 times leaves it almost 0 when it reaches the input. ReLU, starting weights, and batch normalization were ways to stop those products from becoming too small.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_vanishing_signal.py
022012–2015 · Overfitting
Dropout and knowledge distillation
How can we prevent overfitting, where a model fits the training data too well?
A model gets every training example right but gets new data wrong. This is called overfitting. Dropout (2012, seen in Chapter 9) randomly rests half of the hidden-layer neurons every time it shows the network one example. The effect is close to averaging many thin networks.
In the figure on the right, fit a curve to 12 points (an example made for this site). If you rest no neurons, the error on new points (blue circles) keeps growing.
Knowledge distillation (2015) makes a small network imitate the probabilities that a large network outputs after they are softened with a temperature T. In "Knowledge distillation", raise T and you can see the differences among the wrong answers. The paper's view is that there is knowledge in those, too.
softened answer qi =exp(zi/T) ÷ Σj exp(zj/T)
zi
score of output i
T
temperature (1 gives ordinary probabilities; larger means flatter)
What you think you knowThe popular story:Knowledge distillation was started by Geoffrey Hinton and colleagues in 2015 The original source says:The 2015 paper itself says that one form of the same method had been pioneered earlier, in 2006, by Rich Caruana and colleagues.
The distillation experiment
According to the 2015 paper by Geoffrey Hinton, Oriol Vinyals and Jeff Dean, a small network was distilled on handwritten digits without being shown a single image of a 3. After the bias for 3 was adjusted, it still got 98.6% of the test 3s right.
How dropout is handled at prediction time (use all neurons and halve the output weights) and how the idea came about are in Chapter 9.
Sources & confidence (1)Dropout and knowledge distillation
9 March 2015Verified in the original
Knowledge distillation: having a small model imitate the of a large model (2015)
Knowledge distillation is a method for transferring the knowledge learned by a large, heavy network, or by an ensemble of many networks, into a small, light network. The probabilities output by the large network are smoothed by raising the temperature T of the softmax (a function that turns scores into probabilities), and the small network is trained to reproduce these soft targets. The soft targets also contain the differences in probability among the wrong answers (in the paper's example, the probability of mistaking an image of a BMW for a garbage truck is very low, but many times larger than the probability of mistaking it for a carrot), and this gives clues about how the large network generalizes. A March 2015 paper by Hinton, Vinyals and Dean of Google reported that, in a handwritten-digit experiment, even when the small network was distilled without being shown a single image of a 3, it could correctly classify 98.6% of the 3s in the test set once the bias value for 3 was adjusted. In an experiment with an (older version of) Android's voice search model, it states that more than 80% of the accuracy gained by an ensemble of 10 networks could be transferred to a single distilled network. The paper begins with an analogy to insects, whose body structure differs between larva and adult, to argue that the form of a network may differ between training and use.
The popular story:People say “knowledge distillation was invented by Hinton and colleagues in 2015” The original source says:the 2015 paper itself notes that one form of this approach had been pioneered earlier by Rich Caruana and colleagues. The Caruana-group paper (Bucilă, Caruana and Niculescu-Mizil, Model Compression, 2006) had an ensemble of many models label generated pseudo data, and trained a small network on it. This kept performance almost the same while making the model 1000 times smaller and 1000 times faster. What is new in the 2015 paper is the use of soft targets smoothed by temperature, the name distillation, and the view that knowledge is also contained in the probabilities of the wrong answers.
What we still don’t know:We have not yet checked in the original sources how widely knowledge distillation is used today for small AI that runs on devices such as smartphones.
Model Compression (KDD’06, pp. 535-541) (Cristian Bucilă, Rich Caruana, Alexandru Niculescu-Mizil · 2006 · PDF page 1 Abstract and 1. Introduction (summary on pdf_page 7) · Original source)
What the figure shows:Fitting training points too closely causes large errors on new points, while randomly resting half the neurons each time keeps the curve smooth and helps it match new points. In knowledge distillation, probabilities for answers other than the correct one also contain knowledge about which answers are similar.
Error on the points it learned (solid line) and on new points (dotted line). Blue = no neurons rested, green = network 2. The vertical axis goes up by factors of 10
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_dropout.py
032013 · Word vectors
Adding words
If we turn words into sets of numbers, can we even compute relationships between meanings?
In 2013, word2vec by Tomas Mikolov and colleagues at Google represents each word as a set of a few hundred numbers (a vector). It learns from a huge amount of text so that words used in similar ways end up close together. From 1.6 billion words it produced 300-dimensional vectors for 1 million words, using a single CPU in less than a day.
The resulting vectors could express relationships of meaning through addition and subtraction. The paper measured performance by the accuracy on questions such as whether biggest − big + small comes out as smallest. In the figure on the right (a 2-dimensional example made for this site), press three words.
The answer was the closest word after excluding the three words of the question (a note added in the September version of the paper). Without the exclusion, this example would return small as the top result.
v(answer) ≈ v(biggest) − v(big)+v(small)
v(word)
the vector of that word
answer
the word nearest to the computed point (excluding the three words of the question)
What you think you knowThe popular story:king − man + woman = queen is a calculation the word2vec paper discovered, and it gives exactly that answer The original source says:The January 2013 paper itself cites this example as a result from earlier work. The answer was found by removing the three words of the question from the candidates.
Two methods
CBOW guesses the middle word from the words around it, and Skip-gram guesses the surroundings from the middle word. The follow-up paper in October also showed an example where adding the vectors for Russia and river lands near Volga River.
A long history: The idea of turning words into sets of numbers is old, and the paper cites the neural networks of David Rumelhart and colleagues (1986), Elman (1990), and Yoshua Bengio and colleagues (2003).
Sources & confidence (1)Adding words
16 January 2013Verified in the original
word2vec: turning words into vectors so that closeness of meaning and relationships can be calculated (2013)
word2vec is a method, and a program, that represents each word as a set of a few hundred numbers (a vector). It is trained on large amounts of text so that words used in similar ways come close together. Tomas Mikolov and colleagues at Google published it in 2013. There are two designs. CBOW predicts the middle word from the surrounding words, and Skip-gram is trained to predict the words before and after from the middle word. Compared with earlier neural-network language models (such as the 2003 paper by Bengio and colleagues), it lightened the computation by removing the nonlinear processing in the hidden layer. They state that vectors with 300 dimensions for 1 million words could be built from a 1.6 billion-word data set in less than a day on a single CPU. With these vectors, relationships between words can be expressed by addition and subtraction. The paper measured performance by how often the word nearest to the vector biggest − big + small was smallest. The follow-up paper in October added tricks to train Skip-gram quickly (such as negative sampling) and the handling of phrases like Air Canada. It also showed an example in which adding the vectors for Russia and river gives something close to Volga River. The program was released under the name word2vec.
The popular story:People tend to say “king − man + woman = queen was a calculation discovered by the word2vec paper, and the answer comes out exactly from just adding and subtracting vectors” The original source says:The January 2013 paper itself cites this example as a result of earlier work (the paper by Mikolov and Zweig, reference [14]). The September version of the paper also added a note that, when searching for the answer, the words used in the question itself (biggest, big and small for biggest − big + small) are excluded from the candidates (the first January version does not have this note). The answer was not the word nearest to the computed vector, but the nearest word after removing the three words of the question. The idea of representing words as sets of numbers is not new either. The paper writes that this idea has a long history, citing Rumelhart and colleagues in 1986 and Elman in 1990, and gives the 2003 neural network of Bengio and colleagues as a commonly used form.
What we still don’t know:I have not yet checked in the original sources how the answers change if the three words of the question are not excluded from the candidates (whether the nearest word is often the word in the question itself). I have also not checked at which 2013 conference word2vec was presented.
What the figure shows:Representing words as groups of numbers makes the change to a superlative follow almost the same arrow for each word, so biggest − big + small lands near smallest. However, the answer was selected after excluding the 3 words in the question.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_skipgram.py
042013–2015 · Reinforcement learning
Learning to play from the score alone
Can a program get good at a game from the screen and the score alone, without being taught the rules?
Reinforcement learning is a way of learning by trial and error, increasing the actions that led to points. Q-learning tabulates how many points you can expect in the future if you act a certain way in a certain state (the Q-value), and updates the table a little with every action. In the maze on the right (an example made for this site), watch the goal's reward spread back one step at a time to the squares before it.
In December 2013, DQN from DeepMind in London used a convolutional neural network instead of a table. It took the screen's pixels as input as they were, and learned with a modified version of Q-learning. Out of seven classic video games, it beat earlier methods in 6 and human experts in 3. The 2015 paper in Nature learned 49 games with one and the same setup.
What you think you knowThe popular story:AI surpassed humans at video games The original source says:The 2015 paper's wording is that performance was games. It reached 75% or more of the human score in 29 of the 49 games. The paper itself says that games requiring long-term planning (such as Montezuma's Revenge) remain a big challenge.
One more trick
Store past experience, then pull it out at random and learn from it again (experience replay). The paper wrote that this evens out the bias in the training data.
DeepMind and Google: In January 2014, it was reported that Google would buy DeepMind. The parties did not disclose the price, and reports split between $400 million and more than $500 million. The affiliation on the 2015 paper was Google DeepMind.
Sources & confidence (2)Learning to play from the score alone
19 December 2013–2015Verified in the original
An AI that learns to play video games just by looking at the screen (DeepMind's DQN, 2013 and 2015)
In December 2013, DeepMind Technologies (whose address in the 2015 paper is London, UK) announced an AI that plays , golden-oldie video games. Using only the pixels on the screen and the score as clues, it learns by combining reinforcement learning, which improves through trial and error, with deep learning. It beat earlier methods in 6 of 7 games, and exceeded a skilled human player in 3. In a paper in the journal Nature in February 2015 (affiliation: Google DeepMind), the same single system was trained on 49 games and became about as strong as a professional game tester. In 29 games it scored at least 75% of the human score.
The popular story:People tend to say “AI surpassed humans at video games” The original source says:The paper's wording is performance games, and the games where it reached 75% or more of the human score were 29 of the 49. The paper itself writes that games that need planning far ahead (such as Montezuma’s Revenge) remain a major challenge for any method, including DQN
26 January 2014Confirmed in summariesSources disagree
Google buys DeepMind, an AI company in London (2014)
In January 2014 it was reported that Google would acquire DeepMind, an AI company in London. Google confirmed the acquisition to Re/code and DeepMind confirmed it to TechCrunch, but they did not disclose the price. DeepMind is a company founded by Demis Hassabis, Shane Legg and Mustafa Suleyman (TechCrunch's wording). In later papers the affiliation became “Google DeepMind” (the 2015 DQN paper).
3 sources and how they were checked
Where sources disagree:Acquisition price: Re/code (reprinted by CNBC) said $400 million, while TechCrunch, citing a report by The Information, said “more than $500 million”. The parties have not disclosed the price.
What the figure shows:Without teaching rules, giving only +1 at the goal and −1 at a hole lets repeated trials carry the goal's score back 1 square at a time, finding a path all the way to the starting point.
Result of each episode (green = reached the goal, purple = fell in a hole, gray = timed out)
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_q_learning.py
052013–2014 · Transfer learning
Reusing a network that has learned
Can deep learning be used for a job that has only a few dozen photos?
AlexNet (2012) was trained on about 1.2 million images in 1000 categories from the ImageNet competition. In October 2013, DeCAF by Jeff Donahue and colleagues at the University of California, Berkeley kept the weights of a network of the same shape fixed, and used the responses of a layer near the output (4096 numbers) as features for a different job. On Caltech-101, which has only 30 training images per category, simply putting a linear classifier on top got 86.9% right, beating the best result of the time, which combined five hand-made kinds of features. This is called transfer learning.
Fine-tuning means retraining the whole network on the new job's data with small steps. In the next spread, on R-CNN, fine-tuning raised mAP by 8 points.
The figure on the right (an 8×8 example made for this site) takes a network trained to recognize one line and uses it to recognize a pair of two lines. Change the number of examples and compare.
new answer=softmax( Wnew · φ(x) )
φ(x)
responses of the layers learned earlier (4096 numbers in DeCAF; unchanged if fixed)
Wnew
the new final layer that is trained
What you think you knowThe popular story:Transfer learning is an idea born in the age of deep learning The original source says:A 2010 article in the Journal of the Japanese Society for Artificial Intelligence says (translated), and says it became a field of machine learning after a 1995 NIPS workshop. The DeCAF paper itself also counts the history of learning from related tasks from 1996–1997.
Measuring one layer at a time
In 2014, Jason Yosinski and colleagues split ImageNet into A and B, 500 categories each (about 645,000 images each), and copied the lower layers trained on A over to B. Layers 1–2 could be used almost as they were. For layers 3–5, performance fell because the fragile co-adaptation with neighboring layers was cut, and for layers 6–7 the specialization to task A got in the way. After copying and fine-tuning, the network got on average 1.6% more right than one trained from scratch on B. The result was not explained by the view that this only makes up for a lack of data.
Training from scratch: In 2018, Kaiming He and colleagues at FAIR reported that on COCO object detection, training from scratch catches up with pre-training if you train long enough. But with only 1000 training images, pre-training scored 9.9 and training from scratch scored 3.5 (AP).
Around the same time: In March 2014, Ali Sharif Razavian and colleagues at KTH in Sweden also simply put a linear SVM on features from the public network OverFeat, and tried it on scenes, fine-grained categories, image retrieval, and more.
In Japan at the time: The 2010 article by Toshihiro Kamishima (National Institute of Advanced Industrial Science and Technology) also introduces research on negative transfer, where using the original data makes predictions worse.
Sources & confidence (5)Reusing a network that has learned
6 October 2013–2014Verified in the original
DeCAF: freezing the middle layers of a CNN trained on ImageNet and reusing them as features for other tasks (Donahue et al., 2013–2014)
In October 2013, Jeff Donahue, Yangqing Jia and 5 others at the University of California, Berkeley and ICSI froze the weights of a CNN trained on ImageNet's 1,000-class classification (the network structure of Krizhevsky and colleagues, 2012). They then tested whether the responses of its middle layers could be used as features (DeCAF) for other tasks. Just by putting a linear classifier on top of the layer near the output (DeCAF6, 4,096 numbers), it got 86.9% right on Caltech-101 with 30 training images per class, beating the then best result, which combined five handcrafted features, by 2.6%. Even with just 1 image per class it got 33.0%. It also beat the then best on scene recognition (SUN-397, 40.94%) and on identifying bird species. The CNN layers were not fine-tuned, and they released it, including the network's weights, as software anyone can use.
The popular story:People tend to say that deep learning needs a huge amount of data for each task it is used for (the way people talk about it is this site's estimate) The original source says:DeCAF froze and used the middle layers of a network trained on other, large data, and got 86.9% on Caltech-101 from 30 images per class (33.0% even with 1). However, that network itself had been trained on the huge number of photos of the ImageNet competition. Large amounts of data did not become unnecessary; a model trained once elsewhere was reused.
Measuring, one layer at a time, how far up a deep network its features can be moved to another task (Yosinski et al., 2014)
In November 2014, Jason Yosinski of Cornell University, Jeff Clune of the University of Wyoming, Yoshua Bengio of the Université de Montréal and Hod Lipson of Cornell University measured, one layer at a time, how many layers of a deep network hold general features that are useful for any task. They randomly split the 1,000 ImageNet categories into two sets, A and B, of 500 categories each (about 645,000 images each). They copied the bottom n layers of an 8-layer network trained on A into a network for B, and trained the rest on B. Layers 1–2 could be moved almost as they were. For layers 3–5, performance dropped because features that had been fragilely co-adapted with their neighboring layers were split apart. For layers 6–7, the main cause of the drop was that the features were specialized to task A. When the copied layers were also fine-tuned on B, accuracy was higher by 1.6% on average (2.1% when 5 or more layers were copied) than for a network trained from scratch on B alone.
The popular story:Reusing a trained network (transfer learning) is often said to be a trick for when data is scarce (this way of putting it is this site's own guess) The original source says:the paper also says its first aim is to train a large network on a small dataset without overfitting. It then reports that a network that was copied and fine-tuned beat one trained from scratch on the same roughly 645,000 images, so the method works even when there is plenty of data (it also notes that each data point takes 9.5 days on a GPU, so there are few points).
What we still don’t know:As for why the effect of the earlier training remains even after fine-tuning, the paper stops at a plausible explanation: the influence of having seen the original data remains.
Trying many kinds of image recognition with only the features of a trained CNN (Razavian et al., 2014)
In March 2014, Ali Sharif Razavian, Hossein Azizpour, Josephine Sullivan and Stefan Carlsson of KTH (the Royal Institute of Technology) in Sweden took features of 4,096 numbers from OverFeat, a public model trained on ILSVRC13 classification. Just by putting a linear SVM on top of them, they tried tasks that move step by step away from the original task: object classification, scene recognition, fine-grained recognition, attribute recognition and image retrieval. They wrote that on the classification tasks it beat all the carefully tuned state-of-the-art methods of the time, and concluded that the features of a deep CNN should be the first candidate for most image recognition tasks.
21 November 2018Verified in the originalSources disagree
Can Object Detection Models Be Trained from Scratch Without ImageNet Pretraining? A Test (He et al., 2018)
In November 2018, Kaiming He, Ross Girshick and Piotr Dollár of Facebook AI Research (FAIR) re-examined whether the combination of ImageNet pretraining and fine-tuning is really needed for object detection. On COCO object detection and region segmentation, models whose weights were initialized randomly (from scratch) reached results no worse than pretrained and fine-tuned models if trained for more iterations. The same held even when the COCO training images were reduced to 10%. The benefit of pretraining was that it speeds up early training. However, with only 1,000 training images, training from scratch scored 3.5 against 9.9 with pretraining (scores are AP), far lower (with 3,500 images, 16.0 and 9.3 respectively).
The popular story:At the time, the common belief was that object detection networks cannot be trained well without ImageNet pretraining (the paper itself calls this conventional wisdom) The original source says:With long enough training, training from scratch caught up. But the paper does not say ImageNet is useless. To the question of whether pretraining is essential, it answers that it is not needed if the target data (and computing) are sufficient, and to the question of whether it is useful, it answers yes (it shortens training time and helps when data are scarce). On PASCAL VOC (15,000 training images), the 77.6 from scratch did not catch up with the 82.7 with pretraining.
What we still don’t know:How much target data is needed before pretraining is no longer required depends on the task. For COCO, the paper's estimate puts it between 3,500 and 10,000 images.
1 sources and how they were checked
Where sources disagree:The AP of a neural network trained from scratch on 1,000 training images has two values within the same paper: 3.5 in the main text (PDF page 7) and 3.4 in the caption of Figure 8 (PDF page 8). The site does not choose between them; it uses the 3.5 from the main text and leaves this discrepancy in the notes.
In an explanatory article in the Journal of the Japanese Society for Artificial Intelligence, Toshihiro Kamishima summarizes transfer learning in Japanese (2010)
In July 2010, Toshihiro Kamishima of the National Institute of Advanced Industrial Science and Technology summarized the ideas and methods of transfer learning in Japanese in an explanatory article in the Journal of the Japanese Society for Artificial Intelligence. Transfer learning is a method that takes from data that is related but partly different only the knowledge that is also useful for the target problem, and so obtains more accurate prediction rules. He laid out that similar ideas have been called by many names, such as inductive transfer, domain adaptation, multitask learning and learning to learn. He also introduced research on neural networks that share their middle layers across several tasks (Caruana, 1997), and research on negative transfer, where using the original data actually lowers prediction accuracy.
The popular story:Transfer learning, which applies knowledge learned in one task to another, is easily thought to be an idea born in the deep-learning boom (the way people talk about it is this site's estimate) The original source says:This 2010 article writes that (translated) and says it came to be recognized as a field of machine learning from a 1995 NIPS workshop. It is a Japanese-language explanation from before deep learning's image results (2012).
What the figure shows:Reusing layers trained extensively on another task can give correct results with only a few examples of a new task. As examples increase, learning from scratch catches up.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_transfer_finetune.py
062013–2015 · Object detection
What is where, and how many?
How can we draw boxes around things in a photo and give them names?
Image classification gives one answer per image. Object detection draws a box around each object in a photo and names it.
In November 2013, R-CNN by Ross Girshick and colleagues at the University of California, Berkeley made about 2000 candidate boxes with a method that does no learning, passed them through a CNN one by one, and scored each with an SVM for each category. Many boxes remain around the same object, so boxes that overlap a high-scoring box a lot are removed (non-maximum suppression). The conference version reached an mAP of 53.3% on PASCAL VOC 2012, far above the previous best, but it took 13 seconds per image on a GPU.
In June 2015, YOLO by Joseph Redmon and colleagues at the University of Washington divides the image into a 7×7 grid and outputs two boxes per cell (98 in all) together with the categories, in a single pass of the network. It ran at 45 images per second with 63.4%. Faster R-CNN, by Shaoqing Ren and colleagues the same month, lets the network make the candidates too, at 5 images per second with 73.2%. Compare them in the figure on the right.
IoU=overlapping area ÷ combined area
IoU
how much the predicted box and the correct box overlap (1 is a perfect match, 0 is no overlap)
What you think you knowThe popular story:YOLO was the first to find objects in real time The original source says:The YOLO paper itself names DPM, which was already running at 30 images per second (Sadeghi and Forsyth, 2014). YOLO's claim was that, among real-time methods, accuracy more than doubled (26.1% → 63.4%). Fast R-CNN, at 0.5 images per second (70.0%), was more accurate, and YOLO made more errors in position.
Inside R-CNN
The name comes from Regions with CNN features. Candidate generation (selective search) and the SVM were tools from earlier computer vision, and the paper's conclusion says of old tools and deep learning, . As an early attempt to build features in stages, the paper also cites Kunihiko Fukushima's Neocognitron (1980). Candidates were warped to 227×227 before going through the CNN. The first version (November 2013) scored 48% on VOC 2007, which went up in the conference version.
YOLO's weak points: By the YOLO paper's standard, a detection is correct if the category is right and the IoU is greater than 0.5. YOLO can output only two boxes and one category per grid cell, so the paper itself says it struggles with groups of small objects, such as flocks of birds. The first version (June 2015) had 49 boxes in all.
Faster R-CNN's candidates: Shaoqing Ren and colleagues at Microsoft Research place 9 reference boxes (anchors), 3 sizes × 3 aspect ratios, at each position of the feature map, and the network outputs how object-like each is and a correction to its position. There are 300 candidates per image. In the 2015 COCO object detection challenge, this combined with ResNet took first place.
In Japan at the time: In 2017, people at the University of Tokyo and Preferred Networks released ChainerCV, a library for training Faster R-CNN and SSD with Chainer, and reproduced 70.5% against the 69.9% in the Faster R-CNN paper.
Sources & confidence (4)What is where, and how many?
11 November 2013Verified in the original
R-CNN: making about 2,000 candidate regions, turning each into features with a CNN, and detecting objects (Girshick et al., 2013–2014)
In November 2013, Ross Girshick, Jeff Donahue, Trevor Darrell and Jitendra Malik of the University of California, Berkeley (shown as UC Berkeley in the paper) and ICSI brought the CNN (convolutional neural network), which had shown its power in image classification, to object detection. Object detection is the technology of drawing a rectangle (a bounding box) around each object in an image and identifying its kind. First, selective search, which involves no learning, makes about 2,000 candidate rectangles per image where an object might be; each is warped to 227×227 pixels and passed through the CNN to become a 4,096-dimensional feature. A linear SVM for each class turns that into a score, and rectangles that overlap a higher-scoring rectangle of the same class by a large amount (IoU: overlapping area ÷ combined area) are removed (non-maximum suppression). The CNN was first pre-trained on ImageNet classification (ILSVRC 2012) and then fine-tuned on detection data. In the conference version (CVPR 2014), it reached an mAP (mean average precision) of 53.3% on PASCAL VOC 2012, more than 30% better in relative terms than the previous best. On the other hand, computing the candidates and features took 13 seconds per image on a GPU and 53 seconds on a CPU.
The popular story:People tend to think R-CNN detected objects from start to finish with deep learning (neural networks) alone (the way people talk about it is this site's estimate) The original source says:The candidate boxes were made by selective search, which does not learn, and the scoring was done by a linear SVM; the CNN only produced the features. In its conclusion, the paper writes that classical computer vision methods and deep learning are not opposing streams of research, and that (translated). The paper also names Kunihiko Fukushima's Neocognitron (1980) as an early example of a mechanism that builds features in a hierarchy.
YOLO: split an image into a 7×7 grid and detect position and type together in a single network pass (Redmon et al., 2015–2016)
In June 2015, Joseph Redmon and colleagues at the University of Washington presented YOLO (You Only Look Once), which solves object detection with one computation of one neural network. The image is resized to 448×448 pixels and split into a 7×7 grid, and for each cell the network outputs 2 boxes with their confidence and the probabilities of 20 classes at the same time (the output is 7×7×30 numbers, and there are 98 boxes in total; R-CNN has about 2,000 region proposals). Because it does not process the detection of candidate regions and their classification separately, it is fast. In the conference (CVPR 2016) version, using a Titan X GPU, it reached an mAP of 63.4% on PASCAL VOC 2007 at 45 images per second. The small version, Fast YOLO, got 52.7% at 155 images per second. By comparison, in the same paper Fast R-CNN got 70.0% at 0.5 images per second. YOLO made more localization errors (19.0% of top predictions had localization errors, against 8.6% for Fast R-CNN), but it less often mistook background for an object (4.75% against 13.6%).
The popular story:YOLO is often thought to be the first method to detect objects in real time (this way of putting it is this site's own guess) The original source says:the paper itself names, as an earlier real-time method (30 or more images per second), the 30Hz DPM of Sadeghi and Forsyth from 2014 (30 images per second, mAP 26.1%). YOLO's claim was that, among real-time methods, accuracy more than doubled (63.4%). In accuracy alone, Fast R-CNN in the same table (0.5 images per second, 70.0%) is higher. Also, although it is called one look, it uses non-maximal suppression to tidy up overlapping boxes, which according to the paper improves mAP by 2–3%.
Faster R-CNN: the candidate boxes are also made by a network, speeding up object detection (Ren et al., 2015)
In June 2015, Shaoqing Ren, Kaiming He, Ross Girshick and Jian Sun of Microsoft Research presented Faster R-CNN. It is a method that has a network also do the creation of candidate boxes, which had been the cause of slowness in the R-CNN line of work. A small network (the RPN, region proposal network) that shares the CNN features of the whole image with object recognition outputs, for each of 9 reference boxes (anchors: 3 sizes × 3 aspect ratios) on the feature map, an objectness score and a position correction. With VGG-16 and 300 candidates per image, the whole pipeline ran on a GPU at 5 images per second and recorded an mAP of 73.2% on PASCAL VOC 2007. According to the paper, selective search, which had been widely used until then, took 2 seconds per image on a CPU.
The popular story:Faster R-CNN is often thought to be real-time object detection (this way of putting it is this site's own guess) The original source says:the paper's title says Towards Real-Time, and with VGG-16 it ran at 5 images per second. The YOLO paper says that neither Fast R-CNN nor Faster R-CNN has yet reached real time, and gives 18 images per second even for Faster R-CNN with the small ZF network.
ChainerCV: People at the University of Tokyo and Preferred Networks Release a Library of Parts That Runs Object Detection on Chainer as in the Papers (2017)
In August 2017, Yusuke Niitani and Toru Ogawa of the University of Tokyo and Shunta Saito and Masaki Saito of Preferred Networks wrote a paper on ChainerCV, a collection of parts for using object detection and region segmentation networks together on Chainer, a deep learning tool. It even includes programs that train Faster R-CNN and SSD (a different, single-shot detection method) to reach the same performance as in the original papers. On PASCAL VOC 2007 mAP, they reported 70.5% for Faster R-CNN against 69.9% in the original paper, and 77.5% for SSD300 against 77.5%. They also implemented non-maximum suppression, which removes overlapping detection boxes, to run on a GPU.
What the figure shows:R-CNN was slow because it created about 2000 candidate rectangles and checked them 1 by 1. YOLO divided the image into a grid and produced all rectangles together in 1 network pass, making it fast, though it made more location errors.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_object_detect.py
072013 · Generative models (1)
Squeeze it, then expand it again
If we squeeze data down to 2 numbers, can we make new data from those 2 numbers?
An autoencoder is a network trained to output the same thing it takes in, with a narrow middle layer. The first half (the encoder) squeezes the input into a few numbers, and the second half (the decoder) restores it. This form existed in 1985–1987, but the space between the squeezed numbers is full of gaps, and data made from it falls apart.
In December 2013, the VAE (variational autoencoder) by Diederik Kingma and Max Welling at the University of Amsterdam trains the squeezed numbers to follow a distribution close to a normal distribution with mean 0 and spread 1. So if you pick numbers from the normal distribution, you can make new data. On the right is an example this site trained in Python, squeezing 12×12 faces into 2 numbers. Compare the two.
z=μ+σ × ε (ε is a random number with mean 0 and spread 1)
μ
mean output by the encoder
σ
spread
z
the point chosen
What you think you knowThe popular story:Autoencoders were started by Geoffrey Hinton in 2006 The original source says:The task of passing the input through a narrow layer and outputting the same thing was already in papers of 1985 and 1986. The 2006 paper itself says of deep autoencoders: that they work well.
Moving the random number outside
If z is written as a formula of a mean and a random number, the random number is outside the calculation, so the whole thing can be trained at once by backpropagation (in the paper's words, the reparameterization trick).
The same idea, found twice: About four weeks later, in January 2014, Danilo Rezende and colleagues at DeepMind also announced the same central trick. The May version by Kingma and colleagues wrote . The first version was titled , and the term variational auto-encoder appears only once, in the experiments section.
Sources & confidence (2)Squeeze it, then expand it again
20 December 2013Verified in the original
Variational autoencoder (VAE): squeezing data into a few numbers and making new data from them (Kingma and Welling, 2013)
In December 2013, Diederik Kingma and Max Welling of the University of Amsterdam released their paper on arXiv (a place where researchers post papers early). It brings the ideas of probability into the autoencoder, a neural network that combines an encoder, which squeezes the input into a small set of numbers called latent variables, with a decoder, which rebuilds the input from them. The encoder outputs not a single point but a mean and a spread (standard deviation). When a point is chosen from them in the form mean + spread × random number, the random number is separated out of the calculation. This makes it possible to train the whole network at once with backpropagation (the method of passing the output error from back to front to correct the weights) (the paper calls this the reparameterization trick). During training, the aims are to make the error between the rebuilt input and the original input small and, at the same time, to bring the distribution of the latent variables close to a normal distribution with mean 0 and spread 1. As a result, after training, new data can be generated by passing points drawn from that normal distribution through the decoder. The paper tested it on handwritten digits (MNIST) and face photos (Frey Face).
The popular story:VAE is often introduced as devised and named by Kingma and Welling in a single paper (the way people talk about it is this site's estimate) The original source says:(1) The central trick (taking the random number out so that probabilistic processing can also be trained by backpropagation) was also posted on arXiv by DeepMind's Rezende, Mohamed and Wierstra about four weeks later, on January 16, 2014. Kingma et al.'s May 2014 version says of that paper that , and the 2019 explainer written by the two of them also lists both papers. (2) On the naming: the title and method name in the December 2013 first version was AEVB (Auto-Encoding Variational Bayes), and the term variational auto-encoder appeared only once, in the experiments section. A section titled was created for the first time in the May 2014 version.
What we still don’t know:Which of the two research groups had the idea first is not known; there are no sources apart from the dates the papers appeared on arXiv (2013-12-20 and 2014-01-16).
Origins of the autoencoder: in 1985–1987, the task of making a network output what it was given through a narrow middle layer
An autoencoder is a neural network trained to output the same data it receives as input. The number of neurons in the middle layer is kept small. Because the input cannot simply pass through, the middle layer learns on its own a code that represents the input compactly with a few numbers. The first half acts as the encoder, turning the input into a code, and the second half acts as the decoder, restoring the original from the code. This structure appears in the encoder problem of the 1985 Boltzmann machine paper and in a chapter of the 1986 book on backpropagation. In the chapter, a network was trained on a task of reproducing 8 inputs as the same 8 outputs through 3 hidden-layer neurons. The hidden neurons then assigned each of the 8 inputs its own code (not only 0 and 1 but also in-between values were used). In 1987 Ballard proposed a method of stacking autoassociative networks, which make the input and output the same. In this scheme, the upper layer receives the representation of the lower hidden layer and learns from it.
The popular story:It is often said that Hinton started autoencoders in 2006 The original source says:The task of outputting the same thing as the input through a few hidden neurons was already in the 1985 Boltzmann machine paper (the encoder problem) and in a chapter of the 1986 backpropagation book. In 1987 Ballard had proposed a way of stacking autoassociative networks (Ballard writes that it was Hinton and Rumelhart who proposed this structure). The 2006 Science paper itself also writes that that training deep autoencoders with backpropagation works well. What was new was a method for setting the initial weights.
What we still don’t know:We have not confirmed the first paper to use the word autoencoder (the oldest we opened is the 1993 NIPS paper by Hinton and Zemel). The 1991 paper on nonlinear principal component analysis by Kramer is paywalled, so we did not open it. We looked but found nothing conclusive about whether, in Japan around the same time, there was research on networks that output the same thing as their input (called hourglass-type networks, learning of the identity mapping, and so on).
What the figure shows:An ordinary autoencoder's map of 2 compressed numbers has many gaps, so generating from an arbitrary point can produce a distorted face. A VAE packs the map inside a circle, allowing a face to be generated wherever a point is chosen.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_vae_faces.py
082014 · Generative models (2)
The counterfeiters and the police
Does the ability to make convincing fakes grow when it competes with an opponent that tries to spot them?
In June 2014, the GAN (generative adversarial network) by Ian Goodfellow and colleagues at the University of Montreal pits a network G, which makes data, against a network D, which tells real from fake. The paper compared G to and D to . It ends up in a state where D can no longer tell the difference.
On the right is a GAN on a single number line (a small example made for this site). When you open it, the purple hill of fakes moves toward the blue hill of real data, while the line of D approaches 0.5. Depending on the combination of G's and D's learning rates, it can freeze in one place or oscillate. The competition does not always converge cleanly.
D increases log D(x)+log(1 − D(G(z))), and G decreases log(1 − D(G(z)))
x
real data
z
random number
G(z)
the fake that was generated
D(·)
probability of judging it real
How the figure works
The paper wrote that at the start of training the slope of log(1 − D(G(z))) is too small, so it is better to have G increase log D(G(z)) instead (the figure does this too). G is the simplest possible network, which only turns a random number into a·z+b. D's weights are pulled back a little toward 0 at every step to damp the shaking (a trick of this site). The paper tried handwritten digits, face photos, and other images.
Sources & confidence (1)The counterfeiters and the police
10 June 2014Verified in the original
GAN (2014): two AIs compete, like and , to make data that looks just like the real thing
In June 2014, Ian Goodfellow and colleagues at the Université de Montréal published a paper on (GAN), a method that trains two AIs at the same time: a generator G that makes data, and a discriminator D that tells whether data is real or made up. The paper compared the generator to and the discriminator to “the police,” and explained that as they compete, both get better until the fakes can no longer be told from the real thing. The experiments used images such as handwritten digits and face photos.
1 sources and how they were checked
Generative Adversarial Nets (arXiv:1406.2661v1) (Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, Yoshua Bengio · 2014 · p.1 Abstract and 1 Introduction (the counterfeiters-and-police … · Original source)
What the figure shows:Competition between G, which makes fakes, and D, which detects them, moves the fake distribution toward the real one and brings D closer to being unable to tell them apart, giving 0.5 everywhere. But the competition does not always end neatly.
Mean of the fakes (purple) and spread (green). The dotted lines are the real values
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_gan_1d.py
092014–2016 · Neural translation
A thin tube, or attention?
When translating a long sentence, what should the network remember from the source sentence?
In 2014, research on translating whole sentences with neural networks followed one paper after another. Seq2seq, by Kyunghyun Cho and colleagues in June and Ilya Sutskever and colleagues in September, packed a sentence into a set of numbers of fixed length and produced the translation from it. Cho and colleagues also presented a simplified version of the LSTM unit (later called the GRU). In the "Thin tube (seq2seq · GRU)" on the right, see how the earlier words fade the longer the sentence gets.
That same September, Dzmitry Bahdanau and colleagues had the network decide, every time it output a translated word, how much attention (weights summing to 1) to pay to each word of the source sentence. This was the beginning of attention. In "Attention (2014)", press a translated-word card. In 2016, Google Translate switched to a neural network method that reads the whole sentence.
αij =exp(eij) ÷ Σk exp(eik) ci =Σj αij hj
eij
score of the j-th source word when producing the i-th translated word
hj
summary of the features of the source word
ci
the contents gathered by paying attention
What you think you knowThe popular story:Attention was born in the 2017 Transformer paper The original source says:It was already in this 2014 paper, and the 2017 paper cites it. What the 2017 paper called new was building the model from attention alone, without an RNN.
Details of seq2seq
The paper by Ilya Sutskever, Oriol Vinyals and Quoc Le of Google read an English sentence with a 4-layer LSTM and produced French with another LSTM. Reading the input sentence in reverse order raised the score (BLEU) from 25.9 to 30.6.
The name GRU: The June 2014 paper does not contain the name GRU, and called it . The name GRU comes from a December paper from the same lab. In the paper's formulas, the update gate z is the fraction of the previous state that is carried over.
Translation spreads: Google Translate's new method (GNMT) of September 2016 spread to Japanese in November. In 2014, Japan's Ministry of Internal Affairs and Communications made a plan to put speech translation in 10 languages into practical use by 2020, and its next plan in 2020 wrote (translated) (the sources do not say how this was measured).
Sources & confidence (5)A thin tube, or attention?
3 June 2014Verified in the original
RNN Encoder–Decoder and GRU: two RNNs that convert sequences, and a simplified LSTM-like structure (Cho et al., 2014)
In June 2014, Kyunghyun Cho and colleagues at the Université de Montréal presented the RNN Encoder–Decoder, which combines two RNNs (recurrent neural networks: networks that process sequence data step by step while keeping a record of past states). The first RNN (the encoder) squeezes a sequence of words of any length into a fixed-length vector, and the second RNN (the decoder) generates a different sequence of words from that vector. The same paper also proposed a new structure (later called the GRU) that makes the LSTM simpler to compute. This structure has two gates (mechanisms that control, with a value from 0 to 1, how much information passes through). The reset gate decides how much of the past state to ignore and rebuild from the current input, and the update gate decides how much of the past state to carry over unchanged to the next step. The paper tried it on English-to-French translation. However, it was used inside a conventional statistical machine translation system (a method that counts the probabilities of how chunks of words are translated, from a large amount of translated text pairs), as an auxiliary clue for scoring pairs of phrases (chunks of words).
The popular story:People tend to take it that the GRU was announced under the name GRU in Cho et al.'s 2014 paper, and that this paper made neural networks translate (the way people talk about it is this site's estimate) The original source says:(1) The name GRU does not appear in the paper. The structure is called , and the section heading was . The name GRU (gated recurrent unit) was used by a December 2014 paper from the same lab, which wrote of units . (2) This paper did not translate whole sentences; inside a conventional statistical machine translation system, it was used as an aid for evaluating combinations of phrases. Methods that translate whole sentences directly with neural networks lead on to the seq2seq paper and the attention-mechanism paper of the same year, 2014.
seq2seq (sequence to sequence): one LSTM reads a sentence into a single vector, and another LSTM writes out the translation (Sutskever et al., 2014)
In September 2014, Ilya Sutskever, Oriol Vinyals and Quoc Le of Google published the paper on arXiv. A 4-layer LSTM (an RNN designed to remember earlier information even over long sequences) reads the input sentence one word at a time and packs it into a fixed-length vector. Another 4-layer LSTM writes out the translation from that vector, one word at a time. They also discovered that feeding in the words of the input sentence in reverse order makes learning easier (BLEU rose from 25.9 to 30.6). BLEU is a measure that scores how many of the same word sequences a machine's translation shares with a human's translation. In the WMT'14 English-to-French translation task, a translation from an ensemble of 5 LSTMs scored 34.8, beating the statistical machine translation system it was compared with (33.3). When an LSTM re-ranked the 1000 candidates produced by the statistical system, the score reached 36.5. One LSTM had 380 million parameters, and 12 million sentence pairs were used for training.
The popular story:seq2seq (the encoder-decoder) tends to be introduced as something Sutskever and colleagues invented first (this way of putting it is this site's own guess) The original source says:the paper itself says that Kalchbrenner and Blunsom (University of Oxford, 2013) were , and that its own work was What the paper claimed as its own novelty was that this was the (translated) pure neural-network translation to beat statistical machine translation by a large margin. Also, going by the date it appeared on arXiv alone, the attention paper (2014-09-01) came 9 days earlier, and it cites this paper as an anonymous paper under review.
What we still don’t know:The paper says it cannot fully explain why reversing the input improves accuracy, and offers a guess: the distance between the first words of the input and the first words of the translation becomes shorter (Section 3.3).
The origin of attention: translation that decides, each time it outputs one word, how much to focus on each word of the original sentence (Bahdanau et al., 2014)
In September 2014, Dzmitry Bahdanau, KyungHyun Cho and Yoshua Bengio published the paper on arXiv. The older encoder-decoder squeezed the whole input sentence into a single fixed-length vector, and the paper saw this as a bottleneck (a place that narrows like the neck of a bottle) limiting performance. So the encoder keeps, for each input word, a summary (an annotation) made by reading the sentence in both directions, forward and backward. Each time the decoder outputs one translated word, a small neural network gives each word's summary a score for how important it is, turns the scores into weights that add up to 1, and the decoder uses the weighted sum of the summaries. The paper explained that, intuitively, this gives the decoder a mechanism of attention. In English-to-French translation, scores did not drop much even as sentences got longer. When limited to sentences with no unknown words, the scores were about the same as Moses, a statistical machine translation system (BLEU 36.15 and 35.63). When the weights were drawn as a figure, the English European Economic Area could be seen matching the French zone économique européenne, which has the words in the reverse order.
The popular story:People tend to think attention was born in the 2017 Transformer paper (because that paper's title is Attention Is All You Need; this way of putting it is this site's own guess) The original source says:the attention mechanism was already in this 2014 translation paper. The Transformer paper also calls one of the two commonly used forms of attention and lists this paper as reference [2]. What the Transformer paper presented as new was that, whereas attention had until then been , it built the model from attention alone, without an RNN. Note that the key word in the title of the 2014 paper is “align,” and the word attention appears only three times, in one paragraph of the text. The paper also cites Graves's 2013 work on generating handwriting as a similar method for lining up input and output.
27 September 2016Verified in the originalSources disagree
Google Translate switches to , which reads a whole sentence at once (2016). People noticed that translations suddenly became more natural, even in Japanese
In September 2016, Google announced neural machine translation (GNMT), a method that reads the whole sentence as one unit. Until then, Google had used statistical machine translation, which translates a sentence part by part, since it started Google Translate about 10 years earlier (the research blog says , and the Japanese blog says it (translated)). GNMT was first used for all Chinese-to-English translation (about 18 million translations a day). In human evaluations, Google said it reduced errors by 60% on average. In November it was extended to 8 languages, including Japanese and Korean. According to ITmedia, (translated). There is a technique that splits words into small pieces (wordpieces) so that rare words can be handled. According to Google's technical report, Google originally created it to solve the problem of segmenting Japanese and Korean in speech recognition, and it is also used in BERT in 2018.
The popular story:It tends to be taken as “in 2016 Google Translate became as good as a human” (the technical report's title is also ) The original source says:the technical report says that translations nearly indistinguishable from human ones may occur for , and that longer text and hard examples are left for the future. The research blog also writes and the Japanese announcement wrote (translated)
5 sources and how they were checked
Where sources disagree:The Japanese blog says “8 languages in total,” but it lists nine language names (probably a difference in whether English is counted; this site's guess). On how much errors fell: the research blog says “55% to 85% or more,” while the technical report's abstract says “60% on average” (the sets of sentences evaluated were collected differently)
Japanese government goal: put speech translation in 10 languages to practical use by 2020 (2014). Next, simultaneous interpretation by 2025
In April 2014 the Ministry of Internal Affairs and Communications announced the . With the mission of (translated), it decided to achieve highly accurate speech translation in 10 languages for conversations on travel, disaster prevention, medicine and daily life by 2020, and to (translated), meaning the athletes and spectators gathering from around the world for the 2020 Tokyo Olympics and Paralympics. The core was NICT's technologies such as VoiceTra. In the next plan, in March 2020, it said that in the first phase (2014–2019) it had (translated), and, aiming at the 2025 Osaka-Kansai Expo, set a new goal of going (translated) (consecutive translation means translating one sentence at a time). According to the 2025 White Paper, a translation app in 30 languages using NICT's technology and simultaneous interpretation at seminars and other events were used at the Expo.
What happened next:The Ministry's own plan of March 2020 says “practical level achieved in 12 languages” (translated). The next goal is simultaneous interpretation by 2025, and the 2025 White Paper writes that the Expo put into use a translation app in 30 languages and simultaneous interpretation at seminars and other events. How the “practical level” is measured is not written in the sources I opened. How it was used at the Olympics and Paralympics has not been checked on this site.
What the figure shows:seq2seq squeezes an entire sentence into a fixed-length group of numbers, so earlier words fade as the sentence gets longer. Attention chooses where to look in the original sentence for each 1 translated word, allowing it to return to earlier words even in long sentences.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_attention_align.py
102014 · Learning methods
Going down a long, narrow valley
When moving in the direction that lowers the error, how should we decide the size of each step?
The basic way to train a network is gradient descent. On the landscape of error, you go a little at a time in the downhill direction (the gradient). If the landscape is a long, narrow valley, you overshoot in the steep direction and barely move in the gentle one (the navy ball on the right).
In December 2014, Adam by Diederik Kingma and Jimmy Ba records, for each weight, a moving average of the gradient and a moving average of the squared gradient, and decides the step from their ratio. It goes carefully in directions where the gradient is always large and boldly in directions where it is small, so the purple ball heads for the bottom of the valley with small overshoots. Uncheck "Bias correction" to turn off the calculation that corrects the early bias of the moving averages toward 0 (bias correction), and compare.
m ← β₁m+ (1−β₁)g v ← β₂v+ (1−β₂)g² w ← w − η · m̂ ÷ (√v̂ +ε)
g
gradient
m, v
moving averages of the gradient and of the squared gradient
m̂, v̂
the corrected values
η
learning rate (step size)
What you think you knowThe popular story:Adam is a method proven to always converge The original source says:A 2018 paper by Reddi and colleagues at Google showed an example where Adam fails to reach the optimal solution even on a simple problem, and wrote where the problem lies in the original proof.
The name and the order of authors
Adam comes from adaptive moment estimation. The paper says it combines the strengths of AdaGrad and RMSProp. According to a footnote, the two contributed equally, and the order of the names was decided by a coin toss on a video call. The figure's β₁ and β₂ are 0.9 and 0.999.
Sources & confidence (1)Going down a long, narrow valley
22 December 2014Verified in the original
Adam: a learning method that automatically adjusts the update size for each individual weight (2014)
Adam is an optimization method that improves on gradient descent (a method that updates the weights little by little in the direction that shrinks the error against the correct answers). For each weight it keeps a moving average of the gradient (which way, and how far, to move) as the first moment, and a moving average of the squared gradient as the second moment, and it updates the weight by the average divided by the square root of the average of the squares. As a result, weights whose gradients are always large are updated cautiously and weights whose gradients are small are updated more boldly, and the update size stays within a roughly fixed size (the step size). Because the moving averages start at 0, the values lean toward 0 early on, so Adam also includes a calculation to correct this bias (bias correction). The name comes from adaptive moment estimation. The paper explains that it combines the strengths of AdaGrad, which works well with sparse gradients, and RMSProp, which works well with problems that change over time. As the source for RMSProp, the paper cites not a paper but Lecture 6.5 by Hinton and colleagues in an online course (Coursera). A footnote in the paper says the two authors contributed equally and that the order of the author names was decided by a coin flip over a video call (Google Hangout).
The popular story:People tend to think “Adam is a method that has been proven to converge (reach the best answer)” (the 2014 paper says it analyzed the theoretical properties of convergence) The original source says:a 2018 ICLR paper (Reddi, Kale and Kumar of Google) clearly showed examples in which Adam fails to converge to the optimal solution even on a simple convex optimization problem, and pointed out specific problems in the original analysis. It is an example of a widely adopted method for which problems in the theoretical proof were found later.
What we still don’t know:We have not checked in which version between v1 and v9 the way of choosing β changed (only two versions, v1 and v9, were opened). The original RMSProp lecture itself (Coursera Lecture 6.5) has not been opened.
What the figure shows:In a long, narrow valley, taking the same step size in every direction overshoots the steep sides and creates a zigzag path. Adam changes the step size by direction, heading straight toward the valley floor.
Error at each step (navy = gradient descent, purple = Adam. The vertical axis goes up by factors of 10)
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_adam_valley.py
112015 · Shortcuts
A shortcut that jumps over layers
If we make the network deeper, does it get smarter?
Kaiming He and colleagues at Microsoft Research showed that just stacking layers makes a 56-layer network worse than a 20-layer one, even in the error rate on the training data. So they repeatedly inserted a shortcut that adds the value from before entering a group of layers directly onto the group's output (ResNet). It could be made as deep as 152 layers, and took first place (error rate 3.57%) at the 2015 image competition.
In the same year, 2015, U-Net by Olaf Ronneberger and colleagues at the University of Freiburg, with its U-shaped structure that shrinks to grasp the whole and then expands back, used a shortcut that copies and joins the fine features from before the shrinking. It was made for segmenting microscope images into regions. Switch between the two shortcuts in the figure on the right.
ResNet: output=F(x)+x U-Net: input of an expanding stage= [what was expanded from below, a copy of the stage of the same size]
x
the value entering the group of layers
F(x)
the remainder (residual) that the group of layers learns
What you think you knowThe popular story:ResNet was the first to have connections that jump over layers The original source says:The paper itself says shortcuts had been studied for a long time, and names highway networks from the same period (May 2015, shortcuts with gates, hundreds of layers). The difference in ResNet is that its shortcut has no gate and passes the value on unchanged.
Why it is easier to train
The paper states, as a hypothesis, that the residual form is easier to train. The way the figure shows the signal returning is one way of looking at the mechanism, not the paper's own explanation. The picture in the figure is also hand-made and does not learn.
What happened to U-Net: In 2015 it won a cell-image contest by a wide margin. It was later used in the backbone of image-generating AI (the 2021 latent diffusion models), but it was originally made for medical and biological images, where only a few dozen images with correct answers exist.
Sources & confidence (2)A shortcut that jumps over layers
10 December 2015Verified in the original
ResNet (residual network): skip connections that jump over layers make networks as deep as 152 layers possible (2015)
ResNet is a neural network that repeatedly builds in skip connections (shortcut connections), which add the value entering a group of layers directly to the output of those layers. A block of layers does not have to learn the target transformation H(x) itself; it only has to learn the difference from the input, F(x) = H(x) − x (the residual), and the output is F(x) + x. Because a skip connection simply passes the value along, it adds neither weights nor computation. Kaiming He and colleagues at Microsoft Research showed that with plainly stacked layers, a 56-layer network had larger errors than a 20-layer one even on the training data (a decline caused not by overfitting but by difficulty of training; the paper calls it degradation). Using the residual form solved this, and on ImageNet they could go as deep as 152 layers (8 times deeper than the earlier VGG). An ensemble of networks reached an error rate of 3.57% and took first place in the 2015 ILSVRC image classification. On CIFAR-10, a small image dataset, they also examined networks of 100 and 1,000 layers.
The popular story:People tend to say “connections that skip layers (skip connections) began with ResNet” The original source says:the ResNet paper itself says shortcut connections had been studied for a long time (for example, adding a layer that connects the input directly to the output in a multilayer perceptron), and names highway networks as concurrent work. Highway networks (May 2015, Srivastava, Greff and Schmidhuber of IDSIA in Switzerland) wrote that gated connections can train networks of hundreds of layers, and that the gates were inspired by LSTM. What the ResNet paper gives as its difference is a connection with no gate that passes the value along as it is, so that all the information always gets through. Also, the starting point of ResNet was that “the deeper the layers, the better” does not always hold: in an ordinary network, 56 layers lost to 20 layers.
What we still don’t know:As to why the residual form is easier to train, the paper presents it as a hypothesis. Later explanations have not yet been checked in the original sources.
Highway Networks (arXiv:1505.00387v1) (Rupesh Kumar Srivastava, Klaus Greff, Jürgen Schmidhuber · 2015 · p.1 Abstract and 1. Introduction · Original source)
18 May 2015Verified in the original
U-Net: a U-shaped network born for segmenting microscope images (2015)
U-Net is a neural network for segmentation, which classifies what is shown at each pixel of an image. In the first half, the contracting path repeats convolution and downsizing to capture wide context; in the second half, the expanding path repeats upsizing to return to the original size. Because detail-preserving features from the first half are copied and joined to the layers of the same size in the second half, it can pinpoint where objects are. The two halves are almost symmetric, giving the shape of the letter U. Ronneberger, Fischer and Brox of the University of Freiburg in Germany presented this network together with a method of training on few images by distorting them (elastic deformation) to multiply them, because in medical and biological imaging it is impossible to prepare thousands of images with correct labels. In the 2015 ISBI cell tracking challenge, it won by a wide margin, with an average overlap with the correct answers (IOU) of 92% on a dataset of 35 partially annotated images (second place: 83%) and 77.5% on a dataset of 20 images (second place: 46%). Segmenting a 512×512 image took less than a second on a GPU of that time.
The popular story:People tend to think “U-Net is a component of picture-making AI (diffusion models)” The original source says:it was originally a neural network that appeared in 2015 for segmenting medical and biological microscope images. Even its title says Biomedical Image Segmentation, and it started from a situation with only a few dozen labeled images. A 2021 latent diffusion model paper (the forerunner of Stable Diffusion) used a UNet whose backbone takes time information, and cites the 2015 paper. The U-Net paper itself says that it builds on the 2015 fully convolutional network (a network made up entirely of convolutions) and improves on the weaknesses of the network of Ciresan and colleagues that won the 2012 ISBI challenge (slow processing, and a trade-off between localization accuracy and context).
What we still don’t know:We have not yet checked figures for how widely U-Net is used in medical-imaging research.
What the figure shows:Simply stacking layers made deeper networks have more errors even on training data, but shortcuts that add the unchanged input allowed a depth of 152 layers. U-Net restores fine shapes through shortcuts that copy and pass along fine features from before compression.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_resnet_shortcut.py
122014–2016 · The human line
Which human did it beat?
When people say AI surpassed humans, which humans were they compared with?
In the image recognition competition (1000 categories, up to 5 guesses allowed), the winning error rate fell from 28.2% in 2010 to 2.3% in 2017 (right; official figures). In February 2015, Kaiming He and colleagues at Microsoft Research reached 4.94% and wrote that this (5.1%).
That 5.1% was the figure for one of the two people the competition's organizers measured (practiced on 500 images, then identified 1500). The other person, who practiced on only 100 images, got 12.0% on 258 images. Switch the "Human line" on the right and the year of surpassing moves.
In conversational speech recognition in 2016, too, the human error rate differed with how it was measured: 4%, 5.9%, and 5.1%. The 30% line at the event announced in 2014 with was also set by the organizers.
What you think you knowThe popular story:In 2015, image recognition AI surpassed humans The original source says:The 5.1% of the humans it was compared with is one person's figure, and the other person got 12.0%. The paper that said it had surpassed them itself writes that the result in general.
Listening to conversation (2016–2017)
Microsoft researchers got 5.9%, the same as the 5.9% of professional transcribers, and wrote . The often-cited 4% was, in the paper's words, . IBM researchers (with a co-author from the Tokyo lab) re-measured humans with a method in which three people transcribed separately and a fourth checked, and put the best person at 5.1%. About their own 5.5%, they wrote that it was not human-level, .
The Turing test: The 5 minutes and 70% in Turing's 1950 paper were written as a prediction about roughly 50 years later, not set as a passing line (details in Chapter 2).
Sources & confidence (5)Which human did it beat?
2010–2017Verified in the originalSources disagree
In the image-recognition competition, the top team's fell from 28% to 2% in 8 years. The “human: 5.1%” figure is one person's measurement
In a competition to identify 1,000 kinds of objects from images (with a rule allowing up to 5 guesses), the winning error rate fell: 28.2% in 2010, 25.8% in 2011, 15.3% in 2012 (16.4% with only the supplied data), 11.7% in 2013 (11.2% when outside data was also used), 6.7% in 2014, 3.6% in 2015, 3.0% in 2016 and 2.3% in 2017. The organizers also measured the human error rate. It was a test with two people (A1 and A2): A1, who had practiced on 500 images, scored 5.1% on 1,500 images, and A2, who had practiced on only 100 images, scored 12.0% on 258 images.
The popular story:People tend to say “in 2015 AI surpassed humans (error rate 5.1%) at image recognition” The original source says:The 5.1% error rate is the result of one (A1) of the two skilled judges tested in the organizers' paper, who identified 1,500 images after practicing on 500. The other, who practiced on only 100 images, scored 12.0%. The researchers who themselves reported surpassing humans (Microsoft, 2015) also wrote that this result in general.
4 sources and how they were checked
Where sources disagree:How the “first place” result is counted differs by year. In 2012 and 2013 there were entries that used outside data and entries that did not, and the table in the organizers' paper uses the figures for the supplied data only (16.4 and 11.7). The 2010 and 2011 websites list the error rate for the same up-to-5-guesses method under the item name “flat cost”.
“In 2015, AI that recognizes images surpassed humans”: who was that ?
In February 2015, Kaiming He and colleagues at Microsoft Research reported an error rate of 4.94% on data from an image competition (ImageNet). This is the share of cases in which the correct answer was not among 5 guesses, and the paper announced that it (5.1%). In December of the same year, a combination of 152-layer deep neural networks (ResNet) recorded an error rate of 3.57% and took first place in the 2015 competition.
The popular story:People say “AI image recognition surpassed humans in 2015” The original source says:the “human 5.1%” it was compared with was a figure from one expert annotator who had practiced on 500 images and then judged 1,500 images using a dedicated interface. Another person, who practiced on 100 images, had an error rate of about 12.0% on 258 images. The paper that wrote itself also says this is a result on this dataset and does not mean that machine vision outperforms human vision in general at recognizing objects.
What we still don’t know:The rate changes greatly depending on who is trained, how, and on how many images it is measured (even for the two people in the same paper it was 5.1% and 12.0%). Many numbers that compare people with AI have the same problem.
13 October 2012Verified in the originalSources disagree
In the image-recognition competition ILSVRC 2012, the University of Toronto's deep convolutional neural network (SuperVision) wins by a wide margin. The runner-up is a University of Tokyo team
In a competition to identify 1,000 kinds of objects from photos, the team “SuperVision” of Krizhevsky, Sutskever and Hinton held its error rate, under a rule allowing 5 guesses, to 15.3% (16.4% if only the data supplied by the competition is used). The runner-up, a University of Tokyo team (ISI), scored 26.2%, a gap of about 11 points. They trained an 8-layer neural network with 60 million parameters on 2 gaming GPUs (graphics chips, made by NVIDIA). In a later paper, the competition's organizers wrote that for research on recognizing a wide variety of objects.
The popular story:People tend to say “deep learning was suddenly born in 2012” The original source says:The winning system was a large-scale version of the of LeCun and colleagues in 1989 (whose origin is Fukushima's Neocognitron of 1979), trained on GPUs. The paper itself writes that (prefaced by saying that every experiment points that way). People also tend to think “2012 was a Western story”, but the runner-up was a University of Tokyo team
4 sources and how they were checked
Where sources disagree:Training time: the team introduction on the competition page says “about 1 week”, while the paper says “5 to 6 days”. The first-place figure: there are two, 15.3% (with extra data) and 16.4% (supplied data only), and the table in the organizers' paper uses 16.4
17 October 2016–2017Verified in the originalSources disagree
“In 2016, AI reached human level at transcribing conversation”: who measured that error figure, and how?
In October 2016, Microsoft researchers measured the errors (word error rate) of professional transcribers on tests of transcribing telephone conversations (Switchboard and CallHome). The results were 5.9% and 11.3%, and their own AI got 5.9% and 11.1%, and they announced . The paper also wrote that , but that the source of that figure is a “personal communication” and is unclear. In March 2017, IBM researchers (including researchers from the Tokyo lab as co-authors) measured the human error again. Three transcribers wrote separately and a fourth checked. The best person scored 5.1% (6.8% on CallHome), and they wrote that even their own AI (5.5%) was .
The popular story:It tends to be told as “in 2016, AI matched humans at transcribing conversation” The original source says:the measurement changes to 4%, 5.9% or 5.1% depending on who is measured and how. The Microsoft paper compared with a figure from professional transcribers (5.9%), while IBM compared with a carefully re-measured person (5.1%) and said . Moreover, many of the speakers in the test data were also in the training data (IBM). Like the ImageNet (record → In 2015, AI that recognizes images surp…), whether something is “human-level” depends on how the yardstick is set.
What we still don’t know:There is no settled way to measure the human error rate that defines (whom to use, how many times, and how to have them check). The IBM paper points out that human error may be considerably smaller than had been thought.
2 sources and how they were checked
Where sources disagree:Values for the human error rate: 4% (a “personal communication” of unclear source, according to the Microsoft paper)/5.9% (professional transcribers hired by Microsoft)/5.1% (the best person under IBM's method of three transcribers plus one checker). On CallHome, 11.3% (Microsoft) and 6.8% (IBM).
In June 2014, the University of Reading announced at an event held at the Royal Society in London that the chat program had the Turing test (a test in which a person talks only through text on a screen and tries to tell whether the other side is a human or a machine). The program imitated a 13-year-old boy. The university's standard was , and it said Eugene made 33% of the 30 judges think it was human.
The popular story:People say “fool 30% of people and you pass the Turing test” The original source says:the and in Turing's 1950 paper were a prediction of how things would look about 50 years later (around the year 2000), not a pass mark he set. is a rule set by the organizers of the 2014 event
What we still don’t know:How to decide whether we can say still has no settled answer (Turing himself wrote in the same paragraph that his original question, , is too meaningless to deserve discussion)
What the figure shows:The human score in claims of surpassing humans varies greatly with who was tested, how they practiced, and how many images they saw. Changing only the human reference line shifts the year of surpassing humans by 2 years.
132015 · Image generation
Two ways to paint a picture
How can we paint a picture using a network that has already learned?
In August 2015, style transfer by Leon Gatys and colleagues at the University of Tübingen and elsewhere leaves the trained network unchanged and fixes the pixels of the image. It treats the responses of deep layers as the content, and a table of which features appear strongly together (the Gram matrix) as the style, and shrinks the differences in both. The "Style transfer" on the right is the smallest possible form, using only small filters (an example made for this site).
In March of the same year, the diffusion model by Jascha Sohl-Dickstein and colleagues at Stanford University repeatedly adds noise to data to destroy it, and has a network learn the one-step reverse. If you repeat the reverse steps starting from noise, new data appears. In "Diffusion model", destroy a spiral and bring it back.
Style transfer: difference=α × (content difference)+β × (Gram matrix difference) One diffusion step: x ← √(1−βt)·x+ √βt·ε
α, β
weights of the two differences
βt
amount of noise at step t
ε
random number with mean 0 and variance 1
What you think you knowThe popular story:Diffusion models were a new method made around 2022 (or the 2020 DDPM) The original source says:The idea was in the 2015 paper, which says it was . The 2020 DDPM paper wrote that until then, , and showed that it could.
The reverse direction in the figure
In the real thing, a network learns the one-step reverse. The figure instead calculates it directly from the original cloud of points (a shortcut that skips the learning).
In Japan at the time: 15 days after the style transfer paper, on September 10, 2015, Mr. Matsumoto of Preferred Networks released a program that wrote style transfer in Chainer, and in his blog post (translated title) he explained, about the trained network, (translated).
Sources & confidence (2)Two ways to paint a picture
26 August 2015Verified in the original
Style transfer: keep a trained CNN as it is and adjust the image instead, combining the content of a photo with the style of a famous painting (Gatys et al., 2015)
In August 2015, Leon Gatys, Alexander Ecker and Matthias Bethge of the University of Tübingen (Germany) and other institutions published the paper . It is a way to make an image that combines the content of a photo (what is where) with the style of a painting (its colors and brush strokes). It uses as it is a CNN (convolutional neural network: a network that applies small filters to an image many times to extract features; here, the 19-layer VGG) already trained for object recognition. The responses of deep layers serve as the representation of the photo's content. In several layers, it computes the correlations (Gram matrices) of how strongly features appear together, and uses them as the representation of style. Starting from an image of white noise, it adjusts not the network's weights but the pixels of the image, by gradient descent (a method that moves things little by little in the direction that reduces the error), so that both the content error and the style error become small. The paper's figure shows a photo taken along the Neckar river in Tübingen rendered in the style of Van Gogh's The Starry Night, Munch's Der Schrei and other works. In Japan, 15 days later, on September 10, 2015, Mr. Matsumoto, a researcher at Preferred Networks (PFN), released a program implementing this method with the deep learning tool Chainer. In his blog post , he explains the mechanism in Japanese.
The popular story:People tend to think that a style-transfer AI learned from many famous paintings to pick up the painter's way of drawing (this belief itself is this site's guess) The original source says:in the paper's method, a network already trained for object recognition is used as it is. As the PFN blog says, (translated). What gets updated is (translated), and a single painting is enough as the source of the style. Also, the authors' affiliations include neuroscience institutes (such as the Centre for Integrative Neuroscience). At the end of the paper's abstract, it says this may lead to a way of computationally understanding .
Diffusion models: learn to reverse a process that gradually adds noise and destroys an image, then make images from noise (Sohl-Dickstein et al. 2015, Ho et al. 2020)
In March 2015, Jascha Sohl-Dickstein and colleagues at Stanford University, inspired by non-equilibrium statistical physics (physics that deals with the motion of many particles in states that are not in balance, that is, not in equilibrium), presented a method that learns a diffusion process that gradually destroys the structure of data and the reverse process that restores it (diffusion is a random spreading-out motion, like ink dropped in water). In the forward process, small Gaussian noise (random numbers following a normal distribution) is added to the data again and again until it becomes pure noise. A neural network learns each step of the reverse (a process that removes a little noise). After training, new data can be generated by repeating the reverse process starting from plain noise. The 2015 paper ran experiments on a two-dimensional swiss roll, handwritten digits, and small photos (CIFAR-10). In June 2020, Jonathan Ho and colleagues at the University of California, Berkeley published the DDPM (Denoising Diffusion Probabilistic Models) paper. Using a 1,000-step process and a training method that predicts the noise added at each step, it reached an FID of 3.17, the best at that time, for unconditional CIFAR-10 image generation (FID measures the difference between a set of generated images and a set of real images; smaller is better).
The popular story:Diffusion models are often thought to be a new method born around the time of Stable Diffusion in 2022 (or DDPM in 2020) (this way of putting it is this site's own guess) The original source says:the idea itself goes back to the 2015 paper. It says it was , and describes learning a process that can and . The DDPM paper five years later says that diffusion models are straightforward to define and efficient to train, but that , and it counted showing high-quality generation as its achievement. The original Stable Diffusion paper (December 2021) also cites the 2015 paper as a foundation of diffusion models.
What the figure shows:Style transfer adjusts the image's pixels while keeping the network unchanged. Diffusion models learn to reverse 1 step of damage caused by adding noise, restoring shapes from a fog of noise.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_diffusion_roll.py
142014–2015 · Japan
Building as it runs
Do we have to decide the whole shape of the network first before it can learn?
In March 2014, Toru Nishikawa and Daisuke Okanohara founded Preferred Networks (PFN). In June 2015, PFN released Chainer, a tool for writing neural networks in Python and training them, in a form anyone can use.
Most earlier tools (such as Caffe) first fixed the whole path of the calculation and then sent data through (called Define-and-Run in the Chainer paper). Chainer records the path as it calculates, and finds gradients by tracing it backward (Define-by-Run). Even networks that handle sentences of different lengths can be written with ordinary for and if statements. On the right, press "Step one line".
The 2019 PyTorch paper said it was Chainer and DyNet that pioneered this way of writing. In December 2019, PFN moved the base of its research and development to PyTorch.
What you think you knowThe popular story:The build-as-you-run style (Define-by-Run) was started by PyTorch in the United States The original source says:The 2019 PyTorch paper itself writes that Chainer and DyNet pioneered this design. But the same paper also says Chainer's approach gave up speed.
What happened to PFN and Chainer
In 2015, PFN formed capital partnerships with FANUC and Toyota Motor. Ponanza Chainer, which took second place at the 2017 World Computer Shogi Championship, also used it. On December 5, 2019, Chainer entered the maintenance phase with that day's version.
Sources & confidence (2)Building as it runs
5 June 2015Verified in the originalJapan
Chainer from Japan's Preferred Networks: Define-by-Run, which builds the network while the program runs (2015)
Chainer is a tool (framework) developed by the Tokyo company Preferred Networks (PFN) and released in June 2015 as open source (software anyone can use). It lets you write deep learning networks in Python and train them. Many earlier tools (such as Caffe) worked in two stages: first the whole structure of the network (the computation graph) was fixed, and only then was data run through it for training (the Chainer paper named this Define-and-Run). Chainer, on the other hand, records the path of the computation as it runs the forward calculation on data, and traces it backward to compute gradients; it called this Define-by-Run. As a result, even networks whose shape changes with each input, such as recurrent neural networks handling sentences of different lengths each time, can be written with ordinary Python loops and if statements, and ordinary debuggers (tools for finding errors in programs) can be used. It was presented as a paper at the NIPS workshop on machine learning systems in December 2015. The 2019 PyTorch paper later wrote that Chainer and DyNet pioneered this approach. On December 5, 2019, PFN announced that it was moving its research and development platform from Chainer to PyTorch, and that Chainer would enter maintenance with v7, released that day.
The popular story:People tend to think “the style of building a network while it runs (Define-by-Run) was started by America's PyTorch” The original source says:the 2019 PyTorch paper itself says Chainer and DyNet pioneered this design. PyTorch's README (the v0.4.1 version) also lists Chainer as one of its sources of inspiration. PFN's 2019 announcement says the Define-by-Run approach was widely adopted as (translated). However, the PyTorch paper also says that Chainer's approach sacrificed speed. And in 2019 PFN itself moved its research and development platform from Chainer to PyTorch.
What we still don’t know:We have not checked which came first, the idea of DyNet or of Chainer, or whether each knew of the other. We also have not yet checked concrete numbers on how much Chainer was used by researchers and companies in Japan.
Release v1.0.0 of chainer/chainer (GitHub record) (The Chainer development team (chainer/chainer on GitHub) · 2015 · The release record from the GitHub API (published_at and bo… · Original source)
Japanese AI company Preferred Networks (PFN) is founded (2014). In 2015 it releases the deep-learning tool free of charge
On March 26, 2014, Toru Nishikawa and Daisuke Okanohara co-founded Preferred Networks. In June 2015 they released , a tool for building deep-learning AI, as software anyone can use (open source). In 2015 the company formed capital alliances with Fanuc and Toyota Motor. At the 2017 World Computer Shogi Championship, the runner-up shogi program “Ponanza Chainer” used this Chainer.
What the figure shows:Chainer records the calculation path as an ordinary program runs, then follows that path backward to learn. This lets sentences of different lengths be handled with an ordinary for loop.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_tiny_autograd.py
152006–2017 · Go
Trial playouts and two networks
How do you choose a move in Go, where it is hard to turn a position into a score?
Go has many possible moves, and scoring a position is hard. In 2006, Monte Carlo tree search by Rémi Coulom of France plays ahead randomly to the very end, many times, compares moves by the share of wins, and searches promising branches more deeply (UCT, which decides which moves to try how often, came the same year). On the right is an example played on Connect Four. Press a column to play against it.
AlphaGo, from DeepMind, added to this a network that chooses moves and a network that evaluates positions. In October 2015 it beat Fan Hui (2 dan) 5–0. The paper said that beating a professional with no handicap was . In March 2016 it beat Lee Sedol (9 dan) 4–1. AlphaGo Zero in October 2017 learned from self-play alone, and after 72 hours won 100 games to 0 against the version that had beaten Lee Sedol.
UCT score=share of wins+C √( ln N ÷ n )
N
total number of times this position was tried
n
number of times this move was tried
C
how much to try moves that have not been tried much
What you think you knowThe popular story:AlphaGo got strong by learning on its own The original source says:Even the version that beat Lee Sedol in 2016 first learned from 160,000 human games as models, and then got stronger by playing against itself. The first version that did not use human games was AlphaGo Zero in October 2017. Even Zero was given the rules, and a design that treats the board as a 19×19 image, by humans.
After that
In January 2017, Master, playing online under a hidden name, won 60 games in a row against top professionals. In May it beat Ke Jie (9 dan), the world number one, 3–0. AlphaGo retired from games. In December, AlphaZero learned Go, chess, and shogi from the rules alone, and against elmo, the software that had won the shogi world championship, it won 90 games, lost 8, and drew 2 out of 100 (one minute per move). In the paper, the game appears as .
Game AI afterward: In January 2019, DeepMind's AlphaStar beat professionals at StarCraft II, but it did not move the screen as a person does, and could read the visible units on the whole map directly. In April 2019, OpenAI Five beat the world-champion team at the team game Dota 2.
Sources & confidence (10)Trial playouts and two networks
2006Verified in the originalSources disagree
The two papers behind , which made Go programs strong
In Go, there are many possible moves in a single position, and evaluating a position is hard. So search methods like those used for chess did not make programs strong. In 2006, a paper by Coulom of France presented a new search method (Monte-Carlo Tree Search, MCTS). It plays out a game at random many times from a position to the end (Monte Carlo), compares moves by their win rates, and examines the more promising branches more deeply. With his 9×9 Go program Crazy Stone, Coulom won a computer Go tournament (KGS). In the same year, Kocsis and Szepesvári of Hungary proposed UCT, a method for deciding which branch to try and how much. Ten years later, the AlphaGo paper (2016) cited these two as the MCTS literature, and combined MCTS with two neural networks (one predicting the next move and one evaluating positions).
3 sources and how they were checked
Where sources disagree:Which edition of the conference the Kocsis and Szepesvári paper was at: the AlphaGo reference list says “15th European Conference on Machine Learning”, while Springer's bibliographic record says ECML 2006 was the 17th (we only confirmed this in search results and did not open the original). We have not settled which is right.
Go AI “AlphaGo” wins its first game against a professional with no handicap (5 wins, 0 losses against Fan Hui)
AlphaGo, a Go AI developed by DeepMind of London, England, played a five-game match with no handicap (no stones placed in advance) against Fan Hui, the European champion and a 2-dan professional, and won 5 to 0. The paper said it was , in a feat . It was made public about three and a half months later, in January 2016, as a paper in the science journal Nature.
The popular story:People tend to say “AlphaGo got strong all by itself” The original source says:in this paper, it first learned to imitate human moves using 160,000 games played by 6- to 9-dan players on the internet Go server KGS (about 29.4 million positions), and was then strengthened through self-play (pdf pages 8 and 2). The version that does not use human game records is AlphaGo Zero in 2017 (see → Is it true that AlphaGo learned and got…).
AlphaGo beats Lee Sedol, one of the world's top players, 4 games to 1 (Seoul)
In March 2016 in Seoul, South Korea, AlphaGo played a five-game match with no handicap against Lee Sedol, a 9-dan player who had won 18 world titles. AlphaGo won 4 games to 1. In Game 4, Lee Sedol won with a surprising move at move 78. DeepMind announced that it would donate the 1 million dollar prize to education and Go organizations and to UNICEF.
The popular story:People tend to say “AlphaGo got strong by itself without being taught by humans” The original source says:the version that played Lee Sedol (AlphaGo Lee) worked in almost the same way as the 2015 version, and also began by learning to imitate human games (page 21 of the 2017 paper, and DeepMind's October 18, 2017 article: ). Not using human game records began with AlphaGo Zero in 2017 (→ Is it true that AlphaGo learned and got…).
What we learned in Seoul with AlphaGo (Demis Hassabis (Google official blog) · 2016 · Main text (The final score was 4-1, move 78 of Game 4) · Original source)
27 January 2016–2017Verified in the originalSources disagree
Is it true that “AlphaGo learned and got strong entirely on its own”?
It is often said that “AlphaGo got strong by playing against itself.” But according to the original papers, the AlphaGo that played humans from 2015 to May 2017 (the matches against Fan Hui, against Lee Sedol, and Master) first learned from human games as models, imitating where a person would play. Strengthening through self-play came after that. The first to learn without using a single human game was AlphaGo Zero, announced in October 2017.
The popular story:People tend to say “AlphaGo got strong by playing against itself (nobody taught it)” The original source says:in the 2016 paper, it first learned from 160,000 human games as models and was then strengthened through self-play. Not using human games began with AlphaGo Zero in 2017
3 sources and how they were checked
Where sources disagree:The number of games used as models differs by source. The 2016 paper says 160,000 games by 6- to 9-dan players on KGS (an internet Go server), about 29.4 million positions (about 30 million in the main text). The DeepMind blog and the current introduction page say “thousands of” games, and the blog says “amateur and professional games.”
“AlphaGo Zero”, Which Learns Only from Playing Itself, Without Human Game Records
In October 2017, DeepMind announced “AlphaGo Zero.” It uses no human game data. It is given only the rules of Go and learns by playing against itself over and over. After 72 hours of training, it won 100 games to 0 against the version that beat Lee Sedol. After about 40 days of training, it also won 89 of 100 games against Master, which had recorded 60 straight wins.
The story that “AlphaGo learned all by itself” first becomes true with this Zero of 2017. The AlphaGo versions that played from 2015 to May 2017 (Fan, Lee, Master) all began learning from human game data (→ Is it true that AlphaGo learned and got…).
What we still don’t know:Even though Zero is described as , humans supplied the rules (where moves can be played and how to judge a win or loss) and the structure that treats the board as a 19×19 image (paper PDF page 22, the Domain Knowledge section).
“AlphaZero”, Which Learns Go, Chess and Shogi with One System, Wins 90 of 100 Games Against the Shogi World Championship Winner elmo
In December 2017, DeepMind announced “AlphaZero,” a development of the AlphaGo Zero method. Given only the rules, it learns Go, chess and shogi by self-play alone. In shogi, it played 100 games against “elmo” (made by Makoto Takizawa), the software that won the World Computer Shogi Championship that year (held in Kawasaki by the Computer Shogi Association), and recorded 90 wins, 8 losses and 2 draws (with one minute per move). The paper explains shogi as .
January 2017Verified in the originalSources disagree
Secret AlphaGo Wins 60 Straight Games Against Top Professionals in Online Play
In January 2017, a player calling itself appeared on internet Go servers and went 60 wins and 0 losses against top players from around the world. DeepMind announced in a paper and a blog post that this player was a version of AlphaGo (AlphaGo Master). These were unofficial internet games, not official tournament games (DeepMind's explanation).
Master also began its training from human game data (paper, PDF page 22: )
2 sources and how they were checked
Where sources disagree:The records of the date differ. The paper says “January 2017,” while a summary source (English Wikipedia, AlphaGo) says late December 2016 to early January 2017. This site has not settled on either one.
AlphaGo's next move (Demis Hassabis, David Silver (DeepMind blog) · 2017 · Main text, paragraph 3 (unofficial online games … Magister … · Original source)
23 May 2017Verified in the original
AlphaGo Beats the World's Number 1 Ranked Player Ke Jie 3–0; AlphaGo Retires from Matches
In May 2017, at the held in Wuzhen, China, AlphaGo played a three-game match against Ke Jie, 9-dan, then ranked number 1 in the world, and won 3–0. Games in which a human was paired with AlphaGo, and a game against a team of five Chinese professional players, were also played. DeepMind announced that this was AlphaGo's final match and that it would move its research from Go to other challenges.
AlphaGo's next move (Demis Hassabis, David Silver (DeepMind blog) · 2017 · Main text, paragraph 4 (the Future of Go Summit is our fina… · Original source)
DeepMind's AlphaStar Beats Professionals at the Strategy Game (2019) — But at First It Saw the Whole Map Without Moving the Screen
In January 2019, DeepMind announced “AlphaStar”, an AI that plays the real-time strategy game “StarCraft II.” In a test match on December 19, 2018, it beat the professional player MaNa 5–0, and before that it had also beaten TLO. According to the official blog, in these matches AlphaStar did not move a screen (camera) the way a human does but played by directly taking in the visible units across the whole map. A version that moves the screen like a human was also built, but a prototype trained for only 7 days lost to MaNa in a public match.
The popular story:“AI beat professionals at StarCraft (January 2019)” The original source says:DeepMind itself writes that the AlphaStar of that time played by directly taking in the units in view across the whole map, without moving the screen. The prototype that moves the screen like a human (7 days of training) lost to a professional in a public match. The later Nature paper (October 2019) has not had its main text checked on this site.
OpenAI Five Beats the World Champion Team at the Team Game (2019)
On April 13, 2019, OpenAI's AI “OpenAI Five” beat the world champion team OG at the team game “Dota 2.” Networks with the same structure each control one of the team's five characters (heroes). The paper reports that it was trained with reinforcement learning through self-play, continued for 10 months with large-scale computing.
What the figure shows:Even without scoring a position directly, strong moves can be chosen by repeatedly playing randomly from there to the end and comparing win rates. More trials make the choices stronger.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_mcts_connect4.py
162007–2017 · Japan
The decade that flipped
When did the strength of professionals and software flip?
In shogi, in 2005, Kunihito Hoki, a chemistry researcher, released Bonanza. It had a machine learn the weights of an evaluation function (a formula that turns how good a position is into a score) so that it would play the same moves as professionals' game records. Right after Ryuo (Dragon King) Akira Watanabe beat Bonanza in March 2007, the researcher Hitoshi Matsubara wrote that winning more than losing against top professionals was (translated).
Each square on the right stands for one public game. In October 2015, the Information Processing Society of Japan ended its shogi project, saying (translated). In 2017, PONANZA beat Meijin Amahiko Sato twice in a row. In "Go (Densei-sen)", you can watch the handicap stones the software receives in Japan's Densei-sen drop from 5 to 0.
What "caught up" means
The society's declaration explained that it did not mean winning every time, but that software was likely to win more than it lost over many games, and also wrote that there had not yet been a game against a top professional. What counts as a top professional also differs by source.
The course of the Den'ou-sen: The first one in 2012 was a game with a retired player (Kunio Yonenaga, Honorary Lifetime Eisei-Kisei and then president of the Japan Shogi Association), and the winner, Bonkras, was based on Bonanza. In the second one in 2013 the professionals went 1 win, 3 losses, 1 draw (the last game was won by GPS Shogi, which reads moves using about 680 computers at the University of Tokyo), in 2014 it was 1 win, 4 losses, and in 2015 the professionals won 3 and lost 2. The Den'ou-sen ended in 2017.
Go: In March 2016, when AlphaGo beat Lee Sedol, the Densei-sen still had a 3-stone handicap. In March 2017, in the final round with no handicap, Ryo Ichiriki lost to DeepZenGo and Zetsugei. DeepZenGo, which was made stronger from March 2016 with backing from Dwango from Zen by Hideki Kato and colleagues in Japan, beat Yuta Iyama, the Oza title-holder, in March 2017.
Sources & confidence (9)The decade that flipped
2007–2017Verified in the originalJapan
Results of games between professional players and shogi software (2007–2017): ten years in which wins and losses switched
In public games between professional players and computers, the professional (Ryuo Akira Watanabe) won in 2007. In 2010 the software “Akara 2010” beat Ichiyo Shimizu, the Women's Ōshō title holder. In the Den-O-sen, Kunio Yonenaga, Eternal Kisei (a retired player), lost in 2012. The 5-versus-5 of 2013 was 1 win, 3 losses and 1 draw for the professionals, and 2014 was 1 win and 4 losses, but in 2015 the professionals came out ahead with 3 wins and 2 losses. In the two-game matches of 2016 and 2017, one player against one, the software (Ponanza) won both games in each of two years in a row.
The shogi program Bonanza, which learns from professional game records, wins a world championship and the next year plays Ryuo Akira Watanabe in a public game
The shogi program Bonanza was developed by Kunihito Hoki, a chemistry researcher, and released free of charge in June 2005. Unlike many earlier shogi programs, it used “full-width search” (translated), which reads out every move allowed by the rules. It also adopted (translated), training the way positions are evaluated so as to play the same moves as professionals' game records. The author has said that he applied the idea from his research on controlling chemical reactions to learning position evaluation. In May 2006, at its first entry in the 16th World Computer Shogi Championship, it won the round robin of the 8 finalists with 6 wins and 1 loss. On March 21, 2007, it played a public game against Ryuo (Dragon King title holder) Akira Watanabe, with 2 hours of thinking time each. Bonanza was also said to have the upper hand in the middlegame, but the Ryuo won in 112 moves. Later its method (and in 2009 the inside of the program) was made public, and shogi programs based on Bonanza, such as Bonkras, were born.
The popular story:“To make strong shogi software, the maker must also be strong at shogi” (according to an interview article, until then developers built the evaluation by hand, so they were often strong amateur players) The original source says:Bonanza's author was a chemistry researcher who hardly knew shogi. He adopted a method in which the machine learns how to evaluate from professional game records, and won the world championship at his first entry
Prediction: computer shogi winning more games than it loses against top professionals (translated) (2007, Hitoshi Matsubara)
In March 2007, right after Ryuo (Dragon King) Akira Watanabe beat Bonanza, the researcher Hitoshi Matsubara wrote in a commentary that a computer would (translated) against a top professional within a few years, and that it would take somewhat longer for it to (translated), but that this could be achieved by 2015. In the same text he wrote that computer Go was at below amateur 1-dan level and that it would (translated) before it beat a top professional.
What happened next:In the 2nd Shogi Den-O-sen in 2013 the active professionals' side finished with 1 win, 3 losses and 1 draw, and in the 3rd in 2014 with 1 win and 4 losses (in the 2015 FINAL the professionals' side won 3 and lost 2). In October 2015 the Information Processing Society of Japan declared the project finished, based on (translated) (according to the declaration, “caught up” means (translated)). But the same declaration also states that (translated). A game against the Meijin took place in 2017, when the Meijin, Amahiko Sato, lost two games in a row to PONANZA.
1 sources and how they were checked
Where sources disagree:The definition of “top professional” (translated) differs between sources. The Information Processing Society of Japan's declaration (2015) defined it as “a strong professional who has held several titles such as Meijin or Ryuo for several years or more” (translated). On the other hand, a Japan Shogi Association column (2017) also calls 8-dan Hiroyuki Miura and others, who lost in the 2013–2014 Den-O-sen (Shogi Den-O Tournament), “top professional” (translated).
14 January 2012Verified in the originalSources disagreeJapan
1st Shogi Den-O-sen: Kunio Yonenaga, Eternal Kisei, loses in 113 moves to the shogi software “Bonkras”
On January 14, 2012, at the Shogi Kaikan (Shogi Hall) in Tokyo, Kunio Yonenaga, president of the Japan Shogi Association and a retired professional holding the lifetime Kisei title (Eternal Kisei), played the shogi software “Bonkras”, developed by Hidenori Ito of Fujitsu Laboratories, and Bonkras won in 113 moves. Bonkras is a version of the publicly available shogi software Bonanza, improved to search in parallel on several computers; that day it read about 18 million moves per second on 6 servers. The name is a coined word combining Bonanza and , which means a parallel computer (a system that calculates on several computers at the same time) (as explained in Fujitsu Laboratories' announcement).
The popular story:People tend to say “at the 1st Den-O-sen, a professional lost to software” The original source says:In the association's own summary, the 1st was a game against a retired player (then the association's president), and games against active professionals began with the 2nd, in 2013. The winning software was also developed by a single researcher from the publicly available Bonanza, which is another example of publicly shared knowledge building up
2 sources and how they were checked
Where sources disagree:Sources differ on “the first official game between a professional and software”: the Shogi Association's column (2017) calls the 2nd Den-O-sen in 2013 “officially for the first time”, but a note in Fujitsu's announcement (2012) says Ryuo Akira Watanabe played Bonanza in 2007. The difference seems to lie in what is called “official” (this site's estimate)
20 April 2013Verified in the originalSources disagreeJapan
At the 2nd Shogi Den-O-sen (2013) the professionals' side finishes with 1 win, 3 losses and 1 draw. In the final game, “GPS Shogi”, which used about 680 computers at the University of Tokyo, beats Class A 8-dan Hiroyuki Miura
The 2nd Shogi Den-O-sen in 2013 was a team match between 5 active professional players and 5 shogi programs. Before the games the forecast was (translated), but it ended with 1 win, 3 losses and 1 draw for the professionals (Japan Shogi Association column). On April 20, in the final 5th game at the Shogi Kaikan (Shogi Hall) in Tokyo, “GPS Shogi”, developed mainly in a game programming seminar of faculty members and students of the University of Tokyo Graduate School, played 8-dan Hiroyuki Miura and won in 102 moves. GPS Shogi did distributed processing on about 680 computers at the University of Tokyo's Komaba campus and read about 270 million moves per second (University of Tokyo article).
2 sources and how they were checked
Where sources disagree:How “top professional” is used: the Japan Shogi Association column calls 8-dan Hiroyuki Miura a “top professional”. On the other hand, the Information Processing Society of Japan's 2015 declaration defines “top professional” as “a strong professional who has held several titles such as Meijin or Ryuo for several years or more” (translated), and said that as of 2015 “a match with a top professional has not taken place” (translated) (see the record of Hitoshi Matsubara's 2007 prediction).
The Information Processing Society of Japan declares an end to its project, saying computer shogi has
From 2010 the Information Processing Society of Japan (IPSJ) had been running a project aiming to achieve (note 1). In October 2015 it declared the project finished, saying . “Caught up” did not mean winning every time; it was explained to mean that, over many games, the computer is likely to come out ahead. At that point, however, a direct match against a top professional had not yet taken place.
What happened next:About a year and a half later, on April 1 and May 20, 2017, the shogi software PONANZA beat Amahiko Sato, the Meijin (the top title holder; he played as Eiō), in both games. The organizers ended the Denōsen matches with this contest.
1 April 2017Verified in the originalSources disagreeJapan
Shogi Software PONANZA Beats Meijin Amahiko Sato Twice in a Row; the Den-O-sen Ends
In 2017, in the “Den-O-sen”, a series of games between professional shogi players and software, the shogi software PONANZA (made by Issei Yamamoto and Akira Shimoyama) beat Meijin (the top shogi title holder) Amahiko Sato in both games (game 1 lasted 71 moves, game 2 lasted 94 moves). Sato played as the winner of the Eio-sen tournament while still holding the Meijin title. It was the first time a title holder had played in the “Den-O-sen.” The organizers ended the “Den-O-sen,” which had run for six years from 2012, with this match.
4 sources and how they were checked
Where sources disagree:Closing date: Dwango's announcement puts game 2 on May 20 (Saturday). The Japan Shogi Association's column, on the other hand, writes “On May 21, the 2nd Den-O-sen two-game match came to a close.” The game was played on the 20th, and the two announcements from the organizers agree on that.
Handicap stones between Go professionals and software fall from 5 to 0 in 5 years (Japan's Denseisen, 2012–2017)
For five years from June 2012, the University of Electro-Communications and the Nihon Ki-in (Japan Go Association) held the “Denseisen” (translated), official games between professional Go players and Go software, every year to measure the software's strength. At first the software was given a handicap, stones placed on the board in advance. It was 5 and 4 stones in 2012, 4 stones in 2013–2015 (3 stones also in 2015), and 3 stones in 2016. In December 2016 the organizers said that (translated) (a handicap game is one played with handicap stones placed first), and made the final round in March 2017 an even game with no handicap. In that round Ryo Ichiriki, Ryusei (a title), lost to two programs, DeepZenGo and “Zetsugei” (translated).
3 sources and how they were checked
Results of past Denseisen (list of past event results) (University of Electro-Communications, Entertainment and Cognitive Science Research Station · 2016 · Results table (round, date, professional, computer, handica… · Original source)
5th Denseisen (results) (University of Electro-Communications, Entertainment and Cognitive Science Research Station · 2017 · “Results” and “Overview” · Original source)
Japan's Go AI project “DeepZenGo” (2016–2018). It beat Oza title holder Yuta Iyama in 2017
The “DeepZenGo” project began in March 2016, with support from Dwango, to strengthen , the Go software of the team of Hideki Kato and Yoji Ojima. In November 2016 it played Honorary Meijin Chikun Cho with no handicap and lost, winning 1 and losing 2. At the “World Go Championship” in March 2017 (hosted by the Nihon Ki-in), it played top players from Japan, China and South Korea, finished third with 1 win and 2 losses, and beat Japan's representative, Oza title holder Yuta Iyama. The project, which the Nihon Ki-in called (translated), ended with a game in April 2018.
The 5th Denseisen (results) (Entertainment and Cognitive Science Research Station, University of Electro-Communications · 2017 · Results · Original source)
What the figure shows:In both shogi and Go, the winning side shifted from professionals to software within 10 years. The prediction (by 2015), the academic society's declaration (2015), and the actual games (the Meijin's 2 consecutive losses in 2017) do not quite line up.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_eval_learning.py
172018 · Into science
Building a shape from a map of distances
Can methods that made AI strong at games be used on problems in science?
A protein is a string of amino acids that is folded, and the folding decides its shape. At the 2018 prediction competition CASP13 (about 100 research groups), DeepMind's first AlphaFold used a convolutional network to predict a map of the distance between every pair of amino acids. It then built the shape by fixing it with gradient descent so that it fit a scoring formula made from that map.
On the right is that way of building in its smallest form (a 2-dimensional string and map made for this site). When you open it, a straight string folds into a shape that fits the map. Try scrambling the map, or using only the distances of nearby pairs. In the hard category the total score was 68.3, above the 48.2 of second place. But high accuracy came on only 11 of 43.
error=Σi<j (|pi − pj| − dij)² move p to make this small
pi
position of the i-th amino acid
dij
predicted distance between i and j
What you think you knowThe popular story:AlphaFold appeared suddenly in 2020 and went straight to a Nobel Prize in Chemistry The original source says:The first AlphaFold had already entered CASP13 in 2018. But the 2020 AlphaFold2 was, in the paper's words, one that , dropping convolution and using attention. The prize was for AlphaFold2, which is covered in Chapter 11.
Sources & confidence (1)Building a shape from a map of distances
December 2018Verified in the original
The First AlphaFold (CASP13, 2018): A Convolutional Network Predicts Distances Between Amino Acids and Builds the Shape — Its Inside Is Completely Different from the 2020 AlphaFold2
A protein's three-dimensional structure is decided when a chain of linked amino acids folds up. At the 13th CASP (2018, with about 100 research groups taking part), a protein structure prediction contest held every two years, DeepMind of London entered AlphaFold under the team name A7D. This first AlphaFold (now called AlphaFold1) used a CNN (convolutional neural network), the same kind used in image recognition. From a table lining up the sequences of similar proteins (a multiple sequence alignment), it predicted a map of probabilities for the distance between each pair of amino acids. From that map it built a scoring formula (a potential) and assembled the shape by adjusting it little by little with gradient descent. In the category that predicts without using similar structures as templates (FM), its total score from the judges was 68.3, far above the second place's 48.2. However, it reached high accuracy (GDT_TS of 70 or more) on only 11 of 43 targets. According to the Nobel Committee's explanation, AlphaFold2 at CASP14 two years later (2020) was rebuilt. It dropped convolution and used the Transformer's attention mechanism, and it changed to output the positions of atoms directly. The score (GDT) on hard problems rose from about 60% to about 90%.
The popular story:People tend to think AlphaFold suddenly appeared in 2020 and that this led directly to the 2024 Nobel Prize in Chemistry (the popular story is this site's own inference; the Nobel announcement also starts from the 2020 AlphaFold2) The original source says:The first AlphaFold already appeared at CASP13 in 2018 and left second place far behind in the hardest category. But its inside was a CNN for images predicting a map of distances, and its accuracy had not yet reached the shapes found by experiments. The 2021 AlphaFold2 paper describes the model entered in CASP14 as , and the Nobel Committee's explanation says it and that . The prize was for this rebuilt AlphaFold2.
What the figure shows:Predicting a table of distances between amino acids taken 2 at a time lets a three-dimensional shape form simply by gradually moving a chain to fit the table. A table containing only distances between nearby pairs cannot determine the shape.
Steps of assembly and the error against the map (the vertical axis goes up by factors of 10)
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_distance_fold.py
182013–2015 · Predictions about jobs
What is inside 47% and 49%
Where in the paper does it say that 47% of jobs will disappear?
In September 2013, Carl Benedikt Frey and Osborne of the University of Oxford estimated the probability that each of 702 occupations in the United States could be replaced by computers. For only 70 occupations they were confident about, they labeled by hand whether the job could be automated (1) or not (0). From 9 variables describing perception and manipulation, creativity, and social interaction, they inferred the rest with a classifier.
They called a probability of 0.7 or more the high category and under 0.3 the low category, and counted by the number of people working: 33% low, 19% medium, 47% high. Move the dividing lines in the figure on the right and the headline number changes (the jobs and headcounts are an example made for this site). In 2015, the Nomura Research Institute, in joint research with the same two, announced that (translated).
share in the high category= (number of people working in occupations with probability 0.7 or more) ÷ (all people working)
probability
the chance that the occupation can be automated technically (an estimate)
What you think you knowThe popular story:47% of US jobs will disappear in 10 to 20 years The original source says:The paper's wording is , meaning that those occupations could be automated within an unspecified number of years (perhaps 10 to 20). It is not a forecast of how many people will actually lose their jobs. Nomura Research Institute also wrote that whether jobs are actually replaced depends heavily on social factors, which the estimate does not include.
Details of the method
The labels were put only on occupations the researchers felt sure about, based on discussion at an Oxford workshop. The classifier was a Gaussian process. The 9 variables stand for the bottlenecks to automation (perception and manipulation, creativity, social intelligence). Nomura Research Institute's estimate covers 601 occupations in Japan.
Checking the answer: In 2022, an ITIF article was titled . But the paper does not clearly state a number of years, so the year of the answer is hard to fix. The paper also says the probability axis may be read as a rough time scale.
Sources & confidence (2)What is inside 47% and 49%
17 September 2013Verified in the original
Oxford University study: (risk of being replaced by computers; 2013)
In September 2013, Carl Benedikt Frey and Osborne of the University of Oxford published a paper estimating the probability that computers would replace workers in 702 occupations in the United States. It says that 47% of U.S. employment falls . The figure was later taken as “a prediction that jobs will disappear” and became a target of checking (for example, the title of a 2022 ITIF article, , from a separate record this site keeps, checking predictions about work against what happened). The details and the later checking are recorded in a separate study, apart from this site, on checking predictions about work in the age of AI.
The popular story:People tend to say “47% of American jobs will disappear in 10 to 20 years” The original source says:What the paper says is that 47% of employment is in the high-risk category and that such occupations could be automated within an unspecified number of years (perhaps a decade or two). It is not a forecast of how many jobs will actually disappear (the later checking is covered in the separate study, apart from this site, on checking predictions about work in the age of AI)
On December 2, 2015, Nomura Research Institute (NRI) announced joint research with Osborne and Carl Benedikt Frey of the University of Oxford. For 601 occupations in Japan, it estimated the probability of being replaced by AI or robots. The estimate was that in 10 to 20 years, occupations employing about 49% of Japan's working population could technically be replaced. However, the announcement notes that this is technical replaceability, and that whether replacement actually happens depends heavily on social factors such as labor supply and demand.
The popular story:People say “in 10 to 20 years, half of Japan's jobs will be taken by AI” The original source says:the announcement is an estimate that about 49% of Japan's working population (translated), and it says that whether replacement actually happens depends heavily on social factors, which are not included in the estimate
What the figure shows:The 47% figure is the share of workers in occupations with an estimated probability of automation of 0.7 or higher, and changes when the dividing line moves. It does not calculate how many people will actually lose their jobs.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_risk_category.py
192011–2016 · Japan
How far did it read and write?
Did AI give up on the University of Tokyo, and did an AI novel pass a prize screening? What really happened?
The Todai Robot (Torobo-kun) of the National Institute of Informatics (from 2011) set the goals of, in its words, (translated) and (translated). In the 2016 mock exams, it scored 525 points and a deviation score of 57.1 on the Center Test, and a deviation score of 76.2 on the University of Tokyo mock exam in mathematics (science track). That same year, it was said that, because (translated) is difficult, the effort to solve the Center Test the way a person does would be stopped.
In March 2016, parts of works from research on having AI write novels passed the first screening of the Nikkei “Shinichi Hoshi Award” and failed in the second. In "Shinichi Hoshi Award 2016" on the right, press a box. The plot (including the twist ending) and the sentence parts were prepared by people, and a program combined them.
What you think you knowThe popular story:The Todai Robot gave up on getting into the University of Tokyo (it failed) The original source says:The National Institute of Informatics' announcement contains no word for giving up. What was said at the report meeting was (translated) and (translated).
80% and 20%
Asked at a press conference about the contributions of humans and AI, Hitoshi Matsubara, the project leader, answered (translated). According to his own article, that was a figure of (translated) that the members had not agreed on, and colleagues later asked him for its basis. He also writes that passing the first round was judged as (translated), and that failing the second round probably meant (translated). The plot was thought up by a member of Satoshi Sato's lab at Nagoya University.
Sources & confidence (2)How far did it read and write?
14 November 2016Verified in the originalJapan
“Torobo-kun” (the Todai Robot): What Happened in 2016 to the Goal of Earning a Passing Score on the University of Tokyo Entrance Exam by 2021?
The National Institute of Informatics (NII) project (Torobo-kun, the Todai Robot) began in 2011. A 2012 article stated its goals: (translated) and (translated). In its November 2016 announcement, it recorded 525 points (deviation score 57.1) on a mock Center Test and a deviation score of 76.2 on the University of Tokyo mock exam in mathematics (science track). At a briefing held the same day, Noriko Arai said that the effort to solve the Center Test the way a person does would end this fiscal year. The reason was that (translated) is hard for AI.
The popular story:The story spread that “Torobo-kun gave up on getting into the University of Tokyo (it failed)” The original source says:NII's announcement of November 14, 2016 was itself a report of scores, and the word “abandonment” (translated) does not appear in it. What Arai said at the briefing was that (translated) and that (translated). Even the first article in 2012 named passing-level performance at the University of Tokyo as the first goal, while saying that a major theme was measuring how far AI had come in imitating human intellectual work.
What happened next:In the 2016 mock exams it recorded 525 points and a deviation score of 57.1 on the Center Test (by Benesse's assessment, 535 universities had an 80% or higher chance of accepting it) and a deviation score of 76.2 on the University of Tokyo mock exam in mathematics (science track). At the briefing in November 2016, it was announced that the effort to solve the Center Test the way a person does would be frozen this fiscal year. According to that day's news coverage, NII said it would next aim to develop the areas where AI is strong and apply them in industry. The challenge in this form ended without waiting for the target year (2021) for passing-level scores in all subjects of the University of Tokyo second-stage exam.
What we still don’t know:The 2016 view was that reading (understanding meaning) is hard for AI. How generative AI (the fourth boom) later changed that view is a candidate topic for u11 and u12.
“A novel written by AI passed the first round of a literary prize”: how much did the AI really write?
On March 21, 2016, a research team that has AI write fiction (Future University Hakodate, the University of Tokyo and others) announced four works it had entered in the 3rd Nikkei “Shinichi Hoshi Award”. Some passed the first round of screening and were rejected in the second round. The award also accepted entries from non-humans (AI and the like). According to an article later written by Hitoshi Matsubara, who led the effort, the storyline (a “scenario” including the twist ending) was created by a member of Satoshi Sato's laboratory at Nagoya University. The program used sentence parts prepared by humans to assemble Japanese text following that storyline.
The popular story:It spread as “AI wrote a novel and passed the first round of a literary prize” The original source says:according to an article by Hitoshi Matsubara, one of those involved, humans prepared the storyline (the scenario including the twist ending) and the sentence parts, and the program combined them to assemble the text. When asked at the press conference about each side's contribution, he answered , but he writes that this was a number based on a “just a vague feeling” (translated) that the members had not agreed on, and that colleagues later asked him for its basis. He also writes that passing the first round was judged as (translated), and that failing in the second round probably meant (translated; a short-short is a very short story).
What we still don’t know:There is still no clear line for what counts as written by AI (how much human editing makes it a human work). Matsubara's article also touches on the argument that if AI wrote 100%, it would not be protected under current copyright law.
What the figure shows:Torobo-kun did not give up on admission to the University of Tokyo, but stopped trying to solve problems the way people do. For the AI novel, people supplied the plot and sentence parts, and the program only arranged them.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_novel_parts.py
202016 · The clock of predictions
The clock of predictions
What happened in the target year to the predictions that named a year during the boom?
In 2016, Geoffrey Hinton said at a conference in Toronto, and . In August of the same year, Ford announced it would put a Level 4 self-driving car with no steering wheel or pedals in on ride-hailing and ride-sharing services in 2021. The Japanese government wrote about driverless mobility services in limited areas, (translated). A government white paper introduced the view of some researchers that (translated).
Move the "Current year" on the right, and for predictions whose target year has arrived, what happened afterward appears. The bars that appear when you select "Hinton · Radiologists" show the number of US residency positions offered (two points, 2016 and 2025, from the official table).
What you think you knowThe popular story:In 5 years AI will replace radiologists The original source says:In the original video, right after that he added . What he spoke of was deep learning, not AI, and he did not give a year when the job would disappear (checked with the video's automatic captions).
Predictions in the other direction
In October 2016, the US government report said that broad AI was (the target year is 2036). A note in the same report cites a study finding that .
The telephone game of 2045: Ray Kurzweil's 2005 wording was . By the time it reached Japan, in the 2015 Diet it had become (translated).
Sources & confidence (6)The clock of predictions
2016Verified in the original
Hinton: , (2016)
In 2016, Geoffrey Hinton spoke at a conference in Toronto about radiologists (doctors who read images such as X-rays and CT scans to find disease). His main points were that training radiologists should stop right now, and that it is obvious that within 5 years (it might be 10) deep learning will do better. An 84-second video recording the occasion was published, and it has been quoted repeatedly in later articles (AuntMinnie 2025, Fortune 2026 and others).
The popular story:It tends to be quoted as “AI will replace radiologists in 5 years” The original source says:in the original video, right after saying “within 5 years deep learning is going to do better than radiologists,” he adds . What he said was that we and that deep learning is ; he did not say in how many years the job will disappear.
What happened next:In the US residency recruitment (the official NRMP tables), positions in radiology (diagnostic) did not fall. Positions starting in the second year went from 982 in 2016 to 1,057 in 2025, and positions starting in the first year went from 151 in 2016 to 151 in 2025. Almost all the positions in 2025 were filled (1,042 of the 1,057 second-year positions).
What we still don’t know:How AI's ability to read images relates to the whole work of a radiologist (talking with patients and other doctors, deciding on tests, and so on) was not well understood in 2016. Even now, how this job will change with AI is still being studied.
Ford announces a plan to run large numbers of fully self-driving cars with no steering wheel or pedals in ride-hailing services in 2021 (2016)
In August 2016, the automaker Ford announced (in Palo Alto) a plan to run large numbers of vehicles (fully self-driving in limited areas) in ride-hailing and ride-sharing services in 2021. The plan was for the cars to have no steering wheel, no accelerator and no brake. Its president said . Around the same time, Japan's national plan and carmakers also announced self-driving plans targeting around 2020 (→ A national plan: self-driving on expres…).
What happened next:A service of this kind did not begin in 2021. On October 26, 2022, Ford announced that it had judged that putting Level 4 to profitable use at scale in the industry would come later than first expected. It booked a loss of 2.7 billion dollars on its investment in the self-driving company Argo AI, and shifted its development funds to Level 2+ and Level 3 (driver-assistance technologies in which a person watches over the driving).
A national plan: self-driving on expressways and driverless mobility services in limited areas, both
In its national strategy for self-driving, the (revised every year since 2014), the Japanese government set the 2020 Olympic and Paralympic Games as its target date. Based on the Prime Minister's remarks of November 2015, the 2016 edition set two goals. (1) Start studying the rules so that cars driven by the system on expressways (Level 3) can be sold on the market around 2020. (2) Realize, by 2020, mobility services with no driver on board in limited areas such as depopulated regions.
What happened next:(1) On November 11, 2020, the Ministry of Land, Infrastructure, Transport and Tourism granted type designation to the Honda Legend, the world's first Level 3 car driven by the system (under set conditions such as expressway traffic jams). (2) For Level 4 mobility services with no driver, the vehicle was approved on March 30, 2023, and operation began on May 21, 2023 in Eiheiji, Fukui Prefecture, the first in Japan (about 3 years after the 2020 target).
Even a government white paper carries the talk of the singularity: (2016)
The Ministry of Internal Affairs and Communications' 2016 White Paper on Information and Communications, in the first section of the special feature in Part 1, , wrote that beyond deep learning, a , a boundary at which ICT surpasses human intelligence, is predicted to arrive. It also noted that some researchers point out that the technological singularity will be reached around 2045 and that rebuilding social systems will become unavoidable. It is a record that, at the peak of the third boom, such a grand outlook appeared even in a government document.
What we still don’t know:The white paper does not say what standard is used to measure , or whether the year 2045 has any basis (it also names no researchers). That year has not yet arrived, and the outcome is not known (a candidate prediction awaiting an answer, handled in u12 and u13).
How the “2045 problem” spread in Japan — a 2007 translation → a 2013 paperback, “2045 problem” → in 2015 the first mention of the in the Diet. Along the way, shrank to (translated)
Kurzweil's 2005 book came out in Japanese in January 2007 from Japan Broadcast Publishing as (translated title). In January 2013 Takuya Matsuda's paperback (translated title) was published (in the National Diet Library, it is the oldest of the books and articles with “2045 problem” in the title). In the May 2014 issue of the Journal of the Japanese Society for Artificial Intelligence, Matsuda explained that, according to Kurzweil, a computer passes the Turing test in 2029 and the technological singularity, when computer intelligence surpasses all of humanity, comes in 2045. At the House of Councillors Committee on Internal Affairs and Communications on March 24, 2015, a member referred to the NHK documentary (translated title) and asked: “It is said that this turning point, when computers surpass the human brain, will arrive in 2045” (translated), (translated); the Minister for Internal Affairs and Communications answered that she had also seen the program. This is the first time the appears in the Diet record.
The popular story:People tend to say “AI will surpass the human brain in 2045” (in the 2015 Diet session: “It is said that this turning point, when computers surpass the human brain, will arrive in 2045” (translated)) The original source says:Tracing it back, Matsuda's 2014 explanation in the Journal of the Japanese Society for Artificial Intelligence says (translated), and Kurzweil's own 2005 Q&A says , with human-level machines expected around 2029–2030 (record → 2005, Kurzweil: I set the date for the …). Along the way, “all of humanity” (translated) (times one billion) shrank to “the human brain” (translated) (a single person).
What we still don’t know:Who first used the phrase “2045 problem” (translated) is not known (all we can say is that the oldest in a National Diet Library title search is Matsuda's 2013 paperback; blogs and newspapers were not checked).
US government report : for machines to show broad intelligence is
In October 2016, the National Science and Technology Council (NSTC) of the US Executive Office of the President released the report “Preparing for the Future of Artificial Intelligence.” In 2016 it held five public workshops, and 161 comments came in from a public request for information. The report sets out 23 recommendations, and a national AI research and development strategic plan was released at the same time. The cover letter says that machines will increasingly exceed humans at particular tasks, but that for them to show broad intelligence is . The main text also says that private-sector experts broadly agree that General AI (AI that can do any intellectual task like a human) , and that the committee agrees. It also says that concern about far-future superintelligence should have little impact on current policy.
What we still don’t know:The report itself notes that society would benefit from , and a note admits that this may be difficult. It then recommends continuing to survey experts' views regularly (pdf page 33).
1 sources and how they were checked
Preparing for the Future of Artificial Intelligence (Executive Office of the President, National Science and Technology Council, Committee on Technology · 2016 · PDF page 5 Cover letter (pdf page 5), the General AI section (pdf page… · Original source)
What the figure shows:Many predictions made during the boom with a target year proved wrong or did not match what actually happened when that year arrived. Some target years have not arrived yet.
212014–2019 · Rules
Rules written for whom?
What kinds of rules did AI researchers and governments make, and for whom?
In January 2014, the new cover of the journal of the Japanese Society for Artificial Intelligence (a picture of a female-shaped robot cleaning with a broom) drew criticism as (translated). The society wrote, (translated). This became one of the reasons for setting up an ethics committee. The last item of the society's 2017 (translated title), Article 9, is (translated), and it is written to AI itself.
In March 2016, Microsoft's chatbot Tay had its weak points exploited by a group of people acting together, posted inappropriate words within 24 hours, and was shut down. In "Conversation that learns by imitation" on the right (the simplest possible figure, made for this site; it is not Tay's actual mechanism), move the share of people acting together.
What Article 9 says
It is a conditional article: if AI becomes (translated), it must follow these guidelines just as the society's members do. Articles 1–8 are the attitudes expected of members: contributing to humanity, obeying the law, privacy, fairness, safety, acting with integrity, responsibility to society, and dialogue with society.
What is in the timeline: In July 2015, researchers issued an open letter calling for . In April 2016, at the G7 meeting in Takamatsu, Kagawa, Japan proposed discussing the (translated title). The 23 Asilomar principles of January 2017 set the goal of research as creating not but . In March 2019, the Japanese government adopted the .
Rinna in Japan: Rinna in Japan (2015, LINE), from the same company, aimed to build emotional connection through casual chat, and by December had more than 1.85 million friends.
Sources & confidence (8)Rules written for whom?
January 2014Verified in the originalJapan
Criticism of the cover design of the Japanese Society for Artificial Intelligence's journal prompts the society to publish its view (2014)
In January 2014, the Japanese Society for Artificial Intelligence renamed its journal and redesigned the cover. The cover, chosen by a vote from about 100 proposals gathered so that the journal would be read more widely, showed a female-shaped robot cleaning with a broom. Criticism followed one after another on the internet, asking (translated). The society's editorial committee said (translated), but apologized for giving (translated), saying (translated). In the March issue it ran a small special feature that organized this very debate as a subject of study.
On the opinions and discussion about the cover of “Artificial Intelligence” (Editorial committee of the Japanese Society for Artificial Intelligence (editor-in-chief Yutaka Matsuo, deputy editor-in-chief Satoshi Kurihara) · 2014 · Paragraphs 1–2 of the main text and the designer's intention · Original source)
The Japanese Society for Artificial Intelligence Publishes Its ; the Last, Article 9, Is (a Clause That Asks AI Itself to Comply)
On February 28, 2017, the Japanese Society for Artificial Intelligence (JSAI) published for researchers. Eight items (contribution to humanity, compliance with laws, privacy, fairness, safety, acting with integrity, responsibility to society, and dialogue with society) are what JSAI members are expected to keep in mind. The last, Article 9, is addressed to AI itself and says that to become a member of society, AI must follow these guidelines just as JSAI members do. Yutaka Matsuo, chair of the ethics committee, has written that one of the reasons the ethics committee was founded was the problem of the cover of the society's journal in 2014.
What we still don’t know:Article 9 supposes a future in which AI becomes (translated). Even the authors do not know when or in what form such AI will appear (it is written as a condition).
3 sources and how they were checked
JSAI Ethical Guidelines (PDF) (Japanese Society for Artificial Intelligence · 2017 · PDF page 2 Article 9 (Request for AI to Comply with Ethics). PDF page … · Original source)
About the JSAI Ethical Guidelines (Ethics Committee, Japanese Society for Artificial Intelligence · 2017 · Main text and “Background to the Publication” · Original source)
Microsoft's chat AI is exploited and shut down just after its release on Twitter (USA, 2016)
In March 2016, Microsoft released , an AI that talks on Twitter, aimed at 18- to 24-year-olds in the United States. It was designed to learn from conversations with people, but within 24 hours of release some people coordinated to exploit its weakness. Tay began posting highly inappropriate remarks and images, and the company took it offline. Microsoft published an apology and lessons learned on its official blog, and also mentions the experience with XiaoIce in China and in Japan.
What we still don’t know:The company itself says that it is impossible to predict in advance every way an AI that learns from conversations might be abused (a problem of society, not only of technology).
31 July 2015Verified in the originalSources disagreeJapan
Japan Microsoft's chat AI “Rinna” appears on LINE (2015)
In summer 2015, Japan Microsoft released “Rinna,” an AI that chats like a friend on LINE. It combined deep learning and cloud machine learning developed with the search engine Bing. It aimed not at helping with work but at an emotional connection through small talk (in the company's words, (translated)). At first it drew attention as an account that did not reveal its true identity, posing as a “high-school girl” (translated), and in December the number of LINE friends exceeded 1.85 million.
2 sources and how they were checked
Where sources disagree:On the start date: the LINE account was opened on 2015-07-31 (ITmedia), while Microsoft's announcement of the “start of service” was on 2015-08-07 (Bing Blog).
AI and robotics researchers issue an open letter calling for
On July 28, 2015, timed with the opening of IJCAI 2015, an international conference on artificial intelligence, AI and robotics researchers published an open letter. The letter defined autonomous weapons as . It wrote that, setting aside the legal questions, they are technically feasible , and are described as , after gunpowder and nuclear arms. It said a military AI arms race would not benefit humanity, and called for a ban on offensive autonomous weapons beyond . The signatures numbered 34,378 on the page of the Future of Life Institute (FLI), which hosts the letter (the number seen on September 23, 2026). Talks among countries had begun the year before, in May 2014, as an informal meeting of experts under the Convention on Certain Conventional Weapons (CCW), and Japan took part. In December 2023, the United Nations General Assembly adopted a resolution on lethal autonomous weapons systems, stressing the need for the international community to take urgent action.
The popular story:People tend to take it as “the researchers opposed all military uses of AI” The original source says:what the letter called to ban is . It states that remotely piloted drones and cruise missiles, where humans decide all targets, are not included. It also says there are many ways in which AI can make the battlefield safer for humans, especially civilians.
What we still don’t know:How far the letter's outlook that such weapons would be usable “within years, not decades,” legal issues aside, turned out to be right (whether fully autonomous weapons have actually been used) has not been confirmed in the sources opened for this site. The UN General Assembly resolution is also not a ban; it is a stage of deciding that the international community needs to act urgently and of gathering the views of countries.
2016: at the G7 Kagawa-Takamatsu ICT Ministers' Meeting, Japan proposes discussing
On April 29–30, 2016, the G7 ICT Ministers' Meeting was held in Takamatsu, Kagawa Prefecture, with Japan's Minister of Internal Affairs and Communications as chair. Japan proposed creating principles for AI research and development that could serve as an international reference, and presented eight as a starting draft: , , , , , , and . The countries agreed to move forward with international discussion.
January 2017Verified in the originalSources disagree
The Asilomar AI Principles (2017): Researchers Discuss and Draft Principles for
In 2017, at the conference held at Asilomar, the Future of Life Institute (FLI) acted as organizer, and AI researchers and others drafted the . The 23 principles cover research issues (for example, that the goal of AI research should be to create “not undirected intelligence, but beneficial intelligence”), ethics and values such as safety and transparency, and longer-term issues (for example, not assuming upper limits on the capabilities of future AI). Only principles that more than 90% of the conference participants agreed with were kept.
What we still don’t know:Principle 19, “Capability Caution”, says to avoid strong assumptions about the upper limits of future AI capabilities, because there is no consensus on them (it turns the present state of not knowing into a principle).
2 sources and how they were checked
Where sources disagree:Date discrepancy: the explanatory article was published on 2017-01-18, but the principles page shows “Published 11 August, 2017” (this may be the date the page was revised, but this site has not confirmed it).
Asilomar AI Principles (Future of Life Institute · 2017 · Introduction and the 23 principles (Research Issues 1–5, Et… · Original source)
On March 29, 2019, the Japanese government adopted the “Social Principles of Human-Centric AI.” It set out three ideals for the society it aims for: (translated), (translated) and (translated). It also presented seven principles that society should follow (human-centric, education and literacy, privacy protection, ensuring security, fair competition, fairness, accountability and transparency, and innovation).
What the figure shows:Rules address different groups: researchers, countries, society, or AI itself. A conversational machine that learns by imitation can be made to give a phrase most often just by a small coordinated group repeatedly saying it.
This is the same mechanism as "Try it", written as Python code. Press ▶ Run and the result appears below. Change the numbers and run it again.
u10_learn_from_users.py
222015–2019 · The end of the peak
When did the boom's peak pass?
When, and how, did the peak of the boom pass?
The March 2015 book (translated title) by Yutaka Matsuo divided the history of AI into chapters on the first to third AI booms. Drawing on this book and others, the government's 2016 (translated title) explained that AI research had gone through (translated), and that now was the third boom. In 2015, SoftBank announced that Pepper had come to (translated).
The bars on the right show how many times “AI” was said in remarks in the Diet (this site counted it from the minutes). It rose from 11 in 2015 to 593 in 2019, and fell in 2020 and 2021. In October 2019, Gartner Japan placed artificial intelligence in the “Trough of Disillusionment” (the period when disappointment spreads after expectations have grown too high).
The shape of the hill of expectations (the hype cycle) is a template from a research firm's view, not something confirmed as a law. The reason the count fell in 2020–2021 cannot be narrowed to one cause either (it overlaps the years of the pandemic).
Around the same time
In March 2019, the three pioneers of deep learning (Bengio, Hinton, and LeCun) received the Turing Award. The award announcement says that in the early 2000s the three were among the few researchers who kept at this method. Pepper was announced in June 2014 as a humanoid robot that estimates emotions from a person's facial expression and tone of voice.
The first-to-third way of counting: Matsuo's book is sometimes said to be the book that spread this way of counting. What this site confirmed is only that the government's 2016 white paper says it drew on this book for its account of history. Earlier uses, and the number of citations, we did not look into.
Sources & confidence (6)When did the boom's peak pass?
9 March 2015Verified in the originalJapan
Yutaka Matsuo's : a book that divided the history of AI into chapters on the
In March 2015, the book (KADOKAWA) by Yutaka Matsuo of the University of Tokyo was published. In its table of contents, Chapter 2 is the era of (translated) and (translated) (the first AI boom), Chapter 3 is that adding (translated) makes AI smarter (the second AI boom), and Chapters 4 and 5 cover (translated) and deep learning (the third AI boom). In the following year, 2016, the Japanese government's White Paper on Information and Communications noted in a footnote that its section on the history of AI was written with reference to this book and others.
What we still don’t know:The book is sometimes called “the book that popularized counting the booms as first to third,” but this site has not looked into earlier uses or citation counts (the way of counting itself is handled in another record that looks into how booms are counted). What was confirmed is that the government's 2016 white paper states that it used this book as a reference for its history section.
July 2016Verified in the originalSources disagreeJapan
The government's White Paper on Information and Communications (2016) explains the history of AI with a chart of the and the winters
The Ministry of Internal Affairs and Communications' 2016 (Heisei 28) White Paper on Information and Communications took up AI in a special feature. In Chapter 4, Section 2, , it used Figure 4-2-1-5, , and explained that AI research since the 1950s has seen (translated), and that we are now in the third boom. It puts the first boom in the late 1950s to the 1960s (search and inference), the second in the 1980s (knowledge representation; Japan's Fifth Generation Computer also belongs here) with a winter again from around 1995, and the third from the 2000s (machine learning).
3 sources and how they were checked
Where sources disagree:On the end of the second boom, the main text says “a winter again from around 1995.” In the figure, the second boom's bar ends around the early 1990s and a “winter” (translated) is drawn after it (the figure's year scale is rough).
5 June 2014–2015Verified in the originalSources disagreeJapan
SoftBank unveils the humanoid robot “Pepper” (2014) and puts it on general sale (2015)
On June 5, 2014, SoftBank Mobile and the French company Aldebaran announced “Pepper”, a humanoid robot that reads emotions from people's facial expressions and tone of voice. From the next day it was placed in SoftBank stores. When general sales began on June 20, 2015, the first 1,000 units reached the planned number within one minute of the start of orders. At that time the company announced that Pepper had come to (translated).
What we still don’t know:What the company calls (translated) is a mechanism in which a program runs variables modeled on how human emotions work (in the company's words, (translated)). Whether the robot feels emotions in the same sense that people do is not known (it is also the question of what an emotion is).
2 sources and how they were checked
Where sources disagree:Release date: the 2014 announcement said it would go on sale in “February 2015.” General sales began on June 20, 2015 (a company article from July 2015). What was sold in February 2015 (for example, a developer edition) has not been checked on this site.
The Turing Award Goes to the Three Who Grew Deep Learning (Bengio, Hinton and LeCun) (for 2018, announced in March 2019)
On March 27, 2019, the Association for Computing Machinery (ACM) announced that the 2018 Turing Award would go to Yoshua Bengio, Geoffrey Hinton and Yann LeCun. The reason was major advances in concepts and techniques that made deep learning a critical component of computing. The announcement said that in the early 2000s the three were among the few researchers who kept working on this method, that their efforts to regain interest were at first met with skepticism, but that it has now become mainstream in the field.
In 2019, a Japanese Research Firm Places Artificial Intelligence in the “Trough of Disillusionment”
In , published by Gartner Japan, artificial intelligence was placed in the “Trough of Disillusionment” (the period when disappointment spreads after expectations have grown too high). It explains that this was because trial uses had led people to face reality instead of expectations.
What we still don’t know:The shape of the Hype Cycle curve is the research firm's own view and has not been confirmed as a law.
[Japan] In the Diet and in book titles, the second peak is in 1990 (about 3 years later than in English) and the third in 2019; rising again from 2023
From the Diet’s records of speeches and from Japanese book titles, we counted how many times and “AI” (recounted with parts of other words removed, so that it means AI) appear. In book titles, is highest in 1990 (37 books). In the Diet, peaks in 1985 (7 mentions) and 1990 (9), and was almost 0 from 1993 to 2014. In the Diet, “AI” meaning AI went 11 in 2015 → 593 in 2019 → down to 336 in 2021 → 761 in 2023 → 2,424 in 2025 (the year the AI law was made). “Generative AI” was 0 until 2022 and reached 172 in 2023.
If you search for just the two letters “AI”, the counts in the Diet records jump in 1996 (AIDS, in the drug-induced HIV scandal), 2009 (AIG, the insurance company) and 2012 (the AIJ case about pension fund management). In book titles it also picks up the word “love” (read “ai”). When we recount after checking what each one means, those jumps disappear.
What we still don’t know:The reason the counts fell in 2020–2021 cannot be pinned down to one cause (it overlaps with the period of the infectious disease epidemic).
What the figure shows:AI mentions in Japan's parliament rose more than 50 times, from 11 in 2015 to 593 in 2019, then fell in 2020 and 2021. But they rose again in 2022, so the peak cannot be declared the start of a winter.
Closing
What this chapter still can't answer
In this era, the techniques for training deep networks fell into place (ReLU, weight initialization, dropout, batch normalization, Adam, shortcuts). Yet why batch normalization and ResNet work so well has been questioned again since the papers, or remains a hypothesis. Use spread first, and the reasons are being argued afterward. Transfer learning, which reuses a network trained on big data, also spread, but how many examples it takes before training from scratch is better changes from job to job, and is still being studied.
The human numbers behind “beat humans” and change a great deal depending on who was measured, how they were trained, and on how many images. There is also still no clear line for where we can say an AI wrote something (how far must a person revise it before it is a person's work). The relationship between AI's ability to read images and the whole job of a radiologist is also still being researched. The 47% and 49% were estimates of the probability that jobs could be technically replaced, not forecasts of how many people would actually lose their jobs.
In 2019, the number of times AI came up in the Diet passed its peak, and a research firm placed artificial intelligence in the trough of disillusionment. Whether that was the start of a winter cannot be decided from this chapter's sources alone. The Diet count rose again from 2022. In the next chapter, AI that writes text and draws pictures appears, starting from the 2017 Transformer.
Other events in this chapter (3; all with original sources and confidence grades)
11 December 2015Verified in the original
OpenAI's founding announced (December 2015): a nonprofit research company aiming to be
On December 11, 2015, OpenAI made its first announcement, introducing itself as . Its aim is to advance AI in the way most likely to benefit all of humanity, without being tied to the need to make a profit. It said its research would be published as papers and code, and that any patents would be shared with the world. The donors, people and companies together, pledged 1 billion dollars, but the announcement also says .
What we still don’t know:The announcement itself says that the history of AI is a series of surprises, and that it is hard to predict when human-level AI will arrive. It looks back that people in the past thought that solving tasks like chess would reveal the workings of human-level intelligence, but that did not happen.
The Government's “Artificial Intelligence Technology Strategy Council” (2016) and (2017)
In April 2016, following an instruction from the Prime Minister at the , the government set up the “Artificial Intelligence Technology Strategy Council.” The council acted as a command center and linked the research institutes of the Ministry of Internal Affairs and Communications, the Ministry of Education, Culture, Sports, Science and Technology, and the Ministry of Economy, Trade and Industry (the National Institute of Information and Communications Technology, RIKEN's Center for Advanced Intelligence Project, the National Institute of Advanced Industrial Science and Technology's Artificial Intelligence Research Center, and others). On March 31, 2017, the council drew up the and a that showed the spread of AI in three phases. It set “Productivity”, “Health, Medical Care and Nursing Care”, and “Mobility” as priority areas and “Information Security” as a cross-cutting area.
What we still don’t know:The roadmap itself states, (translated), so the timing is only a guide.
The Chinese Government Sets Three-Stage Goals for 2020, 2025 and 2030 in the
In July 2017, China's State Council (the Chinese government) released the . The plan says it will (translated) and sets goals for three stages. By 2020, AI technology and applications are to match the world's advanced level, and the core industry is to exceed 150 billion yuan in scale. By 2025, China is to achieve major breakthroughs in basic theory and lead the world in some areas, raise the industry to over 400 billion yuan, and create the first form of legal and ethical rules for AI. By 2030, it is to lead the world overall and become (translated), raising the industry to over 1 trillion yuan. At the same time, it lists problems such as concern that AI will change the structure of employment, conflicts with law and ethics, and invasion of privacy, and calls for safe, reliable and controllable development.
What happened next:According to Chinese government announcements, in July 2022 (translated; press conference of the Ministry of Industry and Information Technology), and in March 2026 (translated; the minister of Industry and Information Technology). On paper, this means both the 2025 target and the 2030 target (1 trillion yuan) have been exceeded. However, both are government-side estimates, and the announcements do not say whether the way of counting is the same as in the 2017 plan. Goals such as (translated) have not been confirmed in the sources we opened.