In the shadow of shrinking knowledge-writing AI, neural networks that learn from data grew (1987–2005)
The business of AI that writes in experts' knowledge shrank, and a second was said to have arrived. But in those same years, neural networks, which imitate the connections between brain cells, kept producing techniques that lead straight to today. In this chapter we run those mechanisms one by one to check them.
011984–1996 · United States
Measuring the Winter's Chill in Numbers
Did the winter that people worried about in 1984 really come?
In August 1984, at a panel discussion at the conference of the American Association for Artificial Intelligence (AAAI), the chair, Drew McDermott, described a . In about five years, the Defense Department's would fail, startups would go bankrupt, and funding for AI would dry up. He introduced this state as what some call . But he also said that he did not think it very likely.
The figure on the right shows the American data that followed. AAAI membership peaked at 16,421 in 1987 and fell to 4,000–5,000 by 1996. Sales of products at Symbolics, which developed Lisp machines (computers built specially for AI), dropped from $101.6 million to $55.6 million between fiscal 1986 and fiscal 1988. Numbers with different units can be compared too, once you set each peak to 100.
Scaled value=number in that year ÷ number in the peak year × 100
Peak
the year with the highest value
What you think you knowThe popular story:The 1984 panel accurately predicted the AI winter The original source says:The chair presented it as a and said it was not very likely. Much of the scenario did happen, but not all at once five years later.
The chair's own view
In the record of the discussion, the chair says, . The aim of his call was to reduce the gap between expectations and reality, with researchers restraining themselves and explaining honestly to society.
Why did Lisp machines stop selling?
According to the recollection of one of Symbolics's founders, two reasons overlapped. General-purpose workstations (high-performance computers for one user), such as those from Sun and Apollo, began to run Lisp comfortably, and around 1988 came the backlash against excessive expectations for AI that builds in experts' knowledge. Sales were $82.1 million in fiscal 1987.
Life in the depth of winter
In 1990, MIT's Rodney Brooks wrote that , both in the US and abroad. The defense research agency DARPA canceled its autonomous vehicle program in April 1988, and the Strategic Computing Initiative disappeared from the budget in 1993.
Whether one item of the scenario, , really happened has not yet been confirmed.
Sources & confidence (3)Measuring the Winter's Chill in Numbers
August 1984Verified in the original
The worst-case scenario of “The AI Winter” drawn in a 1984 discussion ── checking the answers afterward
At the conference of the American Association for Artificial Intelligence (AAAI), a panel discussion was held titled The moderator, Drew McDermott, said that behind the bustle in industry, there was deep unease among people who had researched for many years, from a worry that . As the worst-case scenario he drew this picture: in five years America's fails, Japan's Fifth Generation also hits a dead end, start-up companies go under, funding for AI stops, and everybody changes the names of their research to something else. He introduced the fact that some people call this state “The AI Winter.” But he also said he thought it unlikely. In the discussion, another researcher (Roger Schank), when asked whether he thought a catastrophe would come, said that he told them it would. On the other hand, the view was also put forward (the same person went on to say that the bubble might not burst but shrink a little).
The popular story:It is often said that the 1984 discussion predicted the AI winter exactly (a warning that came true) The original source says:The moderator drew it as a , and said himself, . Even within the discussion, views ranged from a catastrophe coming to its being not a winter but a dusk. Over the next few years, many parts of the scenario (the shrinking of the strategic computing initiative, the decline in companies, the decline in society membership, the end of the Fifth Generation's main stage) did happen, but not all at once five years later
What happened next:Afterward, development of the autonomous land vehicle (ALV), one of the plan's showpieces, was cut off in April 1988. The head of the responsible division, who took up the post in 1987, also cut off parts of the AI program. The plan disappeared from DARPA's budget in 1993. Membership in the American Association for Artificial Intelligence peaked at 16,421 in 1987 and settled at 4,000–5,000 by 1996. Many of the AI companies developing expert systems disappeared, were acquired, or changed their business. Japan's Fifth Generation Computer Project ended its main stage in fiscal 1992. Nilsson writes that these events piled up in the mid-to-late 1980s and came to be called “The AI Winter.”
What we still don’t know:Whether one of the scenarios, , really happened in the 1990s has not been confirmed in original sources (a candidate dealt with in u08)
3 sources and how they were checked
The Dark Ages of AI: A Panel Discussion at AAAI-84 (Drew McDermott, M. Mitchell Waldrop, B. Chandrasekaran, John McDermott, Roger Schank · 1985 · p.122 Drew McDermott's opening talk · Original source)
1984: was spoken of as the name of the worst thing that might come
At a panel discussion at AAAI-84, the moderator, Drew McDermott, said that researchers were worried that expectations for AI were too high and that it would someday end in trouble. As the worst-case scenario he gave this picture: in five years the strategic computing initiative fails miserably, Japan's Fifth Generation also does not work out, the Japanese government quickly pulls out of computers, the start-up companies all go bankrupt, and no money goes to anything related to AI. He described this as . He urged them to warn themselves so that it would not come to that, and to tell the world. In other words, “The AI Winter” was a phrase that appeared in the middle of the second boom as a warning about the future. Calling the decline in research funding in the 1970s the is a label added afterward.
The popular story:It is often thought that the drop in research funding in the 1970s was called an at the time The original source says:The oldest record found is a 1984 discussion, where it appears as the name of the worst thing that might come in the future (the speaker said ). The (the 1970s) is a label added afterward. English-language books number the winters, as in , but is hardly used
What we still don’t know:Who first said is not known (even in the discussion it was “by some”). What book the small value for 1983 in the Ngram comes from has not been confirmed.
2 sources and how they were checked
The Dark Ages of AI: A Panel Discussion at AAAI-84 (Drew McDermott, M. Mitchell Waldrop, Roger Schank, B. Chandrasekaran, John McDermott · 1985 · p.122 Drew McDermott's opening remarks · Original source)
Companies making AI-specific “Lisp machines” lose to ordinary workstations (late 1980s)
From around 1980, companies such as Symbolics built and sold “Lisp machines,” special computers that run Lisp, a programming language often used in AI research, fast. According to the recollection of one of Symbolics' founders, new from Sun, Apollo and others appeared, and even ordinary computers could run Lisp quite well. So the advantage of the dedicated machines suddenly became small. He also writes that most of the sales depended on expectations for expert systems (AI into which experts' knowledge is written), and that the backlash from those expectations swelling too far came around 1988 and became “The AI Winter.” The company repeatedly cut staff. According to a student paper (2001) written for an MIT course, Symbolics' product sales fell to $101.6 million, $82.1 million and $55.6 million in fiscal 1986, 1987 and 1988. In Japan too, the 1991 white paper wrote that the machines used for AI had come to center not on dedicated machines but on ordinary computers, especially personal computers.
The popular story:It is often said that in 1987 the AI winter suddenly collapsed the Lisp machine market The original source says:In the founder's recollection, two reasons overlapped: the technical change of ordinary workstations (such as Sun) and Lisp running on ordinary machines coming out, and the backlash from expectations for AI into which experts' knowledge is written swelling too far (around 1988). In the student paper's figures too, sales fall over several years starting from fiscal 1986.
What we still don’t know:We have not opened primary company documents such as the annual reports of Symbolics or LMI. We have not obtained MIT's 1999 bachelor's thesis because a human-verification screen appeared on MIT's site.
5 sources and how they were checked
Where sources disagree:When it collapsed: the student paper says “crisis by 1987,” and the recollection says “a big backlash around 1988.” The sales figures were confirmed only in the student paper (we have not opened the company's annual reports themselves).
AI White Paper 1991: AI Technology and Its Use (Supervised by the Electronics Policy Division, Machinery and Information Industries Bureau, Ministry of International Trade and Industry (MITI); edited by the ICOT-JIPDEC AI Center · 1991 · p.11 Part 2, Chapter 1 (survey feature 7) · Original source)
What the figure shows:The AI winter discussed in 1984 as a “worst case scenario” did not arrive all at once 5 years later, but through declining membership and sales over several years.
021987–2003 · Japan
Did Winter Never Come to Japan?
While people in the US spoke of a winter, how was Japan doing?
In March 1991, the , supervised by the Ministry of International Trade and Industry, wrote that Japan (translated). Fuzzy theory (a theory for handling vagueness) was popular in Japan, and in 1990 the word won the gold prize in the New Word category of the Japan New Words and Buzzwords Awards.
One basis for the white paper was a survey in 1989. The share that had adopted AI was 26.2% of the responding computer-using establishments, 80.5% of the members of the AI center, and 37.8% overall. But of the 7,084 places that were sent the questionnaire, only 1,844 answered. In the figure on the right, see how the share changes depending on whom you ask.
Switch the figure to the academic society's membership, and corporate members and the like peaked at 155 companies in 1991 and 1992, then fell to 49 by 2003. Winter seems to have come to Japan late and slowly.
Share among those who answered=number that adopted ÷ number that answered
Lower bound
the share if every place that did not answer had not adopted (number that adopted ÷ number sent)
What you think you knowThe popular story:After the second boom, Japan entered winter at the same time as the world The original source says:The 1991 white paper, supervised by the government, wrote that Japan had not entered a winter like America's. Corporate membership in the academic society began to fall only in the report for 1993, after that.
The fuzzy craze
In 1987, predictive fuzzy control was adopted for the automatic operation of the Sendai city subway, and in February 1990 a washing machine that used fuzzy logic went on sale. In 1989, the Laboratory for International Fuzzy Engineering Research (LIFE), which brought together 48 companies, was founded.
How the white paper made its comparison
The white paper compared the 1989 survey's total of 37.8% with 20.6% in the 1988 survey and wrote that it had risen by 17.2 points. But both are shares among those who answered, and the 1989 total includes members with a high interest in AI (80.5% of whom had adopted it).
The magazine that dropped the word “AI”
The specialist AI magazine changed its title to from issue 151 in April 1992 and ceased publication in October 1994 (the bibliographic information gives no reason). In a 2023 recollection in the society's journal, Hitoshi Matsubara looks back that at the time (translated). Another article in the same issue also gives the reason for taking the names of individual fields as (translated).
How the membership counts were compiled
They were compiled from the annual general-meeting reports (figures as of March 31 of each year, and so on). The peak of regular members was 3,893 in 1993. Student members rose and fell but kept an upward trend until 2002. This site has not compiled the figures for 2000 and 2001.
Sources & confidence (7)Did Winter Never Come to Japan?
20 March 1991Verified in the originalSources disagreeJapan
1991, a government-supervised white paper: Japan (translated)
The wrote that Japan did not enter an AI “winter” (translated) like the one seen earlier in the United States. As the reason, it suggests that users may have found for themselves the uses in which AI is effective (it also writes that the United States had already been through its “winter”). In the white paper's survey (December 1989 to January 1990, sent to 7,084 establishments, with 1,844 replying), 37.8% of the responding establishments (26.2% of the establishments that use computers, 379 sites) had introduced AI. The white paper reported this as 17.2 points more than the 20.6% of the 1988 survey. Of the adopters, 46.2% used expert systems (mechanisms in which experts' knowledge is written) and 20.6% used machine translation.
The popular story:It is often said that after the second boom, Japan too went into winter along with the world The original source says:The government-supervised white paper of 1991 wrote that Japan had not entered a winter like the one seen in the United States. The survey too showed that the share of establishments that had introduced AI grew from 1988 to 1989 (though that is the share among the establishments that replied).
What we still don’t know:This white paper cannot tell how AI use in Japan changed after 1991 (when winter came, or whether it came at all). The survey results are also shares among only the establishments that replied (26% of those sent), not shares for Japan as a whole.
1 sources and how they were checked
Where sources disagree:Japan's “second winter”: this 1991 white paper writes that Japan “did not enter a winter like the one seen in the United States.” On the other hand, the 2016 white paper of the Ministry of Internal Affairs and Communications writes “a winter again from around 1995” (another record). They were written in different years, so it can also be read that in 1991 winter had not yet come.
AI White Paper 1991: AI Technology and Its Use (Supervised by the Electronics Policy Division, Machinery and Information Industries Bureau, Ministry of International Trade and Industry (MITI); edited by the ICOT-JIPDEC AI Center; published by the Japan Information Processing Development Association · 1991 · p.11 Part 2, Chapter 1, 1.1 (and the survey in Part 1, PDF pages… · Original source)
24 July 1986–2003Verified in the originalSources disagreeJapan
Membership of the Japanese Society for Artificial Intelligence (1986–2003): regular members peaked in 1993 and supporting members in 1991–92. Supporting members fell to under a third by 2003. Student members kept rising until 2002
Lining up the membership figures given in the society's annual general-meeting reports shows the following. Regular members: about 600 at the founding in July 1986 → 2,554 in 1988 → 3,625 in 1990 → 3,893 in 1993 (the most) → 3,269 in 1995 → 3,044 in 1999 → 2,789 in 2003. Supporting members, the companies and other organizations that support the society: about 30 companies → 100 companies in 1988 → 155 companies in 1991 and 1992 (the most) → 96 in 1995 → 65 companies in 1999 → 49 companies in 2003, a fall to less than a third of the peak. Student members, on the other hand, rose and fell but kept an upward trend, from 266 in 1988 to 539 in 2002. The 2003 report wrote as follows. The number of members had been falling little by little for several years, but this year there was a large drop of about 4%. Not only did regular members fall because companies shrank their research and development departments, but student members, who had kept an upward trend until then, also began to fall.
The popular story:It is often lumped together as “in the winter, everyone left AI research” The original source says:Looking at the society's membership, what first dropped greatly was companies (supporting members, from 155 companies in 1991 and 1992 to 49 in 2003), while the decline in regular members was gradual (about 30% down, from 3,893 in 1993 to 2,789 in 2003). Student members, though they rose and fell, kept an upward trend until 2002 (266 in 1988 → 539 in 2002; the 2003 report also says they (translated)). Also, the government-supervised white paper of March 1991 wrote that Japan “did not enter an AI ‘winter’ like the one seen earlier in the United States” (translated) (record → 1991, a government-supervised white pap…), and the society's numbers began to fall only after that (supporting members from the 1993 report: 155 companies → 134 organizations; regular members after the 1993 peak: 3,712 in the 1994 report)
What we still don’t know:As to why members fell, the society's report only writes (translated) in 2003 and gives no reasons for earlier years. How much this has to do with the recollection that (translated) cannot be told from these numbers (see record → The source of the story that Artificial…).
3 sources and how they were checked
Where sources disagree:The unit used for supporting members differs by year: “companies,” “organizations” and “members” (1990 is printed as “143 members,” 1993–1995 as “organizations,” and 1996 as “93 members”). This record lines them up as the same category of members
1990: a washing machine with fuzzy control goes on sale, and wins the gold prize in the new-word category of the New Words and Buzzwords Awards
On February 1, 1990, Matsushita Electric released the fully automatic washing machine “Aisaigo Day Fuzzy”. It uses an optical sensor to detect how cloudy the wash water is, and decides the washing time with six rules such as (translated) (the saturation time is the time until the cloudiness settles, and the transmittance is how easily light passes through). These rules were created from data collected in homes and from engineers' know-how. In the same year's , was chosen for the gold prize in the new-word category. The organizer explains that this washing machine was the first to apply fuzzy theory to a home appliance and the spark of the boom, creating a large fuzzy market with many companies jostling in.
The popular story:The fuzzy boom is often thought to have begun with home appliance advertising The original source says:Before home appliances there was the automatic operation of the Sendai city subway in 1987 (→ Sendai's subway opens, using predictive…) and the government-backed research association LIFE in 1989 (→ Laboratory for International Fuzzy Engi…). The (translated) among home appliances was the 1990 washing machine (the organizer's explanation)
What we still don’t know:We have not checked how well fuzzy appliances sold afterward (sales numbers and so on)
1989–1995Verified in the originalSources disagreeJapan
Laboratory for International Fuzzy Engineering Research (LIFE): 48 companies gather and, with government backing, study technology for handling (translated) for six years (1989–1995)
To apply fuzzy theory, which processes information that contains (translated), to engineering, the technology research association “Laboratory for International Fuzzy Engineering Research (LIFE)” was founded in 1989. Not only computer companies but 48 companies (49 at the end of fiscal 1989), in fields such as automobiles, steel and securities, took part. The research period was about six years, and the research and development cost was expected to be about 5 billion yen (as of the 1991 white paper). The laboratory had three research rooms, studying fuzzy control, fuzzy intelligent information processing and fuzzy computers. According to a 2005 look back, a total of 66 researchers were on staff at the laboratory near Osanbashi pier in Yokohama, and it was active until 1995. Toshiro Terano served as director for all six years.
What we still don’t know:We have not checked the total cost actually spent (the 1991 white paper only writes (translated))
2 sources and how they were checked
Where sources disagree:Number of participating companies: 48 (the white paper's main text and the 2005 look back) and 49 (the white paper's “as of the end of fiscal Heisei 1 (1989)”). The difference comes from the date of counting.
Sendai's subway opens, using (translated) (AI with rules that handle vagueness) for automatic train operation
The Sendai city subway (the ninth city subway in Japan) opened on July 15, 1987. The automatic train operation system developed by Hitachi adopted (translated). It used AI (knowledge engineering) rules written in (translated) (the form 'if so-and-so, then do so-and-so') to replace the skills of expert drivers. The article says that better ride comfort, better stopping accuracy and energy saving were achieved, and introduces this predictive fuzzy control as (translated) (the words of the article by the company that made it).
The popular story:Fuzzy is often thought to be a buzzword of home appliances The original source says:Before home appliances, it was used in the automatic operation of the Sendai city subway that opened in 1987. The company that developed it explains it as AI (knowledge engineering) rules in “IF-THEN form” (translated) (written as one of the second-boom AIs that build in knowledge).
What we still don’t know: (translated) is the words of an article by the company that made it, and has not been confirmed in other sources.
9 September 1985–1994Verified in the originalJapan
The story of the magazine (1985–1994): the biweekly specialist magazine dropped “AI” from its title in April 1992, became , and ceased publication in October 1994
Nikkei BP began publishing the AI (artificial intelligence) specialist magazine with a “pre-launch special issue no. 1” on September 9, 1985. From issue no. 1 on January 6, 1986, it came out every two weeks (biweekly). From 1990, a quarterly also appeared. But after issue 150 (March 23, 1992), the title changed from issue 151 (April 6, 1992) to “Nikkei Intelligent Systems,” and the letters “AI” disappeared from the title. It ceased publication with issue 211 (October 3, 1994) (the special edition also changed in 1992 to and ceased publication with the autumn 1992 issue). It is a record of a magazine that was born in the middle of the second boom, changed its title in the early 1990s, and ceased publication.
The popular story:The story that in Japan in the 1990s the word “AI” was disliked comes, as far as this site has found, from a 2023 researcher's recollection (record → The source of the story that Artificial…) The original source says:As a record from the time, the National Diet Library bibliographic records confirm that the AI specialist magazine dropped “AI” from its title in April 1992 and was renamed “Nikkei Intelligent Systems.” However, the bibliographic records do not state why the title was changed (the reason is unconfirmed).
What we still don’t know:We have not checked why the title was changed to “Intelligent Systems”, why the magazine ceased publication, or how the circulation changed (we have not opened the magazine itself or announcements from the time).
1992–2010Verified in the originalSources disagreeJapan
The source of the story that was disliked in the 1990s–2000s: a recollection in the 2023 society journal (even renaming the society was discussed), and “The AI Winter” and “the winter era of artificial intelligence” in the society journal of 1996
In 2023, the Journal of the Japanese Society for Artificial Intelligence depicted the history of AI in a series of cover paintings, and the third one took up “the second winter” (translated) (around 1992 to around 2010). In the commentary, Hitoshi Matsubara recalled that there was big news at the time, such as Deep Blue, but the word AI was disliked and it was not seen as part of the AI category. The society too lost members and corporate members one after another and nearly collapsed, and changing its name was even considered. Tadahiro Taniguchi wrote that it was an age when, even if you wanted to research “Artificial Intelligence,” saying so made people take it the wrong way, and that in the 2000s the wind was strong against neural networks. In a roundtable in the November issue the same year, Matsubara said there was also talk that writing made it hard to pass the review for national research funding (Kakenhi). On the other hand, in the explanation by the creator of the cover paintings in the same May issue, the reason researchers in this period began to name specific fields rather than is explained as (translated). Going back to the May 1996 issue of the same journal (the 10th-anniversary issue), Hiroaki Kitano wrote that the phrases “The AI Winter” and (translated) were spreading in some news reports (though he also wrote that the results of expert systems and others had spread widely). On that basis he aimed at (translated). Mikio Shoji, who belonged to a company, also wrote that he sometimes heard the phrase “the winter era of artificial intelligence” (translated). In the roundtable of the same issue, an opinion was also offered that it was fine if new technologies were useful even if they were not called AI.
The popular story:It is said that “in Japan too in the 1990s–2000s, researchers avoided the word ‘AI’” The original source says:Tracing it back, the clearest statement is the 2023 recollection of researchers in the society journal (Hitoshi Matsubara, Tadahiro Taniguchi). As records of the time, the 1996 society journal writes that the expressions “The AI Winter,” (translated) and “the winter era of artificial intelligence” (translated) were heard in the world (Hiroaki Kitano, Mikio Shoji). Also, in April 1992 the specialist magazine dropped “AI” from its title (record → The story of the magazine Nikkei AI (19…). On the other hand, the 2023 society journal's commentary also explains the reason researchers named specific fields as “from the expansion of the research field itself” (translated). This site has not found a record from the time of the society's considering a rename itself.
What we still don’t know:No source has been found that counted whether grant applications that wrote were really harder to pass. A record from the time of when and where the society's rename was discussed is also unconfirmed.
5 sources and how they were checked
Where sources disagree:The reason the name stopped being used: the explanation by the cover-painting creator in the May 2023 issue says (translated), while Matsubara in the same issue says (translated). We do not decide on just one.
What the figure shows:A 1991 white paper said Japan had no winter, but the percentage supporting that claim changes greatly with who was surveyed. Society membership suggests that Japan's winter came slowly and later.
031992–1995 · Japan's national programs
From Symbols to Learning
After the Fifth Generation, what did Japan's national programs aim for?
In 1995, three of Japan's national programs ended together: the Fifth Generation project, which aimed at computers that reason with logic; the Japan Electronic Dictionary Research Institute (EDR, 1986–1995), which built a huge dictionary for computers by hand; and LIFE (1989–1995), which handled vagueness.
Earlier, in 1992, the Ministry of International Trade and Industry had started a 10-year program, . According to Nobuyuki Otsu, who led it, the Fifth Generation pursued the (translated), whereas RWC pursued the (translated), that is, it aimed at technology that handles vague information such as images and sound flexibly through learning.
Move "Current year" in the figure on the right, and the aim of the programs under way that year shifts from symbols to patterns and learning.
Average per year=total money ÷ number of years
Average
the value smoothed by dividing by the number of years; the same amount was not spent every year
How the Fifth Generation ended
The main project ended in March 1993, one year later than the planned 10 years. In the next two years, the software it had made was adapted to run on ordinary computers, and a total of 100 programs were released free. All research funded by the national budget ended in March 1995.
RWC's money and results
A 1994 explainer wrote of a plan of (translated), and a 2002 summary wrote about 60 billion yen over 10 years. The summary lists a system that reads sign language among its results and says that about 20% (14 items) of the results were used in products or real work along the way. How RWC's research on learning connected to the later deep learning AI is not written in the sources we examined.
The phone that speaks and translates (1986–1993)
In April 1986, the ATR Interpreting Telephony Research Laboratories was set up inside the Advanced Telecommunications Research Institute International (ATR). On January 28, 1993, an experiment connected Japan, the United States, and Germany. The vocabulary was about 1,500 words, and it came with the condition of speaking phrase by phrase with a short pause.
Sources & confidence (5)From Symbols to Learning
July 1992–2002Verified in the originalSources disagreeJapan
The national project after the Fifth Generation: (1992–2002), moving from symbols and logic to “patterns” and “learning” such as images and sound
In 1992 the Ministry of International Trade and Industry (MITI) launched a 10-year national project, , as the successor to the Fifth Generation computer project. According to Nobuyuki Otsu, who led the plan, the Fifth Generation pursued the “logical side (symbol processing)” (translated) of human thought, while RWC aimed at the (translated). In other words, it was technology for handling vague information such as images, sound and everyday language flexibly, through learning (a machine adjusting its own workings from examples) and self-organization. A 1994 explanatory article introduced it as a plan of (translated) and gave household robots and electronic librarians as examples. In July 1992 a research partnership (RWCP) was founded, and besides major Japanese companies, research institutions from Germany, the Netherlands, Sweden and Singapore took part. The first five years (1992–1996) explored widely, and the last five years (1997–2001) narrowed the work to two themes, “real-world intelligence” and “parallel and distributed computing”. The 2002 summary gives the budget as about 60 billion yen over 10 years, and lists as results a sign-language recognition system, software that cross-searches sound, video and text without an index, and a music database free for researchers to use. It also records that about 20% (14 items) of the results were adopted in products or practical work even during the project.
What we still don’t know:The sources we opened do not say how RWC's research on pattern processing and machine learning connected, or did not connect, to the later third boom (the deep-learning AI) (the learning methods named in the 2002 summary include multilayer neural networks, Bayesian estimation and genetic algorithms).
5 sources and how they were checked
Where sources disagree:Budget: the 1994 article gives the plan as (translated), while the 2002 summary says it “has been carried out with a budget of about 60 billion yen over 10 years” (translated) (probably the difference between planned and actual amounts, but the sources do not explain). Number of companies: 1994 says “16 major domestic private companies”, 2002 says “about 15 companies”. Name of the Singapore institution: ISS in 1994, KRDL in 2002 (the sources we opened do not tell whether they are the same institution). End date: the sources say “end of fiscal 2001” and “ended with fiscal 2001”, which in calendar years is March 2002 (this site's conversion).
April 1993–1995Verified in the originalSources disagreeJapan
Two years after the Fifth Generation: 100 programs released free of charge, with UNIX support (1993–1995)
The main Fifth Generation project ended in March 1993, and in April a successor, the , began. Software that ran only on the parallel inference machines was ported, using a mechanism that translates KL1 into the C language (KLIC) and other means, so that it would also run on the UNIX parallel computers then appearing on the market. The software developed was released free of charge as “ICOT Free Software”, growing from 71 programs in June 1992 to a total of 100 by the end of March 1995. The software, whose copyright belongs to ICOT rather than the government, was released with restrictions that would hinder research removed. About 2.8 billion yen was spent on this successor plan, and all government-funded research and development was completed in March 1995.
The popular story:“The Fifth Generation was a 1982–1992 project,” is often all that is written (even the table in the notes from when this site was first being made says 1982–1992) The original source says:The main project ran one year past its planned 10 years and ended in March 1993 (the end of fiscal 1992). A plan then continued for two more years, making what had been built usable on UNIX computers and releasing it free. All research funded by the government ended in March 1995.
What we still don’t know:This record does not confirm how much the 100 released programs were used afterward (for example, download counts); Figure 5 on p.126 of the MITI Research Review shows access counts up to February 1995.
4 sources and how they were checked
Where sources disagree:Duration of the later plan: the conference page of the ICOT Archive and the table of contents of the committee's materials say “Heisei 5–6 (2 years)” (fiscal 1993–1994), and the MITI Research Review says “fiscal 1993–1994 (2 years)”. Only the IFS page of the same archive says “from Heisei 5 to Heisei 7” (fiscal 1993 to 1995) (it does not say whether this means that the release was finished by the end of March 1995).
April 1986–1995Verified in the originalSources disagreeJapan
Japan Electronic Dictionary Research Institute (EDR): building by hand, over 9 years, a huge dictionary that lets computers handle the meaning of Japanese and English (1986–1995)
As a foundation for getting computers to understand natural language, a company to develop a large-scale, high-quality “electronic dictionary”, the “Japan Electronic Dictionary Research Institute (EDR)”, was established, and the project began in April 1986. The Japan Key Technology Center invested in it (AI White Paper 1991), and eight computer companies also put in funds (EDR's 1996 paper). The institute made a “word dictionary” describing the grammar and meaning of words, a “concept dictionary” organizing the relations among concepts, a “co-occurrence dictionary” recording how words go together, and a “bilingual dictionary” showing the correspondences between Japanese and English, among others. The dictionaries now introduced on the page of the National Institute of Information and Communications Technology (NICT) are of this size: about 270,000 Japanese words, about 190,000 English words, about 410,000 concepts, about 200,000 Japanese example sentences and so on. The final evaluation of the Fifth Generation project wrote that collecting the vast knowledge that lies outside of words has limits for ICOT alone, and expected much from EDR's dictionaries.
What we still don’t know:The total cost of the project is not stated in the sources we looked at.
4 sources and how they were checked
Where sources disagree:Period: the AI White Paper 1991 says “started in April 1986 (Showa 61), planned to run until March 1995 (Heisei 7),” and EDR's 1996 paper says “nine years, fiscal 1986–1994” (the same period written in months and in fiscal years). Dictionary size: at the time of the 1991 white paper, a little over 200,000 words each for Japanese and English and just under 500,000 concept headings; on the current NICT page, 270,000 Japanese words, 190,000 English words and 410,000 concepts (the difference between the numbers during development and after repeated revisions).
April 1982–1995Verified in the originalSources disagreeJapan
Government spending on the Fifth Generation: about 54.1 billion yen over the main 11 years, about 56.9 billion yen with the later 2 years added
According to a table compiled in 1995 by the Ministry of International Trade and Industry's research institute (the MITI Research Institute), government spending on the Fifth Generation Computer project was about 54.1 billion yen over the 11 fiscal years 1982–1992 (initial stage 8.3 billion yen, middle stage 21.6 billion yen, final stage 24.2 billion yen). After that, about 2.8 billion yen was spent over the two fiscal years 1993–1994 on a finishing plan (a plan to make what had been built usable on ordinary computers), bringing the total to about 56.9 billion yen. The commonly seen figures of “about 54 billion yen” and “57 billion yen” differ only in whether these last two years are counted.
The popular story:People give different numbers: “the Fifth Generation cost 57 billion yen,” or “no, it was 54 billion yen” The original source says:In the government's table, the main 11 years come to about 54.1 billion yen, and adding about 2.8 billion yen for the later 2 years makes about 56.9 billion yen. Both numbers are in the table; the difference is how far the counting goes
What we still don’t know:The table covers only the money paid by the government (MITI). Funds and staff that participating companies bore on their own are not in this table (as far as can be read from the table's notes)
4 sources and how they were checked
Where sources disagree:“About 54 billion yen” comes from the final evaluation report (1993) and the main text of the MITI Research Review (1995), “total 54.1 billion yen”; both cover the 11 fiscal years 1982–1992. / “57 billion yen” comes from a 2017 Diet statement and the like; it matches about 56.9 billion yen, the total with the later two fiscal years 1993–1994 (about 2.8 billion yen) added. /Nilsson 2010 gives “54.2 billion yen” from Uchida's slides. All of them are explained by the same table, and the disagreement is only in the range of years counted
1986: ATR Interpreting Telephony Research Laboratories, research on a telephone that automatically translates speech into the other person's language. In January 1993, an experiment linking Japan, the US and Germany (vocabulary of about 1,500 words)
An “automatic interpreting telephone”, which automatically translates the speech on a phone call into the other person's language, is built by combining speech recognition (listening to a voice and turning it into text), machine translation and speech synthesis (a computer producing a voice). In April 1986, the “ATR Interpreting Telephony Research Laboratories” was set up inside ATR (Advanced Telecommunications Research Institute International). Basic research to check the component technologies began, and in 1988 it had 47 researchers, including visiting researchers from abroad. For translating spoken language, the laboratories also built a large labeled speech database and a database holding a large collection of examples. As a research result it built an experimental speech translation system, ASURA, and on January 28, 1993 it held an international joint experiment on automatic interpreting telephony connecting three countries, Japan, the United States and Germany. ASURA translated sentences spoken with a short pause after each phrase, with a vocabulary of about 1,500 words (the earlier version, SL-TRANS, had under 400 words). The research ended in March 1993 and was taken over by ATR Interpreting Telecommunications Research Laboratories.
The popular story:A machine that translates what you say is often thought to have been born in the smartphone era (the 2010s) (how this is said is this site's estimate) The original source says:In Japan, an “automatic interpreting telephone” had been researched since 1986 at an ATR laboratory. In January 1993 an experiment even connected three countries (though with a vocabulary of about 1,500 words and under the condition of speaking with pauses after each phrase). For the 2010 NICT speech translation app, see record → Japan's national research institute NIC….
What we still don’t know:The source and amount of ATR's research funding are not given in the sources we opened (this site has not checked). We have also not checked how accurately the 1993 international experiment translated, in the first page we opened.
What the figure shows:After the Fifth Generation project, based on symbols and logic, Japan's national project shifted toward patterns and learning, aiming to handle images and speech flexibly through learning.
041982 · Neural networks
Falling Into an Energy Valley
Why does a network that recalls always settle somewhere?
In April 1982, the physicist John Hopfield presented a network in which all neurons, each taking a value of +1 or −1, are connected to one another. The strength of each connection is the same in both directions. Neurons are updated one at a time, according to the sign of the sum of the input they receive from the others.
Using the physics idea of studying the properties of magnets, the paper defined a number called energy for each state. Every time one neuron is updated, the energy goes down or stays the same. So it always stops at the bottom of some valley in the end. If you make the learned patterns the bottoms of valleys, then even starting from a corrupted pattern, the network falls into a nearby valley and recalls the pattern.
In the graph under the figure on the right, check that the energy never goes up. The paper wrote that the network can store patterns up to about 0.15 times the number of neurons, N.
E= −½ Σi≠j wij si sj si ← sign(Σj wij sj)
si
value of neuron i (+1 or −1)
wij
strength of the connection between i and j (the same in both directions)
E
total energy
What you think you knowThe popular story:Hopfield built the first associative-memory network in 1982 The original source says:His own paper cites earlier work, including Shun-ichi Amari (1977, 1978). In 1972, Kaoru Nakano and Shun-ichi Amari had published a similar mechanism (Chapter 5).
Does a real brain recall this way too?
The paper does not confirm it. It is a model studied with physics ideas, based on part of how nerves work.
Sources & confidence (1)Falling Into an Energy Valley
April 1982Verified in the original
The physicist Hopfield presents a neural network that recalls the whole from a part
The physicist John Hopfield presented a mechanism in which many simple (imitations of nerve cells) are all connected to one another. Just by being shown part of something it has memorized, it can restore the whole (associative memory). He explained it with an idea from the physics of magnets, in which the whole system settles into a place of low energy, the paper's .
The popular story:It is often said that Hopfield first built the associative-memory neural network in 1982 The original source says:Hopfield's own paper cites earlier work by Shun-ichi Amari (1977, 1978) and by Little (1974). The Nobel Committee's explanation (2024) also cites earlier work by Kaoru Nakano (1972), Shun-ichi Amari (1972), and others. Japanese researchers had published a similar mechanism 10 years earlier.
What we still don’t know:This paper does not confirm whether the real brain really recalls memories by this mechanism (the paper's model is based on part of how nerves work and was studied with ideas from physics).
What the figure shows:Each update of 1 neuron lowers the energy or leaves it unchanged, so the network always stops at the bottom of a valley. Placing stored patterns at valley bottoms lets it recall them from damaged patterns.
Energy after each single update
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.
u08_hopfield_energy.py
051985 · Neural networks
Neurons That Move by Chance
What do we do when we get stuck in a shallow valley?
A Hopfield network can only go downhill. In the Boltzmann machine of Ackley, Hinton, and Sejnowski (1985), neurons choose on or off by probability, so the network can sometimes go uphill too. What sets the randomness is the temperature T. If you lower the temperature gradually, the network tends to settle at low energy (the same idea as annealing in physics).
In the figure on the right, press "Anneal (cool slowly)" and "Quench" several times, and compare how often each reaches the deepest valley.
The paper also gave a rule for training networks with hidden neurons. It compares the probability that two neurons are on at the same time when the data are shown and held fixed with when the network runs freely, and corrects the weights by the difference. At first the calculation took so long that it was not very useful (the Nobel Committee's explainer, 2024).
P(on)=1/(1+e−ΔE/T) Δwij ∝ p+ij − p−ij
ΔE
the energy drop if the neuron turns on
T
temperature
p+, p−
probability of being on at the same time when fixed and when free
What you think you knowThe popular story:Training networks with hidden layers began with backpropagation in 1986 The original source says:The 1985 Boltzmann machine paper had already given a learning rule for networks with hidden neurons.
The name and the prize
The paper in which the name Boltzmann machine appears is from 1983, with three authors. The 2024 Nobel Prize in Physics went to Hinton, but the explainer also says he developed it together with Sejnowski and other colleagues.
Sources & confidence (1)Neurons That Move by Chance
1985Verified in the original
The Boltzmann machine: a network that switches units on and off by chance, and a learning rule for hidden units (1985)
A Boltzmann machine is a network of neurons (units), each in one of two states, on or off, connected pairwise by weights that are equally strong in both directions. Each neuron chooses on or off with a probability set by the states of the neurons around it and the weights. When the temperature (a number that sets how random the choices are) is lowered gradually from a high value, the whole network tends to settle into a low-energy state (the same idea as annealing in physics). The 1985 paper by Ackley, Hinton and Sejnowski gave a rule for training a network that has hidden units, which are not set from outside, as well as visible units, which are set from outside, so that it imitates how the data appears. In the rule, the probability that two connected neurons are on at the same time is compared between two cases: when data is shown and the visible units are held fixed, and when nothing is shown and the network runs freely. The weight is adjusted in proportion to the difference. How to adjust it depends only on the states of those two neurons.
The popular story:It is often said that the way to train networks with hidden layers began with backpropagation in 1986 The original source says:The 1985 Boltzmann machine paper wrote that the problem of deciding which weights are to blame for an error in a network with hidden units can be solved in the form of the Boltzmann machine, and it gave a learning rule (the paper says this problem led to the decline of perceptron research). But every time a weight was adjusted, the network had to be run until it settled in two different ways, which took a long time. The Nobel committee's explanation (2024) says that at first it was not very useful in practice. Also, the 2024 Nobel Prize in Physics went to Hinton, but both the 1983 and 1985 papers are co-authored by three people. The explanation also says that he developed it .
What we still don’t know:We have not checked which of the two 1983 conference papers came out first (the AAAI-83 paper in which the names appear, and Hinton & Sejnowski 1983, which the 1985 paper cites). It is also unknown how far the Boltzmann machine itself was used in practical work in the 1980s.
What the figure shows:Moving only downhill leaves a system stuck in a shallow valley. A Boltzmann machine sometimes moves uphill by chance, and gradually lowering its temperature makes it more likely to reach a deep valley.
Energy as the network runs
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.
u08_boltzmann.py
061986 · Neural networks
Connecting Only Between Two Layers
What gets easier if we do not connect neurons within the same layer?
In 1986, in Chapter 6 of Volume 1 of the book “Parallel Distributed Processing (PDP)”, Paul Smolensky proposed a neural network called a harmonium. It divides the neurons into a visible layer and a hidden layer and connects them only between the layers. In a footnote he also wrote that it is a special case of the Boltzmann machine in which . Today it is called the restricted Boltzmann machine (RBM).
Because there are no connections within a layer, once one layer is fixed, the other can be computed all at once. "One round trip (up, then down)" in the figure on the right updates each layer simultaneously. A network that has learned a striped pattern restores a corrupted image in a few round trips.
In 2002, Hinton presented a fast method that trains with one round trip (contrastive divergence) (Chapter 9).
P(hj=1|v)=σ(bj +Σi wij vi)
v
visible layer
h
hidden layer
σ
a function that converts a value to 0–1
b
bias
What you think you knowThe popular story:Hinton built the restricted Boltzmann machine for deep learning in the 2000s The original source says:Hinton himself wrote in his 2002 paper that the restricted form was put forward by Smolensky (1986). The work of the 2000s was a way to train it fast and a way to stack it into deep networks.
Where the name came from
The chapter says the name harmonium follows pandemonium, a pattern-recognition mechanism by Selfridge and Neisser in 1960. Who first used the name restricted Boltzmann machine has not yet been confirmed.
Sources & confidence (1)Connecting Only Between Two Layers
1986Verified in the original
The restricted Boltzmann machine (RBM) comes from Smolensky's harmonium of 1986: a Boltzmann machine with connections only between two layers
A restricted Boltzmann machine (RBM) divides the neurons of a Boltzmann machine into two layers (a visible layer and a hidden layer) and limits the connections to those between the layers. Because there are no connections within a layer, once the values of one layer are fixed, all the neurons of the other layer can be computed at the same time. It originated as the harmonium proposed by P. Smolensky in Chapter 6 of Volume 1 of the 1986 book Parallel Distributed Processing. It put pieces of knowledge (knowledge atoms) in the upper layer and features of things (representational features) in the lower layer, and updated the whole upper layer and the whole lower layer in turn. The chapter says the name followed pandemonium, the pattern-recognition mechanism of Selfridge and Neisser (1960). In 2002 Hinton devised a fast learning method called contrastive divergence, and in the 2000s it became an important tool for training deep networks one layer at a time (explanation by the Nobel committee).
The popular story:It is often said that the restricted Boltzmann machine was created by Hinton for deep learning in the 2000s (the Nobel committee's explanation does not name Smolensky either) The original source says:Hinton's own 2002 paper says that Smolensky (1986) proposed a restricted type of Boltzmann machine. In the 1986 chapter Smolensky named it harmonium, and wrote in a footnote that it is also a special case of the Boltzmann machine in which . Hinton's work in the 2000s was a way to train it fast (contrastive divergence) and a way to stack such machines to build deep networks.
What we still don’t know:We have not checked who first used the name restricted Boltzmann machine (Hinton 2002 uses the name in discussing a 1992 work by Freund and Haussler). Smolensky's affiliation at the time of the 1986 chapter is not in the chapter's PDF, so we do not state it.
What the figure shows:Connecting only between 2 layers, with no connections within either layer, means that once one layer is set, the other can be calculated all at once.
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.
u08_rbm_cd.py
071967–1986 · How to learn
Walking Down the Slope of Error
How do you improve a model with many weights, little by little?
The error of a learning machine becomes a single number once the weights are fixed. Put the weights along the horizontal and vertical axes, and you get a landscape with hills and valleys. Gradient descent is a method that reduces the error by moving a little at a time in the direction of steepest descent (opposite to the gradient).
Click the landscape on the right to place a ball and let it roll down. If one step (the learning rate η) is too big, the ball jumps over the valley, and if it is bigger still, it flies out. If you compute "Per single example", the path wobbles, but each step is cheap to compute (stochastic gradient descent).
In 1967, Shun-ichi Amari studied in theory a learning method that updates the weights a little each time it sees one example, and in a 1968 explainer in Japanese he called it the “stochastic descent method”. The backpropagation of 1986 also uses this idea of walking down a slope.
w ← w − η ∂L/ ∂w
L
size of the error
∂L/ ∂w
how L changes when w is moved a little (the gradient)
η
learning rate
What you think you knowThe popular story:Training down to the hidden layers started with backpropagation in 1986 The original source says:Amari himself (2025) and the introduction of his Kyoto Prize say that the 1967 theory was already an idea of training with gradients, hidden layers included. This site has not been able to confirm the text of the 1967 paper.
Sources & confidence (1)Walking Down the Slope of Error
June 1967Verified in the originalSources disagreeJapan
Shun-ichi Amari's (a learning theory that updates weights bit by bit from errors)
Shun-ichi Amari mathematically analyzed a learning method that, each time it sees one data point, updates the weights (how much importance to give each feature) a little according to the error. The abstract of the English paper describes a proof that the weights approach the optimum even for data that cannot be classified cleanly, the trade-off between learning speed and accuracy, and an extension to piecewise-linear (broken-line-like) discrimination. A 1968 Japanese commentary calls this learning method the “stochastic descent method” (translated). Schmidhuber (2022) writes that it is probably the first paper to train a multilayer neural network by stochastic gradient descent (the basic learning method of today's deep learning).
The popular story:Schmidhuber (2022) writes that in 1967 Amari proposed to The original source says:the abstract of the 1967 paper itself is written as a general theory for linear classifiers and piecewise-linear discrimination. Experiments with a 5-layer network are said to be in his 1968 Japanese book and a student's master's thesis (neither has been confirmed).
What we still don’t know:How much a 5-layer network could actually learn (the 1968 book and H. Saito's master's thesis) is not known, because the original sources have not been opened.
6 sources and how they were checked
Where sources disagree:Pages: 299-307 (IEEE bibliographic record)/Schmidhuber's reference list gives “279-307”. Year of the Japanese edition: Schmidhuber writes 1965 (unconfirmed)
What the figure shows:If error is shown as a landscape of weights, learning means taking small steps in the steepest downhill direction. A step that is too large jumps over the valley, and a still larger step flies out of it.
Number of updates and size of the error (the vertical axis is in steps of 10 times)
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.
u08_gradient_descent.py
081986 · Neural networks
Passing the Error Backward
How should the weights of a hidden layer be corrected?
In October 1986, in a paper in Nature, David Rumelhart, Geoffrey Hinton, and Ronald Williams presented a way to train neural networks that have a hidden layer between input and output. It takes the error at the output and passes it back step by step from the output side to the input side, dividing the error among the neurons of the hidden layer and correcting the weights little by little (backpropagation).
Let the network in the figure on the right learn XOR, which the one-layer perceptron could not learn in Chapter 5. Each neuron in the hidden layer draws its own boundary line (the dotted lines), and the network sorts XOR between the lines. If you reduce the hidden layer to one neuron, it cannot learn.
The paper itself writes that by Parker and by Le Cun.
δout =(y − t)y(1 − y) δj =δout wj hj(1 − hj)
y, t
output value and correct answer
hj, wj
value of hidden neuron j and its weight to the output
δ
the share of error assigned
What you think you knowThe popular story:Hinton invented backpropagation The original source says:The paper itself writes that others had found it independently too. The Nobel Committee's explainer (2024) also calls it a reinvention: Rumelhart, Hinton, and Williams “reinvented a scheme for this,” and what mattered was showing that a network with a hidden layer can solve tasks that cannot be solved without that layer.
People who thought of it earlier
Different sources name different people. Nilsson (2010) names Bryson and Ho and Werbos's doctoral thesis (1974); the Nobel Committee names Werbos (1982) and Linnainmaa (1970, 1976); Schmidhuber (2014, 2022) names Linnainmaa (1970) and Shun-ichi Amari in 1967. This site does not decide which is right.
NETtalk (1987), which learned to read aloud
Sejnowski and Rosenberg built a network that, with this method, to turn English letters into pronunciation. It was trained on 1,024 words transcribed from a child's speech, and on the following 439 words it had not been trained on, it pronounced 78% correctly. Until then, commercial reading machines registered the readings of frequent words in a table and read by following rules.
The Japanese Neural Network Society (1989)
On July 21, 1989, the Japanese Neural Network Society was founded out of a study group that had started in 1980 with 19 people. Its first president, Kunihiko Fukushima, recalled in 2009 that the venue of the 1987 international neural network conference in the United States was full of hopeful excitement, with the feeling that (translated).
Sources & confidence (3)Passing the Error Backward
9 October 1986Verified in the originalSources disagree
A paper on training multilayer neural networks with backpropagation appears in Nature
Rumelhart, Hinton and Williams announced a way of training neural networks that have between input and output. The difference between the output and the correct answer (the error) is passed back from the output side to the input side step by step, and the strengths of the connections are updated bit by bit (passing the errors backward, as in the paper's title , is backpropagation). They showed by experiments that the hidden layers come to represent features that nobody taught them.
The popular story:It is often said that backpropagation was invented by Hinton The original source says:The 1986 paper itself writes that (by Parker and by Le Cun). The Nobel committee's explanation also says that , and names, as the more important point, that the three showed that . Even earlier, the names of Linnainmaa of Finland (1970), Werbos of the United States (1974, 1982) and Shun'ichi Amari of Japan (1967) come up.
What we still don’t know:People could read what is represented inside the hidden layers in this paper's small example (a family tree). But in large networks, only parts of it are understood even now (this connects to the unit on the fourth boom).
6 sources and how they were checked
Where sources disagree:Who “first thought of” this learning method differs depending on the writer (we do not decide which is right). (1) The 1986 paper itself: it says Parker and Le Cun discovered variants separately. (2) Nilsson (2010): the earliest is probably Bryson and Ho (in the field of control), and he also lists Werbos's doctoral thesis (1974). (3) The Nobel committee (2024): the three reinvented the method that Werbos (1982) and Linnainmaa (1970/1976) had already used. (4) Schmidhuber (2014, 2022): Linnainmaa in 1970 was first, the first application to neural networks was by Werbos (1981/1982), and in 1967 Shun'ichi Amari trained a multilayer network by gradient descent, and he sees a forerunner in Kelley in 1960. Schmidhuber is himself a researcher close to being a party to the matter, and takes a strong position in this story.
NETtalk: a neural network that to read English sentences aloud
Sejnowski and Rosenberg developed a neural network (NETtalk) that learns to convert English letters into pronunciation by looking at examples. When it was trained on 1,024 words transcribed from the conversation of a first-grade child, after about 10 passes its pronunciation was understandable when listened to. Tested on the remaining 439 words it had not learned, it scored 78%. Earlier commercial text-to-speech machines had registered the pronunciation of frequent words in a table and read according to fixed rules.
What we still don’t know:According to the paper, even networks with different connection weights had in the hidden layer. It is an early example of trying to look inside a neural network.
1989: the Japanese Neural Network Society is founded, growing out of a small study group started in 1980 with 19 people. At that time the mood at US conferences was (translated)
The “Japanese Neural Network Society (JNNS)”, a society that studies computational models imitating the brain's neural circuits, held its founding conference on July 21, 1989 at the Gakushi Kaikan in Kanda. The first president was Kunihiko Fukushima. It began in 1980, when Fukushima and others from the NHK research laboratories called on people nationwide to form a small study group that was not a society (the Neuro-Information Science Study Group), and 19 people took part in the first meeting. When a “neuro boom” (translated) arose in the United States in the late 1980s, attendance grew rapidly. In 1987 it passed 100, and because the retreat-style (overnight camp) format could no longer be kept up, the study group was developed into a society. Fukushima recalls that the venue of the 1987 international conference on neural networks in the United States was filled with a hopeful mood of “The age of AI (artificial intelligence) is over; from now on is the age of neural networks” (translated).
The popular story:The neuro (neural network) boom of the late 1980s is often lumped together as part of the AI boom (how this is said is this site's estimate) The original source says:The first president of the Japanese Neural Network Society recalls that the venue of the 1987 international neural network conference was filled with a hopeful mood of “The age of AI (artificial intelligence) is over; from now on is the age of neural networks” (translated) (testimony from a participant that at least some neural network researchers of the time saw themselves as separate from “AI”; a 2009 recollection)
What we still don’t know:The date and place of the founding conference come from the recollection. This site has not opened announcements or reports from the time (such as the 1989 JNNS News Letter)
What the figure shows:A network with hidden layers can solve XOR, which 1 layer cannot solve, by passing output errors backward and adjusting its weights.
Size of the error at each training round
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.
u08_backprop_xor.py
091985–1987 · Neural networks
Squeezing Eight Patterns Into Three
Can we make a network build a code without preparing correct answers separately?
A network with a narrow middle layer is trained on the task of outputting the same thing it receives. A pattern in which exactly one of 8 inputs is 1 is passed through 3 hidden neurons and mapped to the same 8 outputs. The network has no choice but to assign a set of 3 values (a code) to each of the 8 patterns by itself.
This task appeared in the 1985 Boltzmann machine paper as the encoder problem, and it was trained in the backpropagation chapter of the 1986 book too. According to the chapter, the hidden neurons used not only 0 and 1 but in-between values. In the figure on the right, watch the 8 patterns scatter to different places on a cube.
In 1987, Dana Ballard put forward a way to stack such networks. Today they are called autoencoders (self-encoders).
weights of the first half (encoder), second half (decoder)
What you think you knowThe popular story:Hinton started autoencoders in 2006 The original source says:They already existed in 1985–1987. The 2006 paper in Science also writes that it had been “obvious since the 1980s” that deep autoencoders work well.
What was new in 2006
What the 2006 paper in Science presented as new was a method for setting the initial weights of a deep neural network (Chapter 9).
Since when has the name existed
The oldest paper we found in which the name autoencoder appears is the 1993 paper by Hinton and Zemel. Whether an earlier paper used it has not yet been confirmed. Whether there was research in Japan around the same time on networks that output the same thing they receive has not been settled either.
Sources & confidence (1)Squeezing Eight Patterns Into Three
1986Verified in the original
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:Training a network to squeeze 8 inputs into 3 and then restore them lets it create its own code without being taught the correct answers.
Reconstruction error at each training iteration
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.
u08_autoencoder_838.py
101986–1990 · Neural networks
Feeding In the Previous Self
How does a network remember characters that come in order?
In 1990, Elman added context units to a three-layer neural network. The values of the hidden layer are copied as they are into the context units and fed in with the input at the next time step (a recurrent neural network, RNN). The copying connections were fixed at weight 1.
When the network is asked to predict the next character in a string with no word breaks, the prediction error is large at the start of a word and gets smaller as the word goes on. Without being taught, the word boundaries emerge. The figure on the right is an example this site made by lining up 5 words. Only the purple bar (the first character) stays high.
Elman himself writes that this idea begins with Jordan's 1986 report.
ht =tanh(W xt +U ht−1)
xt
the character at time t
ht−1
the hidden layer one step earlier
U
connections from the context units
What you think you knowThe popular story:Elman invented the RNN in 1990 The original source says:Elman's paper itself says the idea was first written by Jordan (1986), and cites earlier examples. The Nobel Committee's explainer says Hopfield networks are also recurrent.
Groups of words
In an experiment trained on strings of words, when the hidden-layer representations were grouped by similarity, they split into groups such as nouns and verbs, and living and non-living things.
The name of a Japanese laboratory
The 1987 time-delay network that Elman cited as an earlier example appears in a 1989 paper by the same authors, in which 2 of the 5 authors were affiliated with the ATR Interpreting Telephony Research Laboratories.
Sources & confidence (1)Feeding In the Previous Self
1990Verified in the original
Elman's simple recurrent network (1990) and Jordan's network (1986): feed the previous state back as input to remember the flow of time
A recurrent neural network (RNN) is a mechanism that keeps a memory of the past by returning its output to the input of the next time step. In the form Elman proposed in 1990, context units were added to an ordinary three-layer network. The values of the hidden layer at each time step are copied as they are into the context units (the connection weights are fixed at 1 and not learned), and sent to the hidden layer together with the input at the next time step. When the network was trained by backpropagation to predict the next letter or word, in a string of letters the error was large at the start of a word and became smaller as the word went on, and the boundaries between words emerged from a string with no separators written in. For sequences of words too, when the hidden-layer representations were grouped by similarity, they split into clusters such as nouns and verbs, and living and non-living things. Elman writes that this idea began with Jordan's 1986 report. Jordan's network returns the output to state units and produces a sequence of actions from a fixed plan, and it was applied to the linking of sounds in speech (coarticulation).
The popular story:It is often said that the recurrent neural network (RNN) was invented by Elman in 1990 The original source says:Elman's own paper says that this idea was first written down by Jordan (1986), and lists several earlier examples of networks with memory (among them the time-delay neural network of 1987; in a 1989 paper by the same authors, 2 of the 5 authors are affiliated with Japan's ATR Interpreting Telephony Research Laboratories). The Nobel committee's explanation says that Hopfield's 1982 network and the Boltzmann machine are also recurrent. Elman's contribution was to return the hidden-layer values themselves and to show that groupings such as word boundaries and parts of speech appear in the internal representation without being taught. Also, the return connections of Elman's network were not learned but fixed at weight 1.
What we still don’t know:We do not know the order in which Elman's network and other recurrent networks of the same period (1987–1988: Pineda, Williams and Zipser, and others) were published, because we have not opened the original papers.
What the figure shows:Feeding the network's previous state back alongside the next input makes word boundaries emerge from a sequence of letters without marked breaks or explicit teaching.
Which letter of the word it is, and the average prediction error
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.
u08_elman_srn.py
111989 · Convolution
Reusing the Same Window
How do we build a neural network that can read handwritten digits even when their position is slightly off?
In 1989, Yann LeCun and six others at Bell Labs trained a neural network to recognize digits, using 9,298 handwritten digits of ZIP codes on American envelopes. The key was to reuse the same small 5×5 window (a filter that finds a feature) at many places in the image (in today's words, convolution).
In the figure on the right, choose a window and shift the digit. Places that match the window's shape respond, and the places that respond move along with the digit. Because the window is reused, the number of weights to learn drops sharply (the number at the upper right).
On the 2,007 test examples, the error rate was 5.0%. The paper cites Kunihiko Fukushima's 1980 paper (the Neocognitron) in just one place.
map(x, y)=Σi,j k(i, j)× picture(x+i, y+j)
k
the window (5×5 weights; the same at every place)
What you think you knowThe popular story:Deep learning for image recognition (convolution) was born in America The original source says:LeCun and colleagues themselves wrote in 1998 that . The difference was that the Neocognitron had no way to train the whole network (backpropagation).
How to compare the number of weights (an example by this site)
To make a 12×12 map from a 16×16 image, connecting each point of the map to every point of the image takes 256×144=36,864. If the same 5×5 window is reused, 25 are enough (plus a bias).
Where the ZIP-code digits came from
The digits came from envelopes that passed through the post office in Buffalo, New York. 7,291 were used for training data and 2,007 for test data.
Sources & confidence (2)Reusing the Same Window
1989Verified in the original
Bell Labs' LeCun and colleagues present a neural network that uses to read handwritten ZIP codes
LeCun and colleagues trained a neural network to identify digits, using 9,298 digits of handwritten ZIP codes on US mail envelopes (that had passed through the post office in Buffalo, New York). By reusing the same small window (a frame for finding small 5×5 features) across the whole image, they greatly reduced the number of parameters to be learned (the technique now called ). The error rate on 2,007 test data not used in training was 5.0%.
The popular story:Deep learning that recognizes images is often thought to have appeared suddenly in 2012 The original source says:As early as 1989, real handwritten ZIP codes were being learned with the same kind of network as today (according to the Nobel committee's explanation, from the mid-1990s it was used to read bank checks). The paper cites Japan's Kunihiko Fukushima (1980).
March 1984–2022Verified in the originalSources disagreeJapan
The source of today's image AI (convolution) is the Neocognitron ── how did its inventor and later papers write about it
Kunihiko Fukushima's Neocognitron (1979) is said to be the source of the used in today's image-recognition AI. Sorting through later sources: in a 1984 commentary, Fukushima himself wrote that most of the calculation is the repetition of two-dimensional filters, and that it could be tried out on a minicomputer. LeCun and colleagues' 1989 zip code paper cited Fukushima (1980) in just one place. The 1998 LeNet paper wrote plainly that the combination of convolution and subsampling had been built in Fukushima's Neocognitron, but that at the time there was no method (backpropagation) for training the whole network. In 2022 Fukushima himself wrote (translated), and the 2024 Nobel Committee's explanation also named it as a root of CNNs.
The popular story:It is often said that image deep learning (convolution) was born in the United States The original source says:LeCun and colleagues themselves wrote in 1998 that “The convolution/sub-sampling combination ... was implemented in Fukushima's Neocognitron.” However, the citation in the 1989 paper was only one short mention, and it was in later papers and reviews that the connection was written out clearly. The difference is that the Neocognitron had no method (backpropagation) for training the whole network.
6 sources and how they were checked
Where sources disagree:How the year is written: English sources (the Nobel Committee's explanation, LeCun's papers) cite the 1980 English paper, while Fukushima himself (2022) names the 1979 Japanese paper first (see the record on the 1979 Neocognitron for details).
What the figure shows:Reusing the same small window across an image finds the same shape even when a digit shifts slightly, and greatly reduces the number of weights to learn.
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.
u08_convolution_shift.py
121989–1998 · Convolution
Passing Unsure Characters to a Person
Can a machine that makes 5% errors not be used in a bank?
The network that read ZIP codes in 1989 made errors on 5.0% of the test data. The paper also pointed out that to hold the error rate to 1%, 12.1% would have to be rejected as “unreadable.” If you pass the answers with low confidence to a person, errors among the answers the machine does give go down. In the figure on the right, move the rejection line θ.
In 1998, LeCun and colleagues put together LeNet-5, a seven-layer convolutional neural network, and a system that reads checks. The system was built into NCR check-reading machines and used at several American banks. On MNIST, the handwritten-digit dataset of that paper (60,000 training and 10,000 test examples), the error rate was 0.95%.
Rejection rate=number with confidence<θ ÷ total number
θ
the line that sets the rejection standard
confidence
the largest of the output values
The way confidence splits in the figure is an example this site made, to come close to two points from the 1989 paper.
What you think you knowThe popular story:Deep learning started to be useful in 2012 The original source says:In the late 1990s, convolutional neural networks were already doing real work, reading checks in banks.
The characters of MNIST
MNIST is a rearrangement of data from the American NIST, and it contains characters written by high school students and Census Bureau employees.
How many did it read?
Within the same paper, the abstract says several million checks per day and the body says several million per month, a discrepancy. Which is right cannot be judged from the paper.
Sources & confidence (1)Passing Unsure Characters to a Person
November 1998Verified in the originalSources disagree
The convolutional neural network LeNet-5 is used to read handwritten characters on checks at banks in the United States
LeCun and colleagues presented , a 7-layer convolutional neural network that recognizes handwritten digits, and a check-recognition system. This system was built into check-reading machines made by NCR and was actually used at several banks in the United States. The paper also created , a dataset of handwritten digits with 60,000 training images and 10,000 test images; the error rate on the test data was 0.95% (0.8% when distorted training images were added).
The popular story:“Deep learning began to be useful in 2012,” people tend to think The original source says:By the late 1990s, convolutional neural networks were already being used in a real job, reading checks at banks (the main text of the paper says millions of checks a month). The paper plainly writes: (and goes on to say that at the time there was not yet a method, like backpropagation, to train the whole network).
1 sources and how they were checked
Where sources disagree:The same paper describes the number of checks processed differently. The abstract (page 1) says “millions of checks per day”, while the main text (page 2) says “millions of checks per month”. The paper's wording does not settle which is correct.
What the figure shows:Even a machine with a 5% error rate can greatly reduce errors among the answers it gives by passing low-confidence cases to people.
Rejection rate, and error rate among the answers given
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.
u08_reject_curve.py
131990 · Machine translation
Probabilities From Parallel Text
Can we gather clues for translation without writing a dictionary or grammar?
In June 1990, Peter Brown, Frederick Jelinek, and six others at IBM presented a method that treats translation as a calculation of probabilities. Their material was the records of the Canadian Parliament, kept in both English and French (about 100 million English words).
There were pairs of sentences that translate each other, but nothing said which word translates which. So the paper adopted the EM algorithm, used in speech recognition. At first it assumes that every word is equally likely to translate every other word, and then repeats a calculation that recounts using those probabilities. Press "Repeat once" in the figure on the right (the sentence pairs are an example this site made).
From 40,000 sentence pairs, the paper estimated about 81 million numbers and wrote that “the” was automatically linked to “le” and “la,” and “not” to “pas.” Of the translations of 73 new sentences, 5% were word-for-word identical to a reference and 48% were sensible translations.
share=t(f|e)÷ Σe′ t(f|e′)
t(f | e)
probability that English word e is translated as French word f
e′
all the English words in the same sentence pair
Differences from the figure
The figure shows the simplest form. The 1990 paper also computed how many words one word translates into and the probability of where words line up. The paper also wrote that Warren Weaver had proposed translation by statistical methods in 1949, but computers were not powerful enough then and not enough text data was available.
2005, a car that ran on probability
In the DARPA driverless-car race, no car finished in 2004, but in 2005 Stanford University's Stanley won, covering about 132 miles in 6 hours 53 minutes. The paper wrote that machine learning and probabilistic reasoning were the central technologies. A New York Times article the same year reported that the shift from methods centered on logic and rules to software using probability and statistics had led to the success.
Sources & confidence (3)Probabilities From Parallel Text
June 1990Verified in the original
IBM presents a translation method that uses probabilities computed from translated text pairs instead of grammar rules
IBM's Brown, Jelinek and colleagues presented a method that treats translation as a calculation of (in this paper S is an English sentence and T a French sentence). Using the records of the Canadian Parliament (kept in both English and French, about 100 million words in computer-readable form), they estimated about 81 million numbers from 40,000 pairs of sentences. When they translated 73 new French sentences into English, 5% matched exactly, but 48% were reasonable translations. The paper writes that Weaver proposed translating with numbers in 1949, but computers were then weak and there was not enough computer-readable text.
13 March 2004–2007Verified in the originalSources disagree
Self-driving car races run by the U.S. Department of Defense's DARPA: in 2004 no car finished, and in 2005 Stanford University's Stanley won
DARPA held prize races in which autonomous vehicles drove a desert course. In the first race, on March 13, 2004 (about 142 miles, a $1 million prize), 15 vehicles started but none finished, and the longest distance reached was only 7.5 miles. In the second race, on October 8, 2005 (about 132 miles), 195 teams applied and 5 vehicles finished. Stanford University's Stanley won in 6 hours 53 minutes and took the $2 million prize. According to the Stanley paper, the core technologies were machine learning and probabilistic reasoning, and it learned ground from human driving data. The third race, in 2007, was held on an urban course; 6 of 11 teams finished, and a Carnegie Mellon University team won.
2 sources and how they were checked
Where sources disagree:The longest distance in 2004: the DARPA article says 7.5 miles, while the Stanley paper says only that “no vehicle got past 5% of the course” (translated) (5% of 142 miles is about 7.1 miles, which differs slightly)
14 October 2005Verified in the originalSources disagree
Tracing the claim “In the 1990s, researchers avoided the word ‘AI’”: a sentence in the 2005 New York Times wrote only
A New York Times article of October 14, 2005 (by reporter John Markoff) reported the win of Stanford University's car Stanley in the self-driving car race run by DARPA, the research agency of the U.S. Department of Defense, as . In it is a sentence saying that, when AI was at its lowest point, some computer scientists and software engineers shunned the term for fear of being seen as people who talk only of pipe dreams. This is the sentence often quoted in the story that “researchers avoided the word AI”. The same article also writes that the success this time came from a shift in research methods from logic and rules to software that uses probability and statistics.
The popular story:“In the 1990s (to the early 2000s), researchers avoided the word ‘AI’,” is often said. English Wikipedia also places this New York Times sentence in its section The original source says:The sentence in the original article writes only , and does not say in what years it was, or who avoided the word. The same article writes of “The AI Winter” as . It also carries the words of John McCarthy that , thanks to the continuing interest of researchers and the support of government agencies, especially DARPA.
What we still don’t know:This article does not show how many computer scientists and software engineers actually , or when (this site has not found any material that counted them). How the number of uses of the word in paper titles and so on rose and fell year by year can be checked together with the word-count graph of u01.
2 sources and how they were checked
Where sources disagree:The period of : the original article puts it . English Wikipedia, on the other hand, places a sentence from this article in its section .
What the figure shows:Even with translated sentence pairs that do not mark which words match, starting with roughly equal probabilities and repeatedly recounting lets the correct word pairs emerge naturally.
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.
u08_em_alignment.py
141991 · Neural networks
Splitting the Work Among Experts
What happens if one neural network learns many different jobs?
When one network learns many different jobs, they get in each other's way and learning slows down. In 1991, Robert Jacobs, Michael Jordan, Steven Nowlan, and Geoffrey Hinton answered this problem by combining several expert networks with a gating network that outputs the probability of which expert to hand the job to.
They measured error in a way that makes the experts compete rather than cooperate, so each expert comes to handle only part of the input data. The figure on the right is an example in which two experts, who can each draw only a straight line, learn a pattern of points whose shape differs on the left and right. The band at the bottom shows the gate.
In 2017, a large-scale mechanism was also built that picks just the top few from thousands of experts (Chapter 11).
y=Σk gk yk gk =esk /Σm esm
yk
output of expert k
gk
probability that the gate hands the job to k (they sum to 1)
What you think you knowThe popular story:The mixture of experts (MoE) is a new trick for the large language models of recent years The original source says:The basic idea was in the 1991 paper. The 2017 paper itself writes that there had been much research on this method .
When and by whom
According to a note in the paper, this idea was first presented at a summer school in 1988. Hinton is an author of both the 1991 and 2017 papers.
Sources & confidence (1)Splitting the Work Among Experts
1991–2017Verified in the original
Mixture of experts (MoE): several expert networks and a gate that decides which one to hand the work to (Jacobs and colleagues 1991, Shazeer and colleagues 2017)
In 1991, Robert Jacobs and Michael Jordan of MIT and Steven Nowlan and Geoffrey Hinton of the University of Toronto published the paper . When one big network is trained on a mix of different tasks, the tasks interfere with each other and learning slows down. For this problem, they showed a method that combines several expert networks with a gate network. For each input, the gate gives the probability of which expert to hand the work to (the output is a softmax: a form of probabilities that add up to 1). They set the way of measuring error so that the experts compete rather than cooperate. So as learning proceeds, each expert takes charge of only a part of the inputs. On a vowel-discrimination task, the paper showed that the work splits into several parts, each handled by a simple expert. In January 2017, Noam Shazeer and others (7 people, including Hinton) of Google's research team Google Brain scaled up this idea and built a layer with up to thousands of experts (the Sparsely-Gated Mixture-of-Experts layer). The gate adds noise, then picks only the top k experts with the highest scores, and does not compute the other experts. So even if the number of parameters is greatly increased, the amount of computation does not increase much. For language modeling and translation, they put MoEs with up to 137 billion parameters between LSTM layers, and got better results than the best at the time with less computation.
The popular story:Mixture of experts (MoE) is often thought to be a new trick for recent large language models (this view is this site's estimate) The original source says:The idea is in the 1991 paper (according to a note in the paper, it was first presented at a summer school in 1988), and the 2017 paper itself says there had been much research . Hinton is an author of both the 1991 and the 2017 papers. What the 2017 paper claimed as new was that, because the gate picks only a few of the top experts, it could have thousands of experts and with .
What the figure shows:Making 1 network do many different jobs causes the jobs to interfere. Competition lets experts divide up the work, each taking responsibility for only part of it.
Average error at each iteration
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.
u08_mixture_experts.py
151992–1997 · Reinforcement learning
Learning Only From Wins and Losses
Can a program learn strong play without being told the right move at each turn?
In TD-Gammon, made by IBM's Gerald Tesauro in 1992, a three-layer neural network played hundreds of thousands of games of backgammon against itself and learned only from wins and losses (reinforcement learning). The version that played 1.5 million games came within one point of the former world champion, Bill Robertie, in a 40-game match.
The key is temporal difference (TD). At every move, it nudges its prediction of how likely a position is to win a little closer to the prediction for the next position. The final win or loss is passed back, bit by bit, to earlier positions. The figure on the right does the same learning on tic-tac-toe. You can also play against it as × by pressing an empty square.
In August 1997, the Othello world champion Takeshi Murakami lost 0–6 to Logistello, a program that had learned by self-play and other means. Logistello ran on an ordinary personal computer.
V(st)← V(st)+α[V(st+1)− V(st)]
V(s)
predicted chance of winning from position s
α
how far to move the prediction closer
What you think you knowThe popular story:AI changed how people play starting with AlphaGo in Go (2016) The original source says:Nilsson's book quotes a passage saying that in the 1990s, top backgammon players copied TD-Gammon and changed the way they play the opening.
There was no theoretical guarantee
The paper wrote that TD-Gammon . Why it learned so well had not yet been explained by theory.
How Logistello learned
According to its author, Michael Buro, Logistello extracted knowledge from millions of board examples and built its opening moves by self-play. According to Murakami's own later account (2017), it began in 1993, when he saw an article in a Western computer magazine and sent a letter saying he would accept a challenge at any time.
Sources & confidence (2)Learning Only From Wins and Losses
1992Verified in the original
IBM's TD-Gammon improves through self-play learning to near the top of the world in backgammon
IBM's Tesauro built TD-Gammon, in which a three-layer neural network played hundreds of thousands of games against itself and learned only from the win-or-lose results (, a method of learning from rewards). It improved even when starting from a random initial state, and the version that played 1.5 million games came within one point of the former world champion Robertie over 40 games.
The popular story:It is often thought that AI changed how humans play only with Go's AlphaGo (2016) The original source says:Nilsson's book cites a description by Sutton and Barto saying that in the 1990s top backgammon players imitated TD-GAMMON and changed how they play the opening (we have not opened Sutton and Barto's original book)
What we still don’t know:The paper also writes that TD-Gammon (TD(λ) is the name of this learning method; an example that worked without theoretical backing).
Othello champion Takeshi Murakami loses 0–6 to the machine-learning program Logistello
Three months after Deep Blue's victory, a six-game match was held at the NEC Research Institute (Princeton) in the United States. Othello world champion Takeshi Murakami (an English teacher in Tokyo) lost 0 to 6 to Logistello, the program developed by Buro. According to its author, Logistello extracted knowledge from millions of board positions and learned opening moves through self-play. It ran on an ordinary personal computer.
The popular story:“The machine that beat a human champion in 1997 was the chess machine Deep Blue,” is all that is often told The original source says:In August of the same year, a Japanese world champion of Othello lost 0 to 6. Moreover, according to its author, while Deep Blue relied on expert tuning and special-purpose hardware, Logistello learned from large amounts of data and self-play and ran on an ordinary personal computer (a method close to today's machine learning). In Murakami's own later account, it began in May 1993, when he saw in a Western computer magazine an article by an AI researcher saying (translated), and he sent a letter of rebuttal saying that he would accept a challenge at any time (from a 2017 interview).
What the figure shows:Without being taught the right answer at each move, repeatedly moving the current prediction a little closer to the next position's prediction carries wins and losses back to earlier positions and improves play.
200 games against an opponent that plays at random (purple=losses, gray=draws)
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.
u08_selfplay_td.py
161992–1995 · Machine learning
The Middle of the Widest Road
When many boundary lines can separate the data, which one is best?
Vladimir Vapnik and colleagues reasoned that if you draw the line down the middle of the widest road that stays as far as possible from both kinds of data, it will also classify data it has never seen well. Half the width of the road is called the margin.
What fixes the boundary line is only the few points that touch the edge of the road (support vectors=the points that support the road). In the figure on the right, pull the points. If you move a point with a ring, the road changes, but if you move the other points, the boundary line does not change as long as they do not enter the road.
On the handwritten digits of MNIST, the method of Corinna Cortes and Vapnik reached an error rate of 1.1%, a result close to LeNet. But identifying one character required about 14 million multiplications and additions.
maximize margin=1/ ‖w‖ subject to: yi(w · xi +b)≥ 1
w, b
parameters that fix the boundary line
yi
group of point i (+1 or −1)
What you think you knowThe popular story:Neural networks were the main players all along after the 1980s The original source says:In the decade around 2000, methods other than neural networks, such as support vector machines, took over many practical classification tasks (Schmidhuber, 2014).
About the sources
The 1998 LeNet paper writes that at a 1992 presentation by Boser, Guyon, and Vapnik, they realized the calculation could be done with the support vectors alone. The same paper also admits that this method does well without building in prior knowledge that the input is an image. This site has not directly confirmed the original 1995 paper (its confidence grade is “confirmed in a secondary summary”). Other machine learning methods are covered in Chapter 9.
Sources & confidence (1)The Middle of the Widest Road
1992–1995Confirmed in summaries
Vapnik and colleagues create the support vector machine, which separates data by drawing the widest road between them
When drawing a line to separate two kinds of points, you draw the line down the middle of the widest road, as far as possible from both kinds of points. Then even points seen for the first time are separated well. Vapnik and colleagues made it so that this idea can be computed from only the few points at the edges of the road (the support vectors: the points that hold up the road). On the handwritten digits of MNIST it reached an error rate of 1.1% (Cortes and Vapnik), close to the neural network LeNet. By around 2000, this kind of method had become the mainstream in practical use.
The popular story:It is often thought that neural networks were number one all the way after the 1980s The original source says:In the ten years around 2000, methods other than neural networks (such as support vector machines) held much of practical use (Schmidhuber 2014). The 1998 LeNet paper itself also admits that this method performs well without building in knowledge about images
What the figure shows:Many lines can separate 2 groups, but the middle of the widest road, furthest from both sides, is a good choice. Only the few points touching the road's edges determine that line.
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.
u08_svm_margin.py
171997 · Neural networks
A Memory Box and Its Gates
How can a network remember a clue from long ago?
When a recurrent network is trained with backpropagation, the error signal is multiplied by a similar number every time it goes back one step in time. If the number is less than 1 it vanishes, and if it is greater it blows up. Sepp Hochreiter analyzed this problem in 1991.
In 1997, the LSTM of Hochreiter and Jürgen Schmidhuber was equipped with a . What is in the box is connected to itself with weight 1 and carried along without vanishing. An input gate and an output gate open and close to put things in and take them out (the 1997 version has just these two gates). Press "Flow" in the figure on the right. The paper wrote that it could use clues more than 1,000 steps apart.
ct =ct−1 +it × gt ht =ot × h(ct)
c
contents of the box
i, o
input gate and output gate (0–1)
g
the value to put in
The weights of the LSTM in the figure were set by hand by this site (not trained). The graph below, opened with “Details”, shows the error signal that remains when it is multiplied by the “Multiplier” at each step.
Sources & confidence (1)A Memory Box and Its Gates
1997Verified in the original
LSTM: a neural network that can remember the earlier parts of a long sentence or sound is announced
Hochreiter and Schmidhuber announced LSTM, a neural network for time-series data (sequences of sounds or letters) with a built-in (a box that remembers) and that open and close what goes into and out of the box. With earlier methods, the signal used for correction in backpropagation either faded away (approached zero) or blew up as it went back in time, so they could not remember things from long ago. LSTM could hold on to and use clues from the past more than 1000 steps away.
2 sources and how they were checked
Long Short-Term Memory (Sepp Hochreiter, Jürgen Schmidhuber · 1997 · p.1735 Abstract / 1 Introduction · Original source)
What the figure shows:In an ordinary recurrent network, the signal fades through multiplication each time it travels backward. LSTM carries a memory box unchanged with weight 1 and uses gates to put information in and take it out, allowing distant clues to be remembered.
Number of steps back and the signal that remains (the vertical axis is in steps of 10 times)
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.
u08_lstm_memory.py
181994–1997 · Search
Cutting Off Branches Not Worth Reading
Did a computer that examines about 200 million positions a second read them all?
In May 1997 in New York, IBM's chess computer Deep Blue beat the world champion Garry Kasparov two wins to one with three draws (3.5 to 2.5). Its strength came from brute-force calculation examining about 200 million positions a second, and from records of grandmasters' games.
Even so, it cannot read everything (the combinatorial explosion of Chapter 5). Alpha-beta pruning cuts off, without reading further, any branch once it is known that the opponent has a better move. In the figure on the right, compare the number of leaves read. The answer stays the same while the number read goes down.
The prediction by Herbert Simon and colleagues (1957) that came true about 40 years later, in a different form (Chapter 3).
once α ≥ β, do not read the rest of that branch
α
the lowest score you have already secured
β
the highest score the opponent will let you take
What you think you knowThe popular story:Deep Blue's victory was a victory for AI The original source says:IBM itself wrote on its page at the time, and explained that it became strong through enormous computation and records of grandmasters' games.
The checkers world champion (1994)
The University of Alberta's Chinook became the in August 1994, after six games were all drawn and its opponent, Marion Tinsley, withdrew because of poor health. The team itself wrote that .
The previous year, and the number of processors
In the match of February 1996, Kasparov had won 4 to 2. The number of processors is 32 on IBM's current history page, while Nilsson (citing IBM's page at the time) writes 256 chess processors. It is likely a difference in how they were counted, but it has not been settled.
Sources & confidence (3)Cutting Off Branches Not Worth Reading
11 May 1997Verified in the originalSources disagree
IBM's chess-only machine Deep Blue beats world champion Kasparov in a six-game match
IBM's chess-only computer played a six-game match against world champion Garry Kasparov in New York and won, with 2 wins, 1 loss and 3 draws (3.5 to 2.5). With the same time limits as in ordinary tournaments, it became the first computer to win a match against a reigning world champion. Its strength came from brute-force calculation, examining about 200 million positions per second. The year before (February 1996, in Philadelphia), Kasparov had won 4 to 2.
The popular story:“Deep Blue's victory was a victory for AI,” people tend to say The original source says:IBM itself, who developed it, wrote on its page at the time: It explained that Deep Blue got strong not by thinking but through huge amounts of calculation and records of grandmaster games. It also did not learn from its opponent during the match.
3 sources and how they were checked
Where sources disagree:The number of processors differs by source. IBM's current history page says “32 processors”, while Nilsson (citing IBM's page at the time) says “256 chess processors”. It is most likely a difference in how they were counted (ordinary computers or chess-specific parts), but we have not opened the 2002 paper (Campbell et al., Elsevier), so it is not settled.
The checkers program Chinook becomes at the man-machine world championship
Chinook, a checkers program (draughts on an 8×8 board, in the wording of the paper) developed by Schaeffer and his colleagues at the University of Alberta in Canada, challenged world champion Tinsley in 1992 and lost, with 2 wins, 4 losses and 33 draws. They played again in August 1994 at the Computer Museum in Boston. After all 6 games were drawn, Tinsley withdrew partway because of poor health, and Chinook became the . This is regarded as the first case of a computer winning a human world championship title (from the team's paper).
The popular story:“In the 1950s–60s Samuel's checkers program beat a master and solved checkers,” it has been said The original source says:The Chinook team's paper (1996) points out that both claims were errors of press reports, and that Samuel himself did not make them (a 2007 paper also says that a result of just one game won in 1963 was blown out of proportion as it spread). It is also often said that “a machine beat the human world champion”, but in 1994 the draws continued and then the opponent withdrew because of illness, and the team itself wrote that .
Herbert A. Simon and Allen Newell predicted that within ten years a computer would become the world chess champion (unless the rules barred it from competition).
What happened next:As of April 1967, one of the strongest chess programs (MIT's MAC HACK VI) played at the level of a mid-ranked amateur (1450 on the American rating scale). In 1968, International Master David Levy and some researchers made a bet on whether a computer could beat Levy within ten years. In 1978 Levy beat the computer and won the bet. A computer beat a reigning world champion (Kasparov) in a six-game match about 40 years after the prediction, in May 1997 (IBM's Deep Blue, 3.5 to 2.5). Note that a computer has never won the title of human world champion itself (the prediction also says ).
What the figure shows:Alpha–beta search stops exploring a branch once it knows the opponent has a better move elsewhere. It reduces the number of positions examined while keeping the same answer.
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.
u08_alphabeta.py
191985–2005 · Robots
Moving Without Thinking First
Can a robot with no map move all around a room?
In September 1985, Rodney Brooks of MIT presented a way to design a robot's behavior in layers. Layers of higher-level behavior are stacked on lower layers (such as not bumping into things), and an upper layer suppresses a lower layer only when needed. In a 1991 paper he wrote that .
The announcement materials for the Roomba robot vacuum cleaner, released in 2002 at $199.95, also say nothing about a map. It repeats spiral, wall-following, and straight-line runs, and passes over each part of a room 2 to 5 times. In the figure on the right, add and remove layers (the room is an example this site made).
In Japan, Sony's AIBO was announced in 1999 and Honda's ASIMO in 2000.
movement it outputs=the movement of the topmost layer that is active now
layer
a group of behaviors such as going straight, following a wall, or spiraling
What you think you knowThe popular story:During the AI winter of the late 1980s to the 1990s, research itself stopped The original source says:At the same time, Brooks, while writing about the state of the winter, showed another path of building intelligence from the body and its movement, and built robots that move around.
AIBO
A four-legged home robot. According to a person who developed it, although it cost 250,000 yen, orders for the 3,000 units on offer filled up in 20 minutes.
How ASIMO walks
Height 120 cm and weight 43 kg (the earlier P3 was 160 cm and 130 kg). With a walk that predicts the next movement and shifts the center of gravity in advance, it could turn smoothly. Honda began its research in 1986 and unveiled P2 in 1996 and P3 in 1997 (compare it with the slow walking of WABOT-1 in Chapter 5, which thought only about the center of gravity).
The national program's
The announcement materials for HRP-2, developed in a national project in 2002, wrote that humanoid robots held (translated). At Expo 2005 in Aichi, cleaning, security, and guide robots worked at the venue, and 65 types of robots aiming for (translated) were exhibited.
Sources & confidence (6)Moving Without Thinking First
September 1985–1991Verified in the original
1985–1991: Rodney Brooks, robots that stopped thinking before moving. For simple intelligence, , and in 1990,
Rodney Brooks of MIT's Artificial Intelligence Laboratory presented, in a September 1985 report, a method of designing a robot's behavior in . On top of lower layers, such as one that avoids obstacles, layers of more advanced behavior are stacked, and an upper layer suppresses the output of a lower layer only when needed (subsumption). In the paper , received in 1987 and published in 1991, he pointed out that when you study very simple intelligence, explicit internal representations and world models . He then reported that he had built several robots that move around offices on their own based on this idea. In the 1990 paper , he argued for a path different from the AI of 30-odd years that manipulates symbols in the head (an approach with a body that interacts with the real world). He also mentioned the situation at the time: small AI companies were going bankrupt, and attendance at AI conferences at home and abroad was falling sharply.
The popular story:The winter of the late 1980s through the 1990s is often lumped together as a time when AI research itself stopped (how it is said is this site's estimate) The original source says:In the same period, Brooks wrote of the winter's conditions () and yet he also showed a new path to intelligence built from body and behavior rather than symbols and reasoning, and was actually building robots that moved around offices (an example of research on a different approach growing even in the winter).
What we still don’t know:How far intelligence can be achieved without representations (models of the world) is itself presented as a hypothesis (H) within the papers, and no conclusion has been reached.
2002, the Roomba robot vacuum cleaner at $199.95. The announcement describes a combination of simple movements, repeating spirals, wall-following and straight runs, so that each part of a room is passed over 2 to 5 times (no mention of maps)
On September 18, 2002, iRobot (a company that develops robot technology products; headquarters in Somerville, Massachusetts, according to the announcement) put on sale the home robot vacuum cleaner at $199.95. The announcement called it and explained that it applied , together with low-cost technology, to a home appliance. It first moves in a spiral; when it hits an obstacle it runs along the wall, and then it repeats spirals and straight runs. Cliff sensors detect stairs so it turns away, and over time it passes over each place in a room 2 to 5 times. It ran for 1 to 1.5 hours on its battery, and virtual walls could mark off areas it must not enter.
The popular story:“A robot vacuum maps the room and cleverly chooses its path,” people tend to think (from the impression given by current models; how it is said is this site's guess) The original source says:According to the 2002 announcement of the first Roomba, it was a combination of simple movements, repeating spirals, wall-following after a collision, and straight runs, passing over each place in a room 2 to 5 times over time (it does not say it makes a map).
11 May 1999Verified in the originalSources disagreeJapan
Sony announces AIBO, a four-legged household robot dog. At 250,000 yen, 3000 units sell out in 20 minutes
In May 1999 Sony announced the sale of AIBO (ERS-110), an for the home. It is an animal-shaped robot about 30 cm long with four legs; programs for emotion, instinct, learning and growth let it think and move by itself, and its personality changes depending on how people treat it, such as by petting it. According to its developer, Masahiro Fujita, despite the price of 250,000 yen, the order slots for 3000 units filled up in 20 minutes. The name is short for Artificial Intelligence roBOt, and is also tied to AI, the eye (EYE), and a partner.
2 sources and how they were checked
Where sources disagree:The month of the recruitment: the developer's explanation writes “the recruitment of 3000 units in July”. We have not opened Sony's original announcement (the date and sales method), so we have not checked it against other sources.
20 November 2000Verified in the originalSources disagreeJapan
Honda announces , a humanoid robot that walks on two legs (research since 1986)
Honda announced ASIMO, a small, light humanoid robot that can walk in a way close to a human's. It was designed to be 120 cm tall and weigh 43 kg, a height at which it can reach switches and doorknobs indoors (the previous generation, P3, was 160 cm and 130 kg). A walking technology (i-WALK) that predicts the next movement and shifts the center of gravity in advance lets it make smooth turns. Honda began the research in 1986 and had shown the prototype P2 in 1996 and P3 in 1997.
2 sources and how they were checked
Where sources disagree:The year of Honda's humanoid announcement: according to Honda's materials, P2 was announced on December 20, 1996. On the other hand, Sony's Masahiro Fujita, in a 2000 explanation, lists Honda's humanoid announcement as one of the “events of 1997” (it is not clear whether this means the unveiling of P3 in 1997 or is a mistake).
2002, the (translated) HRP-2, built under a national plan: 154 cm tall, 58 kg, 30 degrees of freedom. The announcement says (translated)
From 1998 the Ministry of Economy, Trade and Industry ran a five-year plan, (translated) (HRP: Humanoid Robotics Project). In the first two years it built the research base (the humanoid robot HRP-1, a remote-control cockpit, and a simulator), and in the last three years it studied five application fields. On March 19, 2002, Kawada Industries and the National Institute of Advanced Industrial Science and Technology (AIST), together with Yaskawa Electric and Shimizu Corporation, announced the “HRP-2 Prototype”, a robot meant to work alongside people outdoors. It is 154 cm tall, weighs 58 kg including the battery, and has 30 degrees of freedom (number of joints), including 2 axes at the waist, and was aimed at walking on uneven ground and getting back up after a fall. The announcement wrote that Japan's industrial-robot market has stayed flat at a scale of 500–600 billion yen a year since the 1980s because uses did not expand, and expressed the hope that, just as one of the biggest products of the 20th century was the automobile, (translated).
What happened next:The deadline is the (translated), and the check is still under way (as of September 2026). This site has not confirmed the current market size of humanoid robots. HRP-2 itself was selected in 2017 by the National Museum of Nature and Science as Future Technology Heritage, and Kawada Robotics explains that it developed into NEXTAGE, a robot that works with people on production lines.
9 June 2005Verified in the originalSources disagreeJapan
2005, the (translated) at the Aichi Expo: cleaning, security and guide robots work on the site, and 65 kinds aiming at (translated) are shown for 11 days, drawing about 123,000 visitors
At the 2005 Aichi Expo (the 2005 World Exposition, Japan), the Expo association and NEDO (New Energy and Industrial Technology Development Organization) carried out the (translated). According to a 2004 press release, the Ministry of Economy, Trade and Industry and NEDO were researching and developing about 100 robots in the (translated). During the Expo, five kinds of “working robots” (translated) were at work on the site: outdoor cleaning, trash-bin replacement, security, guidance in four languages, playing with children, and a wheelchair that avoids obstacles. From June 9 to 19, for 11 days, the (translated) was held, where 65 kinds of robots under development aiming at (translated) were shown under the title (translated), and about 123,000 people visited. The press release also said the robot market was expected to reach 1.8 trillion yen in 2010.
What we still don’t know:This site has not confirmed where the press release's (translated) forecast came from (whose prediction it was), what the actual market size in 2010 was, or which of the 65 kinds aiming at (translated) actually came into use (a candidate for checking as a prediction; market figures need care because they change a great deal with the range of what is counted). The 2001 forecast by the Japan Robot Association (3 trillion yen in 2010) and the 2008 check of it are in the record → A prediction: in 2010 Japan's robot mar….
3 sources and how they were checked
Where sources disagree:The number of prototype robots: the 2004 press release says “63 kinds”, and the feature on the official site in June 2005 says “65 kinds”.
What the figure shows:Even without a map, a robot can repeatedly cover a whole room just by layering behaviors such as turning after a collision, following walls, and moving in spirals.
Share of floor covered (purple=along walls, green=center)
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.
u08_roomba_cover.py
201993–2005 · Predictions
Extending the “Doubling” Line Forward
From the rise in computer performance, can we predict the year it matches the brain?
In 1998, Hans Moravec of Carnegie Mellon University estimated that the work of a human brain needs about 100 million MIPS (1 MIPS is one million instructions per second). He then predicted that the necessary hardware would be . He also wrote that 1960–1990 was .
The predicted year moves a great deal depending on how you set the doubling time. According to the paper, in 1990 an inexpensive personal computer gave 1 MIPS for $1,000. The doubling time was 18 months in the 1980s and 12 months in the late 1990s. Try changing the time in the figure on the right.
In 1993, Vernor Vinge wrote, .
year reached=1990+doubling time (years) × log2(100 million)
log2(100 million)
about 26.6 (how many times you must double to get a factor of 100 million)
What you think you knowThe popular story:The Singularity is Kurzweil's idea (2045) The original source says:Vinge called it the Singularity in 1993 and wrote that superhuman intelligence would come between 2005 and 2030. Vinge himself notes that the word goes back to von Neumann and the idea to I. J. Good.
About the line in the figure
The line in the figure is this site's calculation using numbers from the paper, not Moravec's own line. The deadline of the prediction (the 2020s) has not arrived yet. Vinge wrote that he would be surprised if it happened before 2005 or after 2030.
The goal of RoboCup
RoboCup, the robot soccer tournament started by Japanese researchers (Hiroaki Kitano, Minoru Asada, and others), grew out of the plan of 1993, and held its first tournament in 1997 alongside the International Joint Conference on Artificial Intelligence in Nagoya (IJCAI-97; 1,400 people from 48 countries). The goal on the current official site is that by the middle of the 21st century a team of autonomous humanoid robots will beat the winner of the most recent World Cup.
The 1997 founders' paper wrote the goal as , and gave no deadline year. The earliest source in which the year 2050 appeared in writing has not been found. In July 2026, the first 11-versus-11 match between humanoid robots was played (not a match against a human champion).
Predictions for the robot market
In 2001, a report by the Japan Robot Association and others predicted that the robot market would reach about 3 trillion yen in 2010 and about 8 trillion yen in 2025. But in an analysis by Hirohiko Arai of the National Institute of Advanced Industrial Science and Technology in 2008–2009, the market for non-manufacturing robots was 1.4–6.8 billion yen a year, short of 10 billion yen. Kazuo Tanie, who compiled the forecast, himself wrote that it was a forecast of the (translated).
Sources & confidence (5)Extending the “Doubling” Line Forward
1998Verified in the original
1998, Moravec: The answer: . And AI research from 1960 to 1990 lay in
Hans Moravec of the Robotics Institute at Carnegie Mellon University estimated, in a 1998 paper, the computing speed and memory needed to do what a brain does. Replacing the work of the retina with robot image processing comes to 1,000 MIPS (MIPS = millions of instructions per second). Since the brain is about 100,000 times the size of the retina, he put the whole brain at about 100 million MIPS and its memory at about 100 million megabytes. From the trend of computers getting cheaper, he predicted that , and that this 100 million MIPS . The same paper points out that the performance of computers available for AI research stayed at about 1 MIPS from 1960 to 1990 without growing, so that a researcher's whole career passed in . It also says that performance has doubled every year since 1990, and that now (1998) it is spring.
The popular story:“The 1990s were the second AI winter,” is often said (for example, the 2023 series of covers of the Journal of the Japanese Society for Artificial Intelligence drew roughly 1992 to roughly 2010 as the “second winter”; see the record → How the Japanese Society for Artificial…) The original source says:In his 1998 paper, Moravec called the 30 years from 1960 to 1990, when the performance of computers usable for AI research stayed at about 1 MIPS, . He placed the 1990s, when performance began to double every year, as (a view that measures winter not by budgets or expectations but by the performance of usable computers).
What happened next:As of September 2026, the deadline of the prediction (the 2020s, before 2030) has not yet arrived. Also, Moravec's yardsticks (MIPS = millions of instructions per second, a home machine of about $1,000) do not match today's measures of AI computing (floating-point operations per second, FLOP/s, and so on). The result changes depending on how one converts between them, so this site does not judge whether the prediction was right or wrong.
What we still don’t know:The estimate that the brain's work equals 100 million MIPS is one way of thinking, based on replacing the retina's work with robot image processing; how much computation the brain does is still not known (the paper itself says that ; extrapolation means extending the line of past trends into the future to estimate).
1993, Vinge: . He would be surprised if it came before 2005 or after 2030. The term appeared 12 years before Kurzweil's 2005 book
Vernor Vinge, of the Department of Mathematical Sciences at San Diego State University (his affiliation in the paper), contributed a paper, , to the proceedings of NASA's 1993 event . In it he wrote that within 30 years the technological means to create intelligence beyond that of humans would be available, and that the human era would end shortly afterward. He named four paths to it: , the awakening of large networks, deep connections between humans and computers, and the enhancement of intelligence through biology. He even gave years for the timing: he would be surprised if it happened before 2005 or after 2030. He called this event . In the paper, however, he introduces earlier examples: von Neumann had used the word in the 1950s (as Ulam recounted), and I. J. Good had the idea of the in the 1960s. He also adds himself that people have pointed out that AI enthusiasts have been making similar claims for 30 years.
The popular story:“The Singularity (the technological singularity) is Kurzweil's idea (2045),” people tend to think (for how it spread in Japan, see the record → How the 2045 problem spread in Japan — …) The original source says:Vinge was already calling it in 1993, 12 years before Kurzweil's 2005 book. He predicted the arrival of intelligence beyond humans between 2005 and 2030, earlier than Kurzweil's 2045. Vinge himself also traces the word to von Neumann (1950s) and the idea to I. J. Good (1960s).
What happened next:The end of the period he gave (2030) has not yet arrived (as of September 2026). The year 2023, which corresponds to , has passed, but whether has already been achieved depends on the evaluation standard, and this site does not judge it (for predictions by company leaders in 2023–2025, see records such as → OpenAI's CEO Altman: It is possible tha… and → Anthropic's CEO Amodei says, of powerfu…).
What we still don’t know:Neither the paper nor anything else we found gives a clear standard for how to measure (on which test or job a machine would have to beat humans for it to count).
, started by Japanese researchers: the goal is for a team of humanoid robots to beat the World Cup winners by the middle of the 21st century
, which makes robot soccer a shared challenge for AI and robotics research, was started by Japanese researchers (Hiroaki Kitano, Minoru Asada, Yasuo Kuniyoshi and others). They conceived it in June 1993 as a Japan-only , but within a month people overseas wanted to take part, and it grew into an international project. The first competition was held in Nagoya in 1997, drawing more than 40 teams and more than 5000 spectators. The ultimate goal stated on the official site is that, by the middle of the 21st century, against the winner of the most recent World Cup, following the official rules of FIFA.
The popular story:“Robot soccer is a Japanese invention,” it might be said The original source says:According to the history on the official site, the first to publish robot soccer in a paper was Mackworth of Canada (1992), and the Japanese researchers are described as having been conceiving their own version at about the same time. The ones who turned it into an international competition were the Japanese researchers, starting from the 1993 plan.
What happened next:The deadline has not arrived, so there is no result yet. On July 5, 2026, at RoboCup 2026 held in Incheon, South Korea, 11-on-11 matches between humanoid robots were played for the first time (Germany's B-Human beat Germany's HTWK 4–0). But this was a match between robots, not against human champions.
3 sources and how they were checked
Where sources disagree:How the target year is written: the official site says “the mission at the founding in 1997 runs to 2050”. But the founders' 1997 paper (AI Magazine) contains neither “2050” nor “the middle of the 21st century”. The paper's ultimate goal is to (PDF page 2, page 74 of the journal; ultimate goal ... beat the Brazil world-cup team), with no deadline year. The abstract also says that “the final goal is a World Cup with real robots” (PDF page 1). This site has not confirmed when the year “2050” first appeared in writing.
1997: the International Joint Conference on Artificial Intelligence (IJCAI-97) is held in Nagoya, the second time in Japan after Tokyo in 1979. 1,400 people from 48 countries attend, and the first RoboCup is held alongside
The 15th IJCAI (IJCAI-97), the international conference at which AI researchers gather every two years, was held at the Nagoya Congress Center from August 23 to 29, 1997. According to the list of past host cities on the official IJCAI site, this was the second time it was held in Japan, after Tokyo in 1979. According to the report of the Japanese Society for Artificial Intelligence, 1,400 people from 48 countries took part (550 from overseas). Besides 12 invited talks, 216 contributed paper presentations, 30 workshops and 17 tutorials, side events included the robot soccer tournament RoboCup-97. The decision to bring it to Japan was made in fiscal 1991, and the Japanese Society for Artificial Intelligence had been preparing for it (from the society's business report for fiscal 1991). It was a large international conference held at a time when the number of regular members of the Japanese Society for Artificial Intelligence had begun to fall.
May 2001–2015Verified in the originalSources disagreeJapan
A prediction: in 2010 Japan's robot market will be about 3 trillion yen (a 2001 forecast by industry groups). The home and hospital robot market actually did not reach 10 billion yen
In 2001, a report by the Japan Machinery Federation and the Japan Robot Association forecast the robot market in five fields. For 2010 it gave 1.5 trillion yen for daily life, 850 billion yen for manufacturing, 290 billion yen for public use, 260 billion yen for medical care and welfare, and 90 billion yen for biotechnology (about 3 trillion yen in total), and for 2025 about 8 trillion yen in total. According to a 2009 analysis by Hirohiko Arai of the National Institute of Advanced Industrial Science and Technology, this forecast was used as the basis for explaining research and development budgets by the Ministry of Economy, Trade and Industry and others, and it spread through news reports too. A 2005 Aichi Expo announcement also stated that (translated).
The popular story:“By expanding into non-manufacturing fields, the robot market will grow dramatically” (translated) (the words that Arai's analysis cites as a widely held belief among robot researchers; non-manufacturing fields means home, nursing care, public use and so on) The original source says:The industry association's own survey of actual conditions found that the next-generation robot market outside manufacturing was 1.4 to 6.8 billion yen a year over the period surveyed, never reaching 10 billion yen, and was in fact shrinking (an average of −10.2% a year, in Arai's analysis). The government's 2015 strategy also wrote that the whole robot market was (translated).
What happened next:According to Hirohiko Arai's 2009 analysis, the market for next-generation robots outside manufacturing stayed at 1.4 to 6.8 billion yen a year (under 10 billion yen) in surveys of actual conditions by the industry association and others, far from the 2010 forecast (about 2 trillion yen outside manufacturing). In 2006–2008, national agencies and the industry association itself revised the 2010 forecast downward to 50–75 billion yen. In 2015 the government's gave the size of the robot market as “600 billion yen at present” (translated) and set a new target of 2.4 trillion yen in 2020 (from the Ministry of Internal Affairs and Communications' 2015 white paper). This site has not checked the 2025 forecast.
4 sources and how they were checked
Where sources disagree:The same association's report of the year before (2000) had forecast the 2010 market outside manufacturing at 623.5 billion yen (Arai's analysis; we have not opened the original report). That is an increase of 3.3 times in one year.
What the figure shows:Extending a line of repeatedly doubling performance predicts a year when it will match the brain. But changing only the assumed number of months per doubling can shift that year by decades.
Closing
What This Chapter Still Can't Tell Us
America's , judging from society membership and company sales, took years to arrive, starting in the late 1980s. In Japan, the national white paper of 1991 wrote that Japan had not entered a (translated), but how the use of AI in Japan changed after 1991, and when winter came to Japan (or whether it came at all), is still unclear. We have also not found a source that counts whether the item in the 1984 scenario, , really happened.
In the same era, almost all the technologies that lead to modern AI had appeared: Hopfield networks, Boltzmann machines and restricted Boltzmann machines, backpropagation, networks that squeeze the input into a narrow layer (the prototype of the autoencoder), recurrent networks and LSTM, convolution, mixtures of experts, support vector machines, and TD learning, which learns from games against itself. But why TD-Gammon learned so well was not explained by the theory of the time. Whether the real brain works like a Hopfield network has not been confirmed either.
One of the things that was missing may have been computing power. In 1998, Moravec wrote that seeds long said to be fruitless were suddenly sprouting. In the next chapter, from 2006, the third boom begins, in which deep neural networks “learn by themselves from data.”
Other events in this chapter (1; all with original sources and confidence grades)
1983–1984Verified in the originalSources disagree
When McCarthy gave MYCIN a male patient's amniotic fluid, it accepted it just like that ── recorded by the developers themselves in a book note
A well-known story is often told as an example of the weakness of AI that has experts' knowledge written into it: it does not know the (things taken for granted) that was not written in. A note in the MYCIN book (1984) says that John McCarthy entered that the culture site (the source of the test material) of a male patient was amniotic fluid, and that MYCIN accepted it without noticing the mistake. McCarthy's web paper (1984) does not have this story, but it describes the lack of common sense: MYCIN has no outlook on what happens after treatment, and cannot answer
The popular story:A story is told that McCarthy teased MYCIN (a rumor), and Nilsson also writes The original source says:The people who built MYCIN themselves wrote this episode in a note in their 1984 book, citing . However, McCarthy's web paper does not have the story and describes other lacks of common sense (such as no outlook on what happens after treatment).
What we still don’t know:I have not confirmed which text or lecture specifically refers to.
3 sources and how they were checked
Where sources disagree:Small differences in the story: Nilsson writes that the entry was a male who had had amniocentesis. The MYCIN book writes that the culture site of a male patient was amniotic fluid.