arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.14973cs.LGcs.MScs.SC
收藏

基于机器学习的符号积分算法选择:LSTM与Tree LSTM的对比

Symbolic Integration Algorithm Selection with Machine Learning: LSTMs vs Tree LSTMs

Coventry University(考文垂大学);Maplesoft(Maplesoft公司)

Rashid Barket, Matthew England, Jürgen Gerhard

AI总结:

本研究探讨利用机器学习指导计算机代数系统中的符号积分子算法选择,比较了LSTM与TreeLSTM模型,发现编码树结构的TreeLSTM表现更优且超越Maple现有元算法。

摘要:

计算机代数系统(如Maple)被用于研究、教育和工业环境中。其关键功能之一是符号积分,其中有许多子算法可供选择,这会影响输出积分的形式和运行时间。为给定问题选择正确的子算法具有挑战性:我们假设机器学习可以指导这种子算法的选择。我们方法论的一个关键考虑因素是如何将数学表示给ML模型:我们假设一种编码数学表达式树结构的表示方法会非常适合。我们训练了LSTM和TreeLSTM模型用于子算法预测,并将它们与Maple现有方法进行了比较。我们的TreeLSTM表现远好于LSTM,突显了使用数学表达式信息表示的优势。它能够产生比Maple当前最先进的元算法更好的输出,为进一步研究提供了坚实基础。

英文摘要:

Computer Algebra Systems (e.g. Maple) are used in research, education, and industrial settings. One of their key functionalities is symbolic integration, where there are many sub-algorithms to choose from that can affect the form of the output integral, and the runtime. Choosing the right sub-algorithm for a given problem is challenging: we hypothesise that Machine Learning can guide this sub-algorithm choice. A key consideration of our methodology is how to represent the mathematics to the ML model: we hypothesise that a representation which encodes the tree structure of mathematical expressions would be well suited. We trained both an LSTM and a TreeLSTM model for sub-algorithm prediction and compared them to Maple's existing approach. Our TreeLSTM performs much better than the LSTM, highlighting the benefit of using an informed representation of mathematical expressions. It is able to produce better outputs than Maple's current state-of-the-art meta-algorithm, giving a strong basis for further research.

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

↑