Symbolic Integration Algorithm Selection with Machine Learning: LSTMs vs Tree LSTMs
<|reference_start|>Symbolic Integration Algorithm Selection with Machine Learning: LSTMs vs Tree LSTMs: 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.<|reference_end|>
@article{barket2024symbolic,
    title={Symbolic Integration Algorithm Selection with Machine Learning: LSTMs vs
  Tree LSTMs},
    author={Rashid Barket and Matthew England and J"urgen Gerhard},
    journal={arXiv preprint arXiv:2404.14973},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.14973},
    primaryClass={cs.LG cs.MS cs.SC}
}