arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/9505103cs.AI
收藏

可证有界最优代理

Provably Bounded-Optimal Agents

S. J. Russell, D. Subramanian

摘要:

自诞生以来,人工智能一直依赖于以完美理性为中心的理论基础,作为智能系统的理想属性。我们认为,正如其他人所做的那样,这个基础是不够的,因为它强加了根本无法满足的要求。因此,人工智能的理论与实践之间出现了巨大的差距,阻碍了该领域的进步。相反,我们提出一个属性称为有界最优性。粗略地说,一个代理是有界最优的,如果它的程序是由它的架构和任务环境提出的约束优化问题的解决方案。我们将展示如何构建代理与此属性为一个简单的一类机器架构在广泛的实时环境。我们说明这些结果使用一个简单的模型的自动邮件分拣设施。我们还定义了一个较弱的属性,渐近有界最优性(ABO),推广了经典复杂性理论中的最优性概念。然后,我们构建通用ABO程序,即,无论应用什么实时约束,都是ABO的程序。通用ABO程序可用作更复杂系统的构建模块。最后,我们讨论了有界最优性作为人工智能理论基础的前景,并将其与哲学,经济学和博弈论中的类似趋势联系起来。

英文摘要:

Since its inception, artificial intelligence has relied upon a theoretical foundation centered around perfect rationality as the desired property of intelligent systems. We argue, as others have done, that this foundation is inadequate because it imposes fundamentally unsatisfiable requirements. As a result, there has arisen a wide gap between theory and practice in AI, hindering progress in the field. We propose instead a property called bounded optimality. Roughly speaking, an agent is bounded-optimal if its program is a solution to the constrained optimization problem presented by its architecture and the task environment. We show how to construct agents with this property for a simple class of machine architectures in a broad class of real-time environments. We illustrate these results using a simple model of an automated mail sorting facility. We also define a weaker property, asymptotic bounded optimality (ABO), that generalizes the notion of optimality in classical complexity theory. We then construct universal ABO programs, i.e., programs that are ABO no matter what real-time constraints are applied. Universal ABO programs can be used as building blocks for more complex systems. We conclude with a discussion of the prospects for bounded optimality as a theoretical basis for AI, and relate it to similar trends in philosophy, economics, and game theory.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑