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

广义固定深度前缀与后缀符号回归文法

Generalized Fixed-Depth Prefix and Postfix Symbolic Regression Grammars

Edward Finkelstein

AI总结:

本研究构建可生成任意表达式的固定深度前缀与后缀符号回归文法,基于5种启发式搜索策略在10个真值表达式上对比二者性能,发现表达式树每层平均节点数与性能相关,可提升符号回归效率以助力科学发现。

摘要:

我们构建了无错误、固定深度、基于字符串的前缀及后缀符号回归文法,能够从操作数、一元运算符和/或二元运算符集合中生成任意表达式。借助这些文法,我们概述了5种主流启发式搜索策略的简化形式:Brute Force Search(暴力搜索)、Monte Carlo Tree Search(蒙特卡洛树搜索)、Particle Swarm Optimization(粒子群优化)、Genetic Programming(遗传编程)以及Simulated Annealing(模拟退火)。针对每种算法,我们在统一的C++/Eigen框架内实现了10个真值表达式,对比了前缀与后缀形式的相对性能。实验表明,真值表达式树每层的平均节点数与前缀和后缀的相对性能之间存在较强的相关性。本文提出的固定深度文法可通过提升符号回归效率推动科学发现,助力各学科更快识别精准的数学模型。

英文摘要:

We develop faultless, fixed-depth, string-based, prefix and postfix symbolic regression grammars, capable of producing \emph{any} expression from a set of operands, unary operators and/or binary operators. Using these grammars, we outline simplified forms of 5 popular heuristic search strategies: Brute Force Search, Monte Carlo Tree Search, Particle Swarm Optimization, Genetic Programming, and Simulated Annealing. For each algorithm, we compare the relative performance of prefix vs postfix for ten ground-truth expressions implemented entirely within a common C++/Eigen framework. Our experiments show a comparatively strong correlation between the average number of nodes per layer of the ground truth expression tree and the relative performance of prefix vs postfix. The fixed-depth grammars developed herein can enhance scientific discovery by increasing the efficiency of symbolic regression, enabling faster identification of accurate mathematical models across various disciplines.

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

↑