CHAPTER 10/2012–2019

The Peak of the Third Boom

Go, shogi, and predictions about jobs (2012–2019)

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

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.

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

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.

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.

Q(s, a) ← Q(s, a)+α[r+γ maxa′ Q(s′, a′) − Q(s, a)]
s
current state
a
action
r
reward received
s′
next state
α
learning rate
γ
weight of future rewards
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.

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

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.

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.

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.

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.

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.

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

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

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.

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.

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

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.

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.

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.

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.

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

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.

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.

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

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.

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

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.

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

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.

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

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

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

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.

1 sources and how they were checked
  1. Introducing OpenAI (archive.org copy of 2015-12-16) (Greg Brockman, Ilya Sutskever, and the OpenAI team · 2015 · Paragraph 1 of the main text, and the sections Background, … · Original source)
31 March 2017Verified in the originalJapan

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.

2 sources and how they were checked
  1. Artificial Intelligence Technology Strategy (compiled by the Artificial Intelligence Technology Strategy Council) (Artificial Intelligence Technology Strategy Council · 2017 · p.2 2. The government's system for promoting AI technology deve… · Original source)
  2. Research and Development Goals for Artificial Intelligence and the Roadmap for Industrialization (Artificial Intelligence Technology Strategy Council · 2017 · p.1 (1-1) Organizing the stages of AI development by phase · Original source)
8 July 2017Verified in the original

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.

1 sources and how they were checked
  1. Notice of the State Council on Issuing the New Generation Artificial Intelligence Development Plan (Guofa [2017] No. 35) (State Council · 2017 · I. Strategic situation/II. General requirements, (3) Stra… · Original source)