更改

在经典的规划问题中，智能体可以假设它是世界上唯一运行着的系统，以便于智能体确定其做出某个行为带来的后果。<ref>Russell, Stuart J.; Norvig, Peter (2003), Artificial Intelligence: A Modern Approach (2nd ed.), Upper Saddle River, New Jersey: Prentice Hall, ISBN 0-13-790395-2,pp. 375–430</ref><ref>Poole, David; Mackworth, Alan; Goebel, Randy (1998). Computational Intelligence: A Logical Approach. New York: Oxford University Press. ISBN 978-0-19-510270-3, pp. 375–430</ref><ref><ref>然而，如果智能体不是唯一的参与者，这就要求智能体能够在不确定的情况下进行推理。这需要一智能体不仅能够评估其环境和作出预测，而且还评估其预测和根据其预测做出调整。<ref name="Non-deterministic planning"/>

在经典的规划问题中，智能体可以假设它是世界上唯一运行着的系统，以便于智能体确定其做出某个行为带来的后果。<ref>Russell, Stuart J.; Norvig, Peter (2003), Artificial Intelligence: A Modern Approach (2nd ed.), Upper Saddle River, New Jersey: Prentice Hall, ISBN 0-13-790395-2,pp. 375–430</ref><ref>Poole, David; Mackworth, Alan; Goebel, Randy (1998). Computational Intelligence: A Logical Approach. New York: Oxford University Press. ISBN 978-0-19-510270-3, pp. 375–430</ref>然而，如果智能体不是唯一的参与者，这就要求智能体能够在不确定的情况下进行推理。这需要一智能体不仅能够评估其环境和作出预测，而且还评估其预测和根据其预测做出调整。<ref name="Non-deterministic planning"/>

多智能体规划利用多个智能体之间的协作和竞争来达到目标。进化算法和群体智能会用到类似这样的涌现行为。<ref name="Multi-agent planning"/>

多智能体规划利用多个智能体之间的协作和竞争来达到目标。进化算法和群体智能会用到类似这样的涌现行为。<ref>Russell, Stuart J.; Norvig, Peter (2003), Artificial Intelligence: A Modern Approach (2nd ed.), Upper Saddle River, New Jersey: Prentice Hall, ISBN 0-13-790395-2, pp. 430–449</ref>

===学习===

===学习===

Machine learning (ML), a fundamental concept of AI research since the field's inception,<ref>[[Alan Turing]] discussed the centrality of learning as early as 1950, in his classic paper "[[Computing Machinery and Intelligence]]".{{Harv|Turing|1950}} In 1956, at the original Dartmouth AI summer conference, [[Ray Solomonoff]] wrote a report on unsupervised probabilistic machine learning: "An Inductive Inference Machine".{{Harv|Solomonoff|1956}}</ref> is the study of computer algorithms that improve automatically through experience.<ref>This is a form of [[Tom M. Mitchell|Tom Mitchell]]'s widely quoted definition of machine learning: "A computer program is set to learn from an experience ''E'' with respect to some task ''T'' and some performance measure ''P'' if its performance on ''T'' as measured by ''P'' improves with experience ''E''."</ref><ref name="Machine learning"/>

'''机器学习 Machine Learning（ML）'''是自AI诞生以来就有的一个基本概念，它研究如何通过经验自动改进计算机算法。

 

机器学习'''<font color=#ff8000> Machine Learning,ML</font>'''是自AI诞生以来就有的一个基本概念，它研究如何通过经验自动改进计算机算法。

 

[[Unsupervised learning]] is the ability to find patterns in a stream of input, without requiring a human to label the inputs first. [[Supervised learning]] includes both [[statistical classification|classification]] and numerical [[Regression analysis|regression]], which requires a human to label the input data first. Classification is used to determine what category something belongs in, and occurs after a program sees a number of examples of things from several categories. Regression is the attempt to produce a function that describes the relationship between inputs and outputs and predicts how the outputs should change as the inputs change.<ref name="Machine learning"/> Both classifiers and regression learners can be viewed as "function approximators" trying to learn an unknown (possibly implicit) function; for example, a spam classifier can be viewed as learning a function that maps from the text of an email to one of two categories, "spam" or "not spam". [[Computational learning theory]] can assess learners by [[computational complexity]], by [[sample complexity]] (how much data is required), or by other notions of [[optimization theory|optimization]].<ref>{{cite journal|last1=Jordan|first1=M. I.|last2=Mitchell|first2=T. M.|title=Machine learning: Trends, perspectives, and prospects|journal=Science|date=16 July 2015|volume=349|issue=6245|pages=255–260|doi=10.1126/science.aaa8415|pmid=26185243|bibcode=2015Sci...349..255J}}</ref> In [[reinforcement learning]]<ref name="Reinforcement learning"/> the agent is rewarded for good responses and punished for bad ones. The agent uses this sequence of rewards and punishments to form a strategy for operating in its problem space.

[[Unsupervised learning]] is the ability to find patterns in a stream of input, without requiring a human to label the inputs first. [[Supervised learning]] includes both [[statistical classification|classification]] and numerical [[Regression analysis|regression]], which requires a human to label the input data first. Classification is used to determine what category something belongs in, and occurs after a program sees a number of examples of things from several categories. Regression is the attempt to produce a function that describes the relationship between inputs and outputs and predicts how the outputs should change as the inputs change.<ref name="Machine learning"/> Both classifiers and regression learners can be viewed as "function approximators" trying to learn an unknown (possibly implicit) function; for example, a spam classifier can be viewed as learning a function that maps from the text of an email to one of two categories, "spam" or "not spam". [[Computational learning theory]] can assess learners by [[computational complexity]], by [[sample complexity]] (how much data is required), or by other notions of [[optimization theory|optimization]].<ref>{{cite journal|last1=Jordan|first1=M. I.|last2=Mitchell|first2=T. M.|title=Machine learning: Trends, perspectives, and prospects|journal=Science|date=16 July 2015|volume=349|issue=6245|pages=255–260|doi=10.1126/science.aaa8415|pmid=26185243|bibcode=2015Sci...349..255J}}</ref> In [[reinforcement learning]]<ref name="Reinforcement learning"/> the agent is rewarded for good responses and punished for bad ones. The agent uses this sequence of rewards and punishments to form a strategy for operating in its problem space.