arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.01807cs.AI
收藏

符号回归的贪婪搜索树算法

A Greedy Search Tree Heuristic for Symbolic Regression

Universidade Federal do ABC(巴西ABC联邦大学);Center of Mathematics, Computing and Cognition(数学、计算与认知中心)

Fabricio Olivetti de Franca

摘要:

符号回归试图找到一个数学表达式来描述一组解释变量与测量变量之间的关系。主要目标是找到一个模型,使误差最小化,并且可选地,还使表达式大小最小化。一个较小的表达式可以被看作是一个可解释的模型,被认为是一个可靠的决策模型。这通常用遗传编程来执行,遗传编程将它们的解决方案表示为表达树。该算法的缺点在于这种表示定义了一个崎岖的搜索空间,并包含任何大小和难度的表达式。这些构成了一个挑战,找到最佳的解决方案下的计算约束。本文介绍了一种新的数据结构,称为交互转换(IT),它限制了搜索空间,以排除更大和更复杂的表达式的区域。为了测试这种数据结构,还引入了一种称为SymTree的启发式算法。所得到的结果表明,SymTree是能够获得最佳的解决方案,每当目标函数是在搜索空间的IT数据结构和竞争的结果,当它不是。总的来说,该算法为所有生成的模型找到了准确性和简单性之间的良好折衷。

英文摘要:

Symbolic Regression tries to find a mathematical expression that describes the relationship of a set of explanatory variables to a measured variable. The main objective is to find a model that minimizes the error and, optionally, that also minimizes the expression size. A smaller expression can be seen as an interpretable model considered a reliable decision model. This is often performed with Genetic Programming which represents their solution as expression trees. The shortcoming of this algorithm lies on this representation that defines a rugged search space and contains expressions of any size and difficulty. These pose as a challenge to find the optimal solution under computational constraints. This paper introduces a new data structure, called Interaction-Transformation (IT), that constrains the search space in order to exclude a region of larger and more complicated expressions. In order to test this data structure, it was also introduced an heuristic called SymTree. The obtained results show evidence that SymTree are capable of obtaining the optimal solution whenever the target function is within the search space of the IT data structure and competitive results when it is not. Overall, the algorithm found a good compromise between accuracy and simplicity for all the generated models.

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

↑