REVIEW 15 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
Deep Learning for Symbolic Mathematics
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 15 Pith papers
-
Exhaustive Symbolic Integration: Integration by Differentiation and the Landscape of Symbolic Integrability
Exhaustive enumeration of functions up to complexity k across operator bases shows the integrability fraction declines with k but rises sharply with logarithms, and the method discovers three integrals that resist Sym...
-
Generative Language Modeling for Automated Theorem Proving
GPT-f, a transformer-based prover for Metamath, generated new short proofs that were accepted into the main library—the first such contribution from a deep-learning system.
-
Symbolic Regression via Latent Iterative Refinement
LEE performs iterative amortized inference in a functionally grounded latent space to produce 2-10x simpler symbolic expressions than strong baselines on SRBench.
-
Learning First Integrals via Backward-Generated Data and Guided Reinforcement Learning
FISolver trains a compact LLM on backward-generated (differential equation, first integral) pairs and uses guided reinforcement learning to outperform larger models and Mathematica on first-integral benchmarks at lower cost.
-
Neuro-Symbolic ODE Discovery with Latent Grammar Flow
Latent Grammar Flow discovers ODEs by placing grammar-based equation representations in a discrete latent space, using a behavioral loss to cluster similar equations, and sampling via a discrete flow model guided by d...
-
$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture
k-server-bench formulates potential-function discovery for the k-server conjecture as a code-based inequality-satisfaction task; current agents fully solve the resolved k=3 case and reduce violations on the open k=4 case.
-
The Long Delay to Arithmetic Generalization: When Learned Representations Outrun Behavior
The grokking delay in encoder-decoder models on one-step Collatz prediction stems from decoder inability to use early-learned encoder representations of parity and residue structure, with numeral base acting as a stro...
-
Learning to Unscramble: Simplifying Symbolic Expressions via Self-Supervised Oracle Trajectories
A permutation-equivariant transformer trained on self-supervised oracle trajectories from scrambled expressions achieves near-perfect simplification rates for dilogarithms and 100% success on 5-point gluon scattering ...
-
Massive Activations in Large Language Models
Massive activations are constant large values in LLMs that function as indispensable bias terms and concentrate attention probabilities on specific tokens.
-
EditSR: Enhancing Neural Symbolic Regression via Edit-based Rectification
EditSR improves neural symbolic regression accuracy on complex expressions by pretraining an edit-based rectifier on state-transition correction chains that enforce syntactic validity and condition edits only on the c...
-
The Long Delay to Arithmetic Generalization: When Learned Representations Outrun Behavior
Grokking delay on Collatz prediction is a decoder access bottleneck after early encoder structure learning, with numeral base as a strong inductive bias on learnability.
-
Neuro-Symbolic AI for Analytical Solutions of Differential Equations
SIGS is a neuro-symbolic framework that discovers analytical solutions to PDEs by generating grammar-constrained expressions, embedding them in a topology-regularised latent manifold, and refining structure and coeffi...
-
Statistical Patterns in the Equations of Physics and the Emergence of a Meta-Law of Nature
Physics equation corpora exhibit exponential decay in mathematical operator frequencies, proposed as a meta-law that narrows the space of plausible expressions for symbolic regression.
-
Training Verifiers to Solve Math Word Problems
Introduces GSM8K dataset and demonstrates that verifier-based selection of solutions from multiple candidates outperforms fine-tuning baselines on math word problems.
-
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.