arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.07307cs.AIcs.LG
收藏

用范畴理论解树问题

Solving Tree Problems with Category Theory

Monash University(莫纳什大学)

Rafik Hadfi

摘要:

人工智能(AI)长期以来一直在追求模型、理论和技术,以使机器具有类似人类的通用智能。然而,即使是目前人工智能中占主导地位的数据驱动方法,似乎也缺乏人类解决各种问题的独特能力。这种情况引出了一个问题,即存在着作为一般问题解决能力基础的原则。我们通过不同问题和解决方案之间的类比的数学公式来处理这个问题。我们特别关注可以表示为树状结构的问题。最重要的是,我们采用了范畴理论的方法,在形式化的树问题的类别,并证明存在的等价性显然无关的问题域。我们证明了一个函子之间的树问题的类别和类别的解决方案。我们还提供了一个较弱的版本的函子通过量化等价的问题类别使用的度量树问题。

英文摘要:

Artificial Intelligence (AI) has long pursued models, theories, and techniques to imbue machines with human-like general intelligence. Yet even the currently predominant data-driven approaches in AI seem to be lacking humans' unique ability to solve wide ranges of problems. This situation begs the question of the existence of principles that underlie general problem-solving capabilities. We approach this question through the mathematical formulation of analogies across different problems and solutions. We focus in particular on problems that could be represented as tree-like structures. Most importantly, we adopt a category-theoretic approach in formalising tree problems as categories, and in proving the existence of equivalences across apparently unrelated problem domains. We prove the existence of a functor between the category of tree problems and the category of solutions. We also provide a weaker version of the functor by quantifying equivalences of problem categories using a metric on tree problems.

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

↑