REVIEW 1 cited by
Transformers to Predict the Applicability of Symbolic Integration Routines
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Symbolic integration is a fundamental problem in mathematics: we consider how machine learning may be used to optimise this task in a Computer Algebra System (CAS). We train transformers that predict whether a particular integration method will be successful, and compare against the existing human-made heuristics (called guards) that perform this task in a leading CAS. We find the transformer can outperform these guards, gaining up to 30% accuracy and 70% precision. We further show that the inference time of the transformer is inconsequential which shows that it is well-suited to include as a guard in a CAS. Furthermore, we use Layer Integrated Gradients to interpret the decisions that the transformer is making. If guided by a subject-matter expert, the technique can explain some of the predictions based on the input tokens, which can lead to further optimisations.
Forward citations
Cited by 1 Pith paper
-
Studying number theory with deep learning: a case study with the M\"obius and squarefree indicator functions
Transformers can predict squarefree numbers with around 70% accuracy from CRT encodings, but only by exploiting divisibility by 2 and 3, and they cannot separate the two signs of the Möbius function.
Discussion (0). Continue with ORCID to comment.