Solving Tree Problems with Category Theory
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.
Code (1)
Similar Papers 제목 키워드 기반
General problem solving with category theory
This paper proposes a formal cognitive framework for problem solving based on category theory. We introduce cognitive categories, which are categories with exactly one morphism between any two objects. Objects in these c…
Solving General Arithmetic Word Problems
This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on …
General ClassificationWorld KnowledgeNonparallel Hyperplane Classifiers for Multi-category Classification
Support vector machines (SVMs) are widely used for solving classification and regression problems. Recently, various nonparallel hyperplanes classification algorithms (NHCAs) have been proposed, which are comparable in t…
Binary ClassificationClassificationGeneral ClassificationLearning to Branch
Tree search algorithms, such as branch-and-bound, are the most widely used tools for solving combinatorial and nonconvex problems. For example, they are the foremost method for solving (mixed) integer programs and constr…
Variable SelectionExemplars can Reciprocate Principal Components
This paper presents a clustering algorithm that is an extension of the Category Trees algorithm. Category Trees is a clustering method that creates tree structures that branch on category type and not feature. The develo…
Clustering