REVIEW 3 cited by
AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularity
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
We present an improved method for symbolic regression that seeks to fit data to formulas that are Pareto-optimal, in the sense of having the best accuracy for a given complexity. It improves on the previous state-of-the-art by typically being orders of magnitude more robust toward noise and bad data, and also by discovering many formulas that stumped previous methods. We develop a method for discovering generalized symmetries (arbitrary modularity in the computational graph of a formula) from gradient properties of a neural network fit. We use normalizing flows to generalize our symbolic regression method to probability distributions from which we only have samples, and employ statistical hypothesis testing to accelerate robust brute-force search.
Forward citations
Cited by 3 Pith papers
-
A First Observational Assessment of Cosmic Backreaction Over an Extended Redshift Range
First model-light constraints on Ω_R + 3Ω_Q from Pantheon+ and BAO reconstructions are consistent with flat FLRW yet too broad to exclude percent-level backreaction.
-
A "Neural" Riemann solver for Relativistic Hydrodynamics
Small neural networks trained on exact solutions can replace the iterative root-finding in a relativistic Riemann solver, giving exact-like accuracy about 14 times faster in 1D tests.
-
Bridging the Domain Gap in Equation Distillation with Reinforcement Feedback
Reinforcement learning fine-tuning with numerical fitness rewards improves equation discovery accuracy and noise robustness of a pretrained symbolic regression transformer.
Discussion (0). Continue with ORCID to comment.