REVIEW 1 cited by
Invariant Representation of Mathematical Expressions
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
While there exist many methods in machine learning for comparison of letter string data, most are better equipped to handle strings that represent natural language, and their performance will not hold up when presented with strings that correspond to mathematical expressions. Based on the graphical representation of the expression tree, here we propose a simple method for encoding such expressions that is only sensitive to their structural properties, and invariant to the specifics which can vary between two seemingly different, but semantically similar mathematical expressions.
Forward citations
Cited by 1 Pith paper
-
Probabilistic Symbolic Regression for Equation Discovery via Operator-induced and Regularized Symbolic Forests
A hierarchical Bayesian symbolic regression framework (HierBOSSS) with tree-based expression priors, Occam-window model selection, and posterior concentration rates at near-parametric and near-minimax speeds.
Discussion (0). Sign in to comment.