7,129
个编辑
更改
跳到导航
跳到搜索
第263行：
第263行： + + − {{Main|Artificial neural network|Connectionism}} + − [[File:Artificial neural network.svg|thumb|A neural network is an interconnected group of nodes, akin to the vast network of [[neuron]]s in the [[human brain]].神经网络是一组相互连接的节点，类似于人脑中庞大的神经元网络。]] − A neural network is an interconnected group of nodes, akin to the vast network of [[neurons in the human brain.]]+ + − Neural networks were inspired by the architecture of neurons in the human brain. A simple "neuron" ''N'' accepts input from other neurons, each of which, when activated (or "fired"), cast a weighted "vote" for or against whether neuron ''N'' should itself activate. Learning requires an algorithm to adjust these weights based on the training data; one simple algorithm (dubbed "[[Hebbian learning|fire together, wire together]]") is to increase the weight between two connected neurons when the activation of one triggers the successful activation of another. The neural network forms "concepts" that are distributed among a subnetwork of shared{{efn|Each individual neuron is likely to participate in more than one concept.}} neurons that tend to fire together; a concept meaning "leg" might be coupled with a subnetwork meaning "foot" that includes the sound for "foot". Neurons have a continuous spectrum of activation; in addition, neurons can process inputs in a nonlinear way rather than weighing straightforward votes. Modern neural networks can learn both continuous functions and, surprisingly, digital logical operations. Neural networks' early successes included predicting the stock market and (in 1995) a mostly self-driving car.{{efn|Steering for the 1995 "[[History of autonomous cars#1990s|No Hands Across America]]" required "only a few human assists".}}{{sfn|Domingos|2015|loc=Chapter 4}} In the 2010s, advances in neural networks using deep learning thrust AI into widespread public consciousness and contributed to an enormous upshift in corporate AI spending; for example, AI-related [[mergers and acquisitions|M&A]] in 2017 was over 25 times as large as in 2015.<ref>{{cite news|title=Why Deep Learning Is Suddenly Changing Your Life|url=http://fortune.com/ai-artificial-intelligence-deep-machine-learning/|accessdate=12 March 2018|work=Fortune|date=2016}}</ref><ref>{{cite news|title=Google leads in the race to dominate artificial intelligence|url=https://www.economist.com/news/business/21732125-tech-giants-are-investing-billions-transformative-technology-google-leads-race|accessdate=12 March 2018|work=The Economist|date=2017|language=en}}</ref> + − 神经网络的诞生受到人脑神经元结构的启发。一个简单的“神经元”''N'' 接受来自其他神经元的输入，每个神经元在被激活(或者说“放电”)时，都会对''N''是否应该被激活按一定的权重赋上值。学习的过程需要一个根据训练数据调整这些权重的算法：一个被称为“相互放电，彼此联系”简单的算法在一个神经元激活触发另一个神经元的激活时增加两个连接神经元之间的权重。神经网络中形成一种分布在一个共享的神经元子网络中的“概念”，这些神经元往往一起放电。“腿”的概念可能和“脚”概念的子网络相结合，后者包括”脚”的发音。神经元有一个连续的激活频谱; 此外，神经元还可以用非线性的方式处理输入，而不是简单地加权求和。现代神经网络可以学习连续函数甚至的数字逻辑运算。神经网络早期的成功包括预测股票市场和自动驾驶汽车(1995年)。{{efn|Steering for the 1995 "[[History of autonomous cars#1990s|No Hands Across America]]" required "only a few human assists".}}2010年代，神经网络使用深度学习取得巨大进步，也因此将AI推向了公众视野里，并促使企业对AI投资急速增加; 例如2017年与AI相关的并购交易规模是2015年的25倍多。<ref>{{cite news|title=Why Deep Learning Is Suddenly Changing Your Life|url=http://fortune.com/ai-artificial-intelligence-deep-machine-learning/|accessdate=12 March 2018|work=Fortune|date=2016}}</ref><ref>{{cite news|title=Google leads in the race to dominate artificial intelligence|url=https://www.economist.com/news/business/21732125-tech-giants-are-investing-billions-transformative-technology-google-leads-race|accessdate=12 March 2018|work=The Economist|date=2017|language=en}}</ref> − − − The study of non-learning [[artificial neural network]]s<ref name="Neural networks"/> began in the decade before the field of AI research was founded, in the work of [[Walter Pitts]] and [[Warren McCullouch]]. [[Frank Rosenblatt]] invented the [[perceptron]], a learning network with a single layer, similar to the old concept of [[linear regression]]. Early pioneers also include [[Alexey Grigorevich Ivakhnenko]], [[Teuvo Kohonen]], [[Stephen Grossberg]], [[Kunihiko Fukushima]], [[Christoph von der Malsburg]], David Willshaw, [[Shun-Ichi Amari]], [[Bernard Widrow]], [[John Hopfield]], [[Eduardo R. Caianiello]], and others{{citation needed|date=July 2019}}. − − 沃尔特·皮茨和沃伦·麦克卢奇共同完成的非学习型人工神经网络<ref name="Neural networks"/>的研究比AI研究领域成立早十年。他们发明了'''感知机 Perceptron'''，这是一个单层的学习网络，类似于线性回归的概念。早期的先驱者还包括 Alexey Grigorevich Ivakhnenko，Teuvo Kohonen，Stephen Grossberg，Kunihiko Fukushima，Christoph von der Malsburg，David Willshaw，Shun-Ichi Amari，Bernard Widrow，John Hopfield，Eduardo r. Caianiello 等人。 − − − The main categories of networks are acyclic or [[feedforward neural network]]s (where the signal passes in only one direction) and [[recurrent neural network]]s (which allow feedback and short-term memories of previous input events). Among the most popular feedforward networks are [[perceptron]]s, [[multi-layer perceptron]]s and [[radial basis network]]s.<ref name="Feedforward neural networks"/> Neural networks can be applied to the problem of [[intelligent control]] (for robotics) or [[machine learning|learning]], using such techniques as [[Hebbian learning]] ("fire together, wire together"), [[GMDH]] or [[competitive learning]].<ref name="Learning in neural networks"/> − − − 网络主要分为'''非循环或前馈神经网络 Acyclic or Feedforward Neural Networks'''(信号只向一个方向传递)和'''循环神经网络 Recurrent Neural Network''' (允许反馈和对以前的输入事件进行短期记忆)。其中最常用的前馈网络.<ref name="Feedforward neural networks"/>有感知机、'''多层感知机 Multi-layer Perceptrons''' 和'''径向基网络 Radial Basis Networks'''。使用'''赫布型学习 Hebbian Learning''' (“相互放电，共同链接”) ，GMDH 或竞争学习等技术的神经网络可以被应用于智能控制(机器人)或学习问题。<ref name="Learning in neural networks"/> − − − − Today, neural networks are often trained by the [[backpropagation]] algorithm, which had been around since 1970 as the reverse mode of [[automatic differentiation]] published by [[Seppo Linnainmaa]],<ref name="lin1970">[[Seppo Linnainmaa]] (1970). The representation of the cumulative rounding error of an algorithm as a Taylor expansion of the local rounding errors. Master's Thesis (in Finnish), Univ. Helsinki, 6–7.</ref><ref name="grie2012">Griewank, Andreas (2012). Who Invented the Reverse Mode of Differentiation?. Optimization Stories, Documenta Matematica, Extra Volume ISMP (2012), 389–400.</ref> and was introduced to neural networks by [[Paul Werbos]].<ref name="WERBOS1974">[[Paul Werbos]], "Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences", ''PhD thesis, Harvard University'', 1974.</ref><ref name="werbos1982">[[Paul Werbos]] (1982). Applications of advances in nonlinear sensitivity analysis. In System modeling and optimization (pp. 762–770). Springer Berlin Heidelberg. [http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf Online] {{webarchive|url=https://web.archive.org/web/20160414055503/http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf |date=14 April 2016 }}</ref><ref name="Backpropagation"/> − − 当下神经网络常用'''反向传播算法''' 来训练，1970年反向传播算法出现，被认为是 Seppo Linnainmaa提出的自动微分的反向模式出现<ref name="lin1970">[[Seppo Linnainmaa]] (1970). The representation of the cumulative rounding error of an algorithm as a Taylor expansion of the local rounding errors. Master's Thesis (in Finnish), Univ. Helsinki, 6–7.</ref><ref name="grie2012">Griewank, Andreas (2012). Who Invented the Reverse Mode of Differentiation?. Optimization Stories, Documenta Matematica, Extra Volume ISMP (2012), 389–400.</ref>，被保罗·韦伯引入神经网络。<ref name="WERBOS1974">[[Paul Werbos]], "Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences", ''PhD thesis, Harvard University'', 1974.</ref><ref name="werbos1982">[[Paul Werbos]] (1982). Applications of advances in nonlinear sensitivity analysis. In System modeling and optimization (pp. 762–770). Springer Berlin Heidelberg. [http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf Online] {{webarchive|url=https://web.archive.org/web/20160414055503/http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf |date=14 April 2016 }}</ref><ref name="Backpropagation"/> − − − − [[Hierarchical temporal memory]] is an approach that models some of the structural and algorithmic properties of the [[neocortex]].<ref name="Hierarchical temporal memory"/> − − Hierarchical temporal memory is an approach that models some of the structural and algorithmic properties of the neocortex. − − 层次化暂时性记忆是一种模拟大脑新皮层结构和算法特性的方法。<ref name="Hierarchical temporal memory"/> − − − − To summarize, most neural networks use some form of [[gradient descent]] on a hand-created neural topology. However, some research groups, such as [[Uber]], argue that simple [[neuroevolution]] to mutate new neural network topologies and weights may be competitive with sophisticated gradient descent approaches{{citation needed|date=July 2019}}. One advantage of neuroevolution is that it may be less prone to get caught in "dead ends".<ref>{{cite news|title=Artificial intelligence can 'evolve' to solve problems|url=http://www.sciencemag.org/news/2018/01/artificial-intelligence-can-evolve-solve-problems|accessdate=7 February 2018|work=Science {{!}} AAAS|date=10 January 2018|language=en}}</ref> 第313行：
第285行： − {{Main|Deep learning}}+ − − [[Deep learning]] is any [[artificial neural network]] that can learn a long chain of causal links{{dubious|date=July 2019}}. For example, a feedforward network with six hidden layers can learn a seven-link causal chain (six hidden layers + output layer) and has a [[deep learning#Credit assignment|"credit assignment path"]] (CAP) depth of seven{{citation needed|date=July 2019}}. Many deep learning systems need to be able to learn chains ten or more causal links in length.<ref name="schmidhuber2015"/> Deep learning has transformed many important subfields of artificial intelligence{{why|date=July 2019}}, including [[computer vision]], [[speech recognition]], [[natural language processing]] and others.<ref name="goodfellow2016">Ian Goodfellow, Yoshua Bengio, and Aaron Courville (2016). Deep Learning. MIT Press. [http://www.deeplearningbook.org Online] {{webarchive|url=https://web.archive.org/web/20160416111010/http://www.deeplearningbook.org/ |date=16 April 2016 }}</ref><ref name="HintonDengYu2012">{{cite journal | last1 = Hinton | first1 = G. | last2 = Deng | first2 = L. | last3 = Yu | first3 = D. | last4 = Dahl | first4 = G. | last5 = Mohamed | first5 = A. | last6 = Jaitly | first6 = N. | last7 = Senior | first7 = A. | last8 = Vanhoucke | first8 = V. | last9 = Nguyen | first9 = P. | last10 = Sainath | first10 = T. | last11 = Kingsbury | first11 = B. | year = 2012 | title = Deep Neural Networks for Acoustic Modeling in Speech Recognition – The shared views of four research groups | url = | journal = IEEE Signal Processing Magazine | volume = 29 | issue = 6| pages = 82–97 | doi=10.1109/msp.2012.2205597}}</ref><ref name="schmidhuber2015">{{cite journal |last=Schmidhuber |first=J. |year=2015 |title=Deep Learning in Neural Networks: An Overview |journal=Neural Networks |volume=61 |pages=85–117 |arxiv=1404.7828 |doi=10.1016/j.neunet.2014.09.003|pmid=25462637 }}</ref> − − − − − − --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）Credit Assignment Path未找到标准翻译 − − --[[用户:Qige96|Ricky]]（[[用户讨论:Qige96|讨论]]）中文的翻译一般来说就是“信用分配路径”，但其实这里的credit指的是贡献、声誉等。整个CAP要解决的是整条链路种每个神经元对最终结果的贡献是多少。 − 第334行：
第295行： − + − Deep learning often uses [[convolutional neural network]]s (CNNs), whose origins can be traced back to the [[Neocognitron]] introduced by [[Kunihiko Fukushima]] in 1980.<ref name="FUKU1980">{{cite journal | last1 = Fukushima | first1 = K. | year = 1980 | title = Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position | url = | journal = Biological Cybernetics | volume = 36 | issue = 4| pages = 193–202 | doi=10.1007/bf00344251 | pmid=7370364}}</ref> In 1989, [[Yann LeCun]] and colleagues applied [[backpropagation]] to such an architecture. In the early 2000s, in an industrial application, CNNs already processed an estimated 10% to 20% of all the checks written in the US.<ref name="lecun2016slides">[[Yann LeCun]] (2016). Slides on Deep Learning [https://indico.cern.ch/event/510372/ Online] {{webarchive|url=https://web.archive.org/web/20160423021403/https://indico.cern.ch/event/510372/ |date=23 April 2016 }}</ref> − − 深度学习通常使用'卷积神经网络 ConvolutionalNeural Networks CNNs''' ，其起源可以追溯到1980年由福岛邦彦引进的新认知机。1989年扬·勒丘恩(Yann LeCun)和他的同事将反向传播算法应用于这样的架构。在21世纪初，在一项工业应用中，CNNs已经处理了美国大约10% 到20%的签发支票。 第349行：
第307行： − + − Early on, deep learning was also applied to sequence learning with [[recurrent neural network]]s (RNNs)<ref name="Recurrent neural networks"/> which are in theory Turing complete<ref>{{cite journal|last1=Hyötyniemi|first1=Heikki|title=Turing machines are recurrent neural networks|journal=Proceedings of STeP '96/Publications of the Finnish Artificial Intelligence Society|pages=13–24|date=1996}}</ref> and can run arbitrary programs to process arbitrary sequences of inputs. The depth of an RNN is unlimited and depends on the length of its input sequence; thus, an RNN is an example of deep learning.<ref name="schmidhuber2015"/> RNNs can be trained by [[gradient descent]]<ref>P. J. Werbos. Generalization of backpropagation with application to a recurrent gas market model" ''Neural Networks'' 1, 1988.</ref><ref>A. J. Robinson and F. Fallside. The utility driven dynamic error propagation network. Technical Report CUED/F-INFENG/TR.1, Cambridge University Engineering Department, 1987.</ref><ref>R. J. Williams and D. Zipser. Gradient-based learning algorithms for recurrent networks and their computational complexity. In Back-propagation: Theory, Architectures and Applications. Hillsdale, NJ: Erlbaum, 1994.</ref> but suffer from the [[vanishing gradient problem]].<ref name="goodfellow2016"/><ref name="hochreiter1991">[[Sepp Hochreiter]] (1991), [http://people.idsia.ch/~juergen/SeppHochreiter1991ThesisAdvisorSchmidhuber.pdf Untersuchungen zu dynamischen neuronalen Netzen] {{webarchive|url=https://web.archive.org/web/20150306075401/http://people.idsia.ch/~juergen/SeppHochreiter1991ThesisAdvisorSchmidhuber.pdf |date=6 March 2015 }}, Diploma thesis. Institut f. Informatik, Technische Univ. Munich. Advisor: J. Schmidhuber.</ref> In 1992, it was shown that unsupervised pre-training of a stack of [[recurrent neural network]]s can speed up subsequent supervised learning of deep sequential problems.<ref name="SCHMID1992">{{cite journal | last1 = Schmidhuber | first1 = J. | year = 1992 | title = Learning complex, extended sequences using the principle of history compression | url = | journal = Neural Computation | volume = 4 | issue = 2| pages = 234–242 | doi=10.1162/neco.1992.4.2.234| citeseerx = 10.1.1.49.3934}}</ref> − 早期，深度学习也被用于'''循环神经网络 Recurrent Neural Networks,RNNs''' 的序列学习<ref>{{cite journal|last1=Hyötyniemi|first1=Heikki|title=Turing machines are recurrent neural networks|journal=Proceedings of STeP '96/Publications of the Finnish Artificial Intelligence Society|pages=13–24|date=1996}}</ref>，可以运行任意程序来处理任意的输入序列。一个循环神经网络的深度是无限制的，取决于其输入序列的长度; 因此，循环神经网络是一个深度学习的例子<ref name="schmidhuber2015"/>，但却存在梯度消失问题。1992年的一项研究表明无监督的预训练循环神经网络可以加速后续的深度序列问题的监督式学习。]<ref>P. J. Werbos. Generalization of backpropagation with application to a recurrent gas market model" ''Neural Networks'' 1, 1988.</ref><ref>A. J. Robinson and F. Fallside. The utility driven dynamic error propagation network. Technical Report CUED/F-INFENG/TR.1, Cambridge University Engineering Department, 1987.</ref><ref>R. J. Williams and D. Zipser. Gradient-based learning algorithms for recurrent networks and their computational complexity. In Back-propagation: Theory, Architectures and Applications. Hillsdale, NJ: Erlbaum, 1994.</ref> but suffer from the [[vanishing gradient problem]].<ref name="goodfellow2016"/><ref name="hochreiter1991">[[Sepp Hochreiter]] (1991), [http://people.idsia.ch/~juergen/SeppHochreiter1991ThesisAdvisorSchmidhuber.pdf Untersuchungen zu dynamischen neuronalen Netzen] {{webarchive|url=https://web.archive.org/web/20150306075401/http://people.idsia.ch/~juergen/SeppHochreiter1991ThesisAdvisorSchmidhuber.pdf |date=6 March 2015 }}, Diploma thesis. Institut f. Informatik, Technische Univ. Munich. Advisor: J. Schmidhuber.</ref> In 1992, it was shown that unsupervised pre-training of a stack of [[recurrent neural network]]s can speed up subsequent supervised learning of deep sequential problems.<ref name="SCHMID1992">{{cite journal | last1 = Schmidhuber | first1 = J. | year = 1992 | title = Learning complex, extended sequences using the principle of history compression | url = | journal = Neural Computation | volume = 4 | issue = 2| pages = 234–242 | doi=10.1162/neco.1992.4.2.234| citeseerx = 10.1.1.49.3934}}</ref>+ − − − − Numerous researchers now use variants of a deep learning recurrent NN called the [[long short-term memory]] (LSTM) network published by Hochreiter & Schmidhuber in 1997.<ref name=lstm>[[Sepp Hochreiter|Hochreiter, Sepp]]; and [[Jürgen Schmidhuber|Schmidhuber, Jürgen]]; ''Long Short-Term Memory'', Neural Computation, 9(8):1735–1780, 1997</ref> LSTM is often trained by [[Connectionist temporal classification|Connectionist Temporal Classification]] (CTC).<ref name="graves2006">Alex Graves, Santiago Fernandez, Faustino Gomez, and [[Jürgen Schmidhuber]] (2006). Connectionist temporal classification: Labelling unsegmented sequence data with recurrent neural nets. Proceedings of ICML'06, pp. 369–376.</ref> At Google, Microsoft and Baidu this approach has revolutionized [[speech recognition]].<ref name="hannun2014">{{cite arXiv − − − 许多研究人员现在使用着一种被称为 '''长短期记忆 Long Short-term Memory, LSTM'''的网络——一种深度学习循环神经网络的变体，由霍克赖特和施米德胡贝在1997年提出。人们通常使用'''连接时序分类 Connectionist Temporal Classification, CTC'''训练LSTM<ref name="graves2006">Alex Graves, Santiago Fernandez, Faustino Gomez, and [[Jürgen Schmidhuber]] (2006). Connectionist temporal classification: Labelling unsegmented sequence data with recurrent neural nets. Proceedings of ICML'06, pp. 369–376.</ref>。谷歌，微软和百度用CTC彻底改变了语音识别。例如,2015年谷歌的语音识别性能大幅提升了49%,现在数十亿智能手机用户都可以通过谷歌声音使用这项技术。谷歌也使用LSTM来改进机器翻译，例如2015年，通过训练的LSTM，谷歌的语音识别性能大幅提升了49%，现在通过谷歌语音可以被数十亿的智能手机用户使用。谷歌还使用LSTM来改进机器翻译、语言建模和多语言语言处理。LSTM与CNNs一起使用改进了自动图像字幕的功能等众多应用。<ref name="hannun2014"> − AI, like electricity or the steam engine, is a general purpose technology. There is no consensus on how to characterize which tasks AI tends to excel at.<ref>{{cite news|last1=Brynjolfsson|first1=Erik|last2=Mitchell|first2=Tom|title=What can machine learning do? Workforce implications|url=http://science.sciencemag.org/content/358/6370/1530|accessdate=7 May 2018|work=Science|date=22 December 2017|pages=1530–1534|language=en|doi=10.1126/science.aap8062|bibcode=2017Sci...358.1530B}}</ref> While projects such as [[AlphaZero]] have succeeded in generating their own knowledge from scratch, many other machine learning projects require large training datasets.<ref>{{cite news|last1=Sample|first1=Ian|title='It's able to create knowledge itself': Google unveils AI that learns on its own|url=https://www.theguardian.com/science/2017/oct/18/its-able-to-create-knowledge-itself-google-unveils-ai-learns-all-on-its-own|accessdate=7 May 2018|work=the Guardian|date=18 October 2017|language=en}}</ref><ref>{{cite news|title=The AI revolution in science|url=http://www.sciencemag.org/news/2017/07/ai-revolution-science|accessdate=7 May 2018|work=Science {{!}} AAAS|date=5 July 2017|language=en}}</ref> Researcher [[Andrew Ng]] has suggested, as a "highly imperfect rule of thumb", that "almost anything a typical human can do with less than one second of mental thought, we can probably now or in the near future automate using AI."<ref>{{cite news|title=Will your job still exist in 10 years when the robots arrive?|url=http://www.scmp.com/tech/innovation/article/2098164/robots-are-coming-here-are-some-jobs-wont-exist-10-years|accessdate=7 May 2018|work=[[South China Morning Post]]|date=2017|language=en}}</ref> [[Moravec's paradox]] suggests that AI lags humans at many tasks that the human brain has specifically evolved to perform well.<ref name="The Economist"/>+ − AI和电或蒸汽机一样，是一种通用技术。AI 擅长什么样的任务，这个问题尚未达成共识<ref>{{cite news|last1=Brynjolfsson|first1=Erik|last2=Mitchell|first2=Tom|title=What can machine learning do? Workforce implications|url=http://science.sciencemag.org/content/358/6370/1530|accessdate=7 May 2018|work=Science|date=22 December 2017|pages=1530–1534|language=en|doi=10.1126/science.aap8062|bibcode=2017Sci...358.1530B}}</ref>。虽然像 AlphaZero 这样的项目已经能做到从零开始产生知识，但是许多其他的机器学习项目仍需要大量的训练数据集<ref>{{cite news|last1=Sample|first1=Ian|title='It's able to create knowledge itself': Google unveils AI that learns on its own|url=https://www.theguardian.com/science/2017/oct/18/its-able-to-create-knowledge-itself-google-unveils-ai-learns-all-on-its-own|accessdate=7 May 2018|work=the Guardian|date=18 October 2017|language=en}}</ref><ref>{{cite news|title=The AI revolution in science|url=http://www.sciencemag.org/news/2017/07/ai-revolution-science|accessdate=7 May 2018|work=Science {{!}} AAAS|date=5 July 2017|language=en}}</ref>。研究人员吴恩达认为，作为一个“极不完美的经验法则”，“几乎任何普通人只需要不到一秒钟的思考就能做到的事情，我们现在或者在不久的将来都可以使用AI做到。”莫拉维克悖论表明，AI在执行许多人类大脑专门进化出来的、能够很好完成的任务时表现不如人类。<ref>{{cite news|title=Will your job still exist in 10 years when the robots arrive?|url=http://www.scmp.com/tech/innovation/article/2098164/robots-are-coming-here-are-some-jobs-wont-exist-10-years|accessdate=7 May 2018|work=[[South China Morning Post]]|date=2017|language=en}}</ref> [[Moravec's paradox]] suggests that AI lags humans at many tasks that the human brain has specifically evolved to perform well.<ref name="The Economist"/>+ − Games provide a well-publicized benchmark for assessing rates of progress. [[AlphaGo]] around 2016 brought the era of classical board-game benchmarks to a close. Games of imperfect knowledge provide new challenges to AI in the area of [[game theory]].<ref>{{cite news|last1=Borowiec|first1=Tracey Lien, Steven|title=AlphaGo beats human Go champ in milestone for artificial intelligence|url=https://www.latimes.com/world/asia/la-fg-korea-alphago-20160312-story.html|accessdate=7 May 2018|work=latimes.com|date=2016}}</ref><ref>{{cite news|last1=Brown|first1=Noam|last2=Sandholm|first2=Tuomas|title=Superhuman AI for heads-up no-limit poker: Libratus beats top professionals|url=http://science.sciencemag.org/content/359/6374/418|accessdate=7 May 2018|work=Science|date=26 January 2018|pages=418–424|language=en|doi=10.1126/science.aao1733}}</ref> [[Esports|E-sports]] such as [[StarCraft]] continue to provide additional public benchmarks.<ref>{{cite journal|last1=Ontanon|first1=Santiago|last2=Synnaeve|first2=Gabriel|last3=Uriarte|first3=Alberto|last4=Richoux|first4=Florian|last5=Churchill|first5=David|last6=Preuss|first6=Mike|title=A Survey of Real-Time Strategy Game AI Research and Competition in StarCraft|journal=IEEE Transactions on Computational Intelligence and AI in Games|date=December 2013|volume=5|issue=4|pages=293–311|doi=10.1109/TCIAIG.2013.2286295|citeseerx=10.1.1.406.2524}}</ref><ref>{{cite news|title=Facebook Quietly Enters StarCraft War for AI Bots, and Loses|url=https://www.wired.com/story/facebook-quietly-enters-starcraft-war-for-ai-bots-and-loses/|accessdate=7 May 2018|work=WIRED|date=2017}}</ref> There are many competitions and prizes, such as the [[ImageNet|Imagenet Challenge]], to promote research in artificial intelligence. The most common areas of competition include general machine intelligence, conversational behavior, data-mining, [[autonomous car|robotic cars]], and robot soccer as well as conventional games.<ref>{{Cite web|url=http://image-net.org/challenges/LSVRC/2017/|title=ILSVRC2017|website=image-net.org|language=en|access-date=2018-11-06}}</ref>+ + − 游戏是评估进步率用的一个广泛认可的基准。2016年前后，AlphaGo 为传统棋类基准的时代的拉下终幕。<ref>{{cite news|last1=Borowiec|first1=Tracey Lien, Steven|title=AlphaGo beats human Go champ in milestone for artificial intelligence|url=https://www.latimes.com/world/asia/la-fg-korea-alphago-20160312-story.html|accessdate=7 May 2018|work=latimes.com|date=2016}}</ref><ref>{{cite news|last1=Brown|first1=Noam|last2=Sandholm|first2=Tuomas|title=Superhuman AI for heads-up no-limit poker: Libratus beats top professionals|url=http://science.sciencemag.org/content/359/6374/418|accessdate=7 May 2018|work=Science|date=26 January 2018|pages=418–424|language=en|doi=10.1126/science.aao1733}}</ref> [[Esports|E-sports]] such as [[StarCraft]] continue to provide additional public benchmarks.<ref>{{cite journal|last1=Ontanon|first1=Santiago|last2=Synnaeve|first2=Gabriel|last3=Uriarte|first3=Alberto|last4=Richoux|first4=Florian|last5=Churchill|first5=David|last6=Preuss|first6=Mike|title=A Survey of Real-Time Strategy Game AI Research and Competition in StarCraft|journal=IEEE Transactions on Computational Intelligence and AI in Games|date=December 2013|volume=5|issue=4|pages=293–311|doi=10.1109/TCIAIG.2013.2286295|citeseerx=10.1.1.406.2524}}</ref><ref>{{cite news|title=Facebook Quietly Enters StarCraft War for AI Bots, and Loses|url=https://www.wired.com/story/facebook-quietly-enters-starcraft-war-for-ai-bots-and-loses/|accessdate=7 May 2018|work=WIRED|date=2017}}</ref> 不过，不完全知识的游戏给AI在博弈论领域提出了新的挑战。星际争霸等电子竞技现在仍然是一项的公众基准。现在出现了设立了有许多如 Imagenet 挑战赛的比赛和奖项以促进AI研究。最常见的比赛内容包括通用机器智能、对话行为、数据挖掘、机器人汽车、机器人足球以及传统游戏。 <ref>{{Cite web|url=http://image-net.org/challenges/LSVRC/2017/|title=ILSVRC2017|website=image-net.org|language=en|access-date=2018-11-06}}</ref>+ − − − The "imitation game" (an interpretation of the 1950 [[Turing test]] that assesses whether a computer can imitate a human) is nowadays considered too exploitable to be a meaningful benchmark.<ref>{{cite journal|last1=Schoenick|first1=Carissa|last2=Clark|first2=Peter|last3=Tafjord|first3=Oyvind|last4=Turney|first4=Peter|last5=Etzioni|first5=Oren|title=Moving beyond the Turing Test with the Allen AI Science Challenge|journal=Communications of the ACM|date=23 August 2017|volume=60|issue=9|pages=60–64|doi=10.1145/3122814|arxiv=1604.04315}}</ref> A derivative of the Turing test is the Completely Automated Public Turing test to tell Computers and Humans Apart ([[CAPTCHA]]). As the name implies, this helps to determine that a user is an actual person and not a computer posing as a human. In contrast to the standard Turing test, CAPTCHA is administered by a machine and targeted to a human as opposed to being administered by a human and targeted to a machine. A computer asks a user to complete a simple test then generates a grade for that test. Computers are unable to solve the problem, so correct solutions are deemed to be the result of a person taking the test. A common type of CAPTCHA is the test that requires the typing of distorted letters, numbers or symbols that appear in an image undecipherable by a computer.{{sfn|O'Brien|Marakas|2011}} − − − − “模仿游戏”(对1950年图灵测试的一种解释，用来评估计算机是否可以模仿人类)如今被认为过于灵活，所以不能成为有一项意义的基准<ref>{{cite journal|last1=Schoenick|first1=Carissa|last2=Clark|first2=Peter|last3=Tafjord|first3=Oyvind|last4=Turney|first4=Peter|last5=Etzioni|first5=Oren|title=Moving beyond the Turing Test with the Allen AI Science Challenge|journal=Communications of the ACM|date=23 August 2017|volume=60|issue=9|pages=60–64|doi=10.1145/3122814|arxiv=1604.04315}}</ref>。图灵测试衍生出了'''<font color=#ff8000>验证码 Completely Automated Public Turing test to tell Computers and Humans Apart,CAPTCHA</font>'''(即全自动区分计算机和人类的图灵测试)，顾名思义，这有助于确定用户是一个真实的人，而不是一台伪装成人的计算机。与标准的图灵测试不同，CAPTCHA 是由机器控制，面向人测试，而不是由人控制的，面向机器测试的。计算机要求用户完成一个简单的测试，然后给测试评出一个等级。计算机无法解决这个问题，所以一般认为只有人参加测试才能得出正确答案。验证码的一个常见类型是要求输入一幅计算机无法破译的图中扭曲的字母，数字或符号测试。{{sfn|O'Brien|Marakas|2011}} − − − “通用智能”测试旨在比较机器、人类甚至非人类动物在尽可能通用的问题集上的表现。在极端情况下，测试集可以包含所有可能出现的问题，再通过柯尔莫哥洛夫复杂度赋予权重；可是这些问题集里大多数问题都是不怎么难的模式匹配练习，在这些练习中，优化过的AI可以轻易地超过人类。<ref name="Mathematical definitions of intelligence"/><ref>{{cite journal|last1=Hernández-Orallo|first1=José|last2=Dowe|first2=David L.|last3=Hernández-Lloreda|first3=M.Victoria|title=Universal psychometrics: Measuring cognitive abilities in the machine kingdom|journal=Cognitive Systems Research|date=March 2014|volume=27|pages=50–74|doi=10.1016/j.cogsys.2013.06.001|hdl=10251/50244|hdl-access=free}}</ref>
→人工神经网络
===人工神经网络 ===
===人工神经网络 ===
[[File:Artificial neural network.svg|thumb|神经网络是一组相互连接的节点，类似于人脑中庞大的神经元网络。]]
神经网络的诞生受到人脑神经元结构的启发。一个简单的“神经元”''N'' 接受来自其他神经元的输入，每个神经元在被激活(或者说“放电”)时，都会对''N''是否应该被激活按一定的权重赋上值。学习的过程需要一个根据训练数据调整这些权重的算法：一个被称为“相互放电，彼此联系”简单的算法在一个神经元激活触发另一个神经元的激活时增加两个连接神经元之间的权重。神经网络中形成一种分布在一个共享的神经元子网络中的“概念”，这些神经元往往一起放电。“腿”的概念可能和“脚”概念的子网络相结合，后者包括”脚”的发音。神经元有一个连续的激活频谱; 此外，神经元还可以用非线性的方式处理输入，而不是简单地加权求和。现代神经网络可以学习连续函数甚至的数字逻辑运算。神经网络早期的成功包括预测股票市场和自动驾驶汽车(1995年)。<ref name="Domingos, Pedro (2015)"/>2010年代，神经网络使用深度学习取得巨大进步，也因此将AI推向了公众视野里，并促使企业对AI投资急速增加; 例如2017年与AI相关的并购交易规模是2015年的25倍多。<ref>{{cite news|title=Why Deep Learning Is Suddenly Changing Your Life|url=http://fortune.com/ai-artificial-intelligence-deep-machine-learning/|accessdate=12 March 2018|work=Fortune|date=2016}}</ref><ref>{{cite news|title=Google leads in the race to dominate artificial intelligence|url=https://www.economist.com/news/business/21732125-tech-giants-are-investing-billions-transformative-technology-google-leads-race|accessdate=12 March 2018|work=The Economist|date=2017|language=en}}</ref>
Walter Pitts和Warren McCullouch共同完成的非学习型人工神经网络的研究比AI研究领域成立早十年。他们发明了'''感知机 Perceptron'''，这是一个单层的学习网络，类似于线性回归的概念。早期的先驱者还包括 Alexey Grigorevich Ivakhnenko，Teuvo Kohonen，Stephen Grossberg，Kunihiko Fukushima，Christoph von der Malsburg，David Willshaw，Shun-Ichi Amari，Bernard Widrow，John Hopfield，Eduardo r. Caianiello 等人。
网络主要分为'''非循环或前馈神经网络 Acyclic or Feedforward Neural Networks'''(信号只向一个方向传递)和'''循环神经网络 Recurrent Neural Network''' (允许反馈和对以前的输入事件进行短期记忆)。其中最常用的前馈网络有感知机、'''多层感知机 Multi-layer Perceptrons''' 和'''径向基网络 Radial Basis Networks'''。使用'''赫布型学习 Hebbian Learning''' (“相互放电，共同链接”) ，GMDH 或竞争学习等技术的神经网络可以被应用于智能控制(机器人)或学习问题。
当下神经网络常用'''[[反向传播算法]]''' 来训练，1970年反向传播算法出现，被认为是 Seppo Linnainmaa提出的自动微分的反向模式出现<ref name="lin1970">Seppo Linnainmaa(1970). The representation of the cumulative rounding error of an algorithm as a Taylor expansion of the local rounding errors. Master's Thesis (in Finnish), Univ. Helsinki, 6–7.</ref><ref name="grie2012">Griewank, Andreas (2012). Who Invented the Reverse Mode of Differentiation?. Optimization Stories, Documenta Matematica, Extra Volume ISMP (2012), 389–400.</ref>，被Paul Werbos引入神经网络。<ref name="WERBOS1974">Paul Werbos, "Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences", ''PhD thesis, Harvard University'', 1974.</ref><ref name="werbos1982">Paul Werbos (1982). Applications of advances in nonlinear sensitivity analysis. In System modeling and optimization (pp. 762–770). Springer Berlin Heidelberg. [http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf Online] </ref><ref name="Backpropagation"/>
层次化暂时性记忆是一种模拟大脑新皮层结构和算法特性的方法。<ref name="Hierarchical temporal memory">{{cite book|last1=Hawkins|first1=Jeff|title=On Intelligence|title-link=On Intelligence|last2=Blakeslee|first2=Sandra|publisher=Owl Books|year=2005|isbn=978-0-8050-7853-4|location=New York, NY|author-link=Jeff Hawkins}}</ref>
总之，大多数神经网络都会在人工神经拓扑结构上使用某种形式的'''梯度下降法 Gradient Descent'''。然而，一些研究组，比如 Uber的，认为通过简单的神经进化改变新神经网络拓扑结构和神经元间的权重可能比复杂的梯度下降法更适用{{citation needed|date=July 2019}}。神经进化的一个优势是，它不容易陷入“死胡同”。<ref>{{cite news|title=Artificial intelligence can 'evolve' to solve problems|url=http://www.sciencemag.org/news/2018/01/artificial-intelligence-can-evolve-solve-problems|accessdate=7 February 2018|work=Science {{!}} AAAS|date=10 January 2018|language=en}}</ref>
总之，大多数神经网络都会在人工神经拓扑结构上使用某种形式的'''梯度下降法 Gradient Descent'''。然而，一些研究组，比如 Uber的，认为通过简单的神经进化改变新神经网络拓扑结构和神经元间的权重可能比复杂的梯度下降法更适用{{citation needed|date=July 2019}}。神经进化的一个优势是，它不容易陷入“死胡同”。<ref>{{cite news|title=Artificial intelligence can 'evolve' to solve problems|url=http://www.sciencemag.org/news/2018/01/artificial-intelligence-can-evolve-solve-problems|accessdate=7 February 2018|work=Science {{!}} AAAS|date=10 January 2018|language=en}}</ref>
====深层前馈神经网络====
====深层前馈神经网络====
深度学习是任何可以学习长因果链的人工神经网络。例如，一个具有六个隐藏层的前馈网络可以学习有七个链接的因果链(六个隐藏层 + 一个输出层) ，并且具深度为7的“'''信用分配路径 Credit Assignment Path（CAP）''' ”。许多深度学习系统需要学习长度在十及以上的因果链。<ref name="goodfellow2016">Ian Goodfellow, Yoshua Bengio, and Aaron Courville (2016). Deep Learning. MIT Press. [http://www.deeplearningbook.org Online] {{webarchive|url=https://web.archive.org/web/20160416111010/http://www.deeplearningbook.org/ |date=16 April 2016 }}</ref><ref name="HintonDengYu2012">{{cite journal | last1 = Hinton | first1 = G. | last2 = Deng | first2 = L. | last3 = Yu | first3 = D. | last4 = Dahl | first4 = G. | last5 = Mohamed | first5 = A. | last6 = Jaitly | first6 = N. | last7 = Senior | first7 = A. | last8 = Vanhoucke | first8 = V. | last9 = Nguyen | first9 = P. | last10 = Sainath | first10 = T. | last11 = Kingsbury | first11 = B. | year = 2012 | title = Deep Neural Networks for Acoustic Modeling in Speech Recognition – The shared views of four research groups | url = | journal = IEEE Signal Processing Magazine | volume = 29 | issue = 6| pages = 82–97 | doi=10.1109/msp.2012.2205597}}</ref><ref name="schmidhuber2015">{{cite journal |last=Schmidhuber |first=J. |year=2015 |title=Deep Learning in Neural Networks: An Overview |journal=Neural Networks |volume=61 |pages=85–117 |arxiv=1404.7828 |doi=10.1016/j.neunet.2014.09.003|pmid=25462637 }}</ref>
深度学习是任何可以学习长因果链的人工神经网络。例如，一个具有六个隐藏层的前馈网络可以学习有七个链接的因果链(六个隐藏层 + 一个输出层) ，并且具深度为7的“'''信用分配路径 Credit Assignment Path，CAP''' ”。许多深度学习系统需要学习长度在十及以上的因果链。<ref name="goodfellow2016">Ian Goodfellow, Yoshua Bengio, and Aaron Courville (2016). Deep Learning. MIT Press. [http://www.deeplearningbook.org Online] {{webarchive|url=https://web.archive.org/web/20160416111010/http://www.deeplearningbook.org/ |date=16 April 2016 }}</ref><ref name="HintonDengYu2012">{{cite journal | last1 = Hinton | first1 = G. | last2 = Deng | first2 = L. | last3 = Yu | first3 = D. | last4 = Dahl | first4 = G. | last5 = Mohamed | first5 = A. | last6 = Jaitly | first6 = N. | last7 = Senior | first7 = A. | last8 = Vanhoucke | first8 = V. | last9 = Nguyen | first9 = P. | last10 = Sainath | first10 = T. | last11 = Kingsbury | first11 = B. | year = 2012 | title = Deep Neural Networks for Acoustic Modeling in Speech Recognition – The shared views of four research groups | url = | journal = IEEE Signal Processing Magazine | volume = 29 | issue = 6| pages = 82–97 | doi=10.1109/msp.2012.2205597}}</ref><ref name="schmidhuber2015">{{cite journal |last=Schmidhuber |first=J. |year=2015 |title=Deep Learning in Neural Networks: An Overview |journal=Neural Networks |volume=61 |pages=85–117 |arxiv=1404.7828 |doi=10.1016/j.neunet.2014.09.003|pmid=25462637 }}</ref>
深度学习通常使用'卷积神经网络 ConvolutionalNeural Networks CNNs''' ，其起源可以追溯到1980年由福岛邦彦引进的新认知机。<ref name="FUKU1980">{{cite journal | last1 = Fukushima | first1 = K. | year = 1980 | title = Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position | url = | journal = Biological Cybernetics | volume = 36 | issue = 4| pages = 193–202 | doi=10.1007/bf00344251 | pmid=7370364}}</ref> 1989年扬·勒丘恩(Yann LeCun)和他的同事将反向传播算法应用于这样的架构。在21世纪初，在一项工业应用中，CNNs已经处理了美国大约10% 到20%的签发支票。<ref name="lecun2016slides">[[Yann LeCun]] (2016). Slides on Deep Learning [https://indico.cern.ch/event/510372/ Online] {{webarchive|url=https://web.archive.org/web/20160423021403/https://indico.cern.ch/event/510372/ |date=23 April 2016 }}</ref>
====深层循环（递归）神经网络 ====
====深层循环（递归）神经网络 ====
{{Main|Recurrent neural networks}}
早期，深度学习也被用于'''循环神经网络 Recurrent Neural Networks（RNNs）''' 的序列学习<ref>{{cite journal|last1=Hyötyniemi|first1=Heikki|title=Turing machines are recurrent neural networks|journal=Proceedings of STeP '96/Publications of the Finnish Artificial Intelligence Society|pages=13–24|date=1996}}</ref>，可以运行任意程序来处理任意的输入序列。一个循环神经网络的深度是无限制的，取决于其输入序列的长度; 因此，循环神经网络是一个深度学习的例子<ref name="schmidhuber2015"/>，<ref>P. J. Werbos. Generalization of backpropagation with application to a recurrent gas market model" ''Neural Networks'' 1, 1988.</ref><ref>A. J. Robinson and F. Fallside. The utility driven dynamic error propagation network. Technical Report CUED/F-INFENG/TR.1, Cambridge University Engineering Department, 1987.</ref><ref>R. J. Williams and D. Zipser. Gradient-based learning algorithms for recurrent networks and their computational complexity. In Back-propagation: Theory, Architectures and Applications. Hillsdale, NJ: Erlbaum, 1994.</ref>但却存在梯度消失问题。<ref name="goodfellow2016"/><ref name="hochreiter1991">Sepp Hochreiter (1991), [http://people.idsia.ch/~juergen/SeppHochreiter1991ThesisAdvisorSchmidhuber.pdf Untersuchungen zu dynamischen neuronalen Netzen], Diploma thesis. Institut f. Informatik, Technische Univ. Munich. Advisor: J. Schmidhuber.</ref>1992年的一项研究表明无监督的预训练循环神经网络可以加速后续的深度序列问题的监督式学习。<ref name="SCHMID1992">{{cite journal | last1 = Schmidhuber | first1 = J. | year = 1992 | title = Learning complex, extended sequences using the principle of history compression | url = | journal = Neural Computation | volume = 4 | issue = 2| pages = 234–242 | doi=10.1162/neco.1992.4.2.234| citeseerx = 10.1.1.49.3934}}</ref>
许多研究人员现在使用着一种被称为 '''长短期记忆 Long Short-term Memory（LSTM）'''的网络——一种深度学习循环神经网络的变体，由霍克赖特和施米德胡贝在1997年提出。<ref name=lstm>[[Sepp Hochreiter|Hochreiter, Sepp]]; and [[Jürgen Schmidhuber|Schmidhuber, Jürgen]]; ''Long Short-Term Memory'', Neural Computation, 9(8):1735–1780, 1997</ref>人们通常使用'''连接时序分类 Connectionist Temporal Classification, CTC'''训练LSTM<ref name="graves2006">Alex Graves, Santiago Fernandez, Faustino Gomez, and [[Jürgen Schmidhuber]] (2006). Connectionist temporal classification: Labelling unsegmented sequence data with recurrent neural nets. Proceedings of ICML'06, pp. 369–376.</ref>。谷歌，微软和百度用CTC彻底改变了语音识别。例如,2015年谷歌的语音识别性能大幅提升了49%,现在数十亿智能手机用户都可以通过谷歌声音使用这项技术。谷歌也使用LSTM来改进机器翻译，例如2015年，通过训练的LSTM，谷歌的语音识别性能大幅提升了49%，现在通过谷歌语音可以被数十亿的智能手机用户使用。谷歌还使用LSTM来改进机器翻译、语言建模和多语言语言处理。LSTM与CNNs一起使用改进了自动图像字幕的功能等众多应用。<ref name="hannun2014">{{cite arXiv|eprint=1412.5567|class=cs.CL|first1=Awni|last1=Hannun|first2=Carl|last2=Case|title=Deep Speech: Scaling up end-to-end speech recognition|last3=Casper|first9=Shubho|year=2014|author11-link=Andrew Ng|first11=Andrew Y.|last11=Ng|first10=Adam|last10=Coates|first8=Sanjeev|last9=Sengupta|first3=Jared|last8=Satheesh|last7=Prenger|first6=Erich|last6=Elsen|first5=Greg|last5=Diamos|first4=Bryan|last4=Catanzaro|first7=Ryan}}</ref><ref name="sak2014">Hasim Sak and Andrew Senior and Francoise Beaufays (2014). Long Short-Term Memory recurrent neural network architectures for large scale acoustic modeling. Proceedings of Interspeech 2014.</ref><ref name="liwu2015">{{cite arXiv|eprint=1410.4281|class=cs.CL|first1=Xiangang|last1=Li|first2=Xihong|last2=Wu|title=Constructing Long Short-Term Memory based Deep Recurrent Neural Networks for Large Vocabulary Speech Recognition|year=2015}}</ref>
===评估进度===
===评估进度===
AI和电或蒸汽机一样，是一种通用技术。AI 擅长什么样的任务，这个问题尚未达成共识<ref>{{cite news|last1=Brynjolfsson|first1=Erik|last2=Mitchell|first2=Tom|title=What can machine learning do? Workforce implications|url=http://science.sciencemag.org/content/358/6370/1530|accessdate=7 May 2018|work=Science|date=22 December 2017|pages=1530–1534|language=en|doi=10.1126/science.aap8062|bibcode=2017Sci...358.1530B}}</ref>。虽然像 AlphaZero 这样的项目已经能做到从零开始产生知识，但是许多其他的机器学习项目仍需要大量的训练数据集<ref>{{cite news|last1=Sample|first1=Ian|title='It's able to create knowledge itself': Google unveils AI that learns on its own|url=https://www.theguardian.com/science/2017/oct/18/its-able-to-create-knowledge-itself-google-unveils-ai-learns-all-on-its-own|accessdate=7 May 2018|work=the Guardian|date=18 October 2017|language=en}}</ref><ref>{{cite news|title=The AI revolution in science|url=http://www.sciencemag.org/news/2017/07/ai-revolution-science|accessdate=7 May 2018|date=5 July 2017|language=en}}</ref>。研究人员吴恩达认为，作为一个“极不完美的经验法则”，“几乎任何普通人只需要不到一秒钟的思考就能做到的事情，我们现在或者在不久的将来都可以使用AI做到。”莫拉维克悖论表明，AI在执行许多人类大脑专门进化出来的、能够很好完成的任务时表现不如人类。<ref>{{cite news|title=Will your job still exist in 10 years when the robots arrive?|url=http://www.scmp.com/tech/innovation/article/2098164/robots-are-coming-here-are-some-jobs-wont-exist-10-years|accessdate=7 May 2018|work=[[South China Morning Post]]|date=2017|language=en}}</ref> Moravec's paradox suggests that AI lags humans at many tasks that the human brain has specifically evolved to perform well.<ref name="The Economist"/>
游戏是评估进步率用的一个广泛认可的基准。2016年前后，AlphaGo 为传统棋类基准的时代的拉下终幕。<ref>{{cite news|last1=Borowiec|first1=Tracey Lien, Steven|title=AlphaGo beats human Go champ in milestone for artificial intelligence|url=https://www.latimes.com/world/asia/la-fg-korea-alphago-20160312-story.html|accessdate=7 May 2018|work=latimes.com|date=2016}}</ref><ref>{{cite news|last1=Brown|first1=Noam|last2=Sandholm|first2=Tuomas|title=Superhuman AI for heads-up no-limit poker: Libratus beats top professionals|url=http://science.sciencemag.org/content/359/6374/418|accessdate=7 May 2018|work=Science|date=26 January 2018|pages=418–424|language=en|doi=10.1126/science.aao1733}}</ref> 不过，不完全知识的游戏给AI在博弈论领域提出了新的挑战。星际争霸等电子竞技现在仍然是一项的公众基准。<ref>{{cite journal|last1=Ontanon|first1=Santiago|last2=Synnaeve|first2=Gabriel|last3=Uriarte|first3=Alberto|last4=Richoux|first4=Florian|last5=Churchill|first5=David|last6=Preuss|first6=Mike|title=A Survey of Real-Time Strategy Game AI Research and Competition in StarCraft|journal=IEEE Transactions on Computational Intelligence and AI in Games|date=December 2013|volume=5|issue=4|pages=293–311|doi=10.1109/TCIAIG.2013.2286295|citeseerx=10.1.1.406.2524}}</ref><ref>{{cite news|title=Facebook Quietly Enters StarCraft War for AI Bots, and Loses|url=https://www.wired.com/story/facebook-quietly-enters-starcraft-war-for-ai-bots-and-loses/|accessdate=7 May 2018|work=WIRED|date=2017}}</ref> 现在出现了设立了有许多如 Imagenet 挑战赛的比赛和奖项以促进AI研究。最常见的比赛内容包括通用机器智能、对话行为、数据挖掘、机器人汽车、机器人足球以及传统游戏。 <ref>{{Cite web|url=http://image-net.org/challenges/LSVRC/2017/|title=ILSVRC2017|website=image-net.org|language=en|access-date=2018-11-06}}</ref>
“模仿游戏”(对1950年图灵测试的一种解释，用来评估计算机是否可以模仿人类)如今被认为过于灵活，所以不能成为有一项意义的基准<ref>{{cite journal|last1=Schoenick|first1=Carissa|last2=Clark|first2=Peter|last3=Tafjord|first3=Oyvind|last4=Turney|first4=Peter|last5=Etzioni|first5=Oren|title=Moving beyond the Turing Test with the Allen AI Science Challenge|journal=Communications of the ACM|date=23 August 2017|volume=60|issue=9|pages=60–64|doi=10.1145/3122814|arxiv=1604.04315}}</ref>。图灵测试衍生出了'''<font color=#ff8000>Completely Automated Public Turing test to tell Computers and Humans Apart,CAPTCHA</font>'''(即全自动区分计算机和人类的图灵测试)，顾名思义，这有助于确定用户是一个真实的人，而不是一台伪装成人的计算机。与标准的图灵测试不同，CAPTCHA 是由机器控制，面向人测试，而不是由人控制的，面向机器测试的。计算机要求用户完成一个简单的测试，然后给测试评出一个等级。计算机无法解决这个问题，所以一般认为只有人参加测试才能得出正确答案。验证码的一个常见类型是要求输入一幅计算机无法破译的图中扭曲的字母，数字或符号测试。
“通用智能”测试旨在比较机器、人类甚至非人类动物在尽可能通用的问题集上的表现。在极端情况下，测试集可以包含所有可能出现的问题，再通过柯尔莫哥洛夫复杂度赋予权重；可是这些问题集里大多数问题都是不怎么难的模式匹配练习，在这些练习中，优化过的AI可以轻易地超过人类。<ref name="Mathematical definitions of intelligence"/><ref>{{cite journal|last1=Hernández-Orallo|first1=José|last2=Dowe|first2=David L.|last3=Hernández-Lloreda|first3=M.Victoria|title=Universal psychometrics: Measuring cognitive abilities in the machine kingdom|journal=Cognitive Systems Research|date=March 2014|volume=27|pages=50–74|doi=10.1016/j.cogsys.2013.06.001|hdl=10251/50244|hdl-access=free}}</ref>
</br>
== 应用 ==
== 应用 ==