REVIEW 3 cited by
Deep Learning for Symbolic Mathematics
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
read the original abstract
Neural networks have a reputation for being better at solving statistical or approximate problems than at performing calculations or working with symbolic data. In this paper, we show that they can be surprisingly good at more elaborated tasks in mathematics, such as symbolic integration and solving differential equations. We propose a syntax for representing mathematical problems, and methods for generating large datasets that can be used to train sequence-to-sequence models. We achieve results that outperform commercial Computer Algebra Systems such as Matlab or Mathematica.
Forward citations
Cited by 3 Pith papers
-
Neuro-Symbolic ODE Discovery with Latent Grammar Flow
Latent Grammar Flow embeds grammar-based ODE representations into a discrete latent space with a behavioural loss and samples candidate equations via discrete flow to fit observed data.
-
Learning neuro-symbolic convergent term rewriting systems
Two modular neuro-symbolic systems learn to simplify formulas by imitating term rewriting steps, and the new FastNRS variant generalizes to deeper formulas while being far faster than the original.
-
A Better Multi-Objective GP-GOMEA -- But do we Need it?
For accuracy vs expression size, single-objective GP-GOMEA with an archive-only multi-objective log outperforms true multi-objective GP-GOMEA, despite new clustering improvements.
Discussion (0). Continue with ORCID to comment.