REVIEW 4 cited by
End-to-end symbolic regression with transformers
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
Symbolic regression, the task of predicting the mathematical expression of a function from the observation of its values, is a difficult task which usually involves a two-step procedure: predicting the "skeleton" of the expression up to the choice of numerical constants, then fitting the constants by optimizing a non-convex loss function. The dominant approach is genetic programming, which evolves candidates by iterating this subroutine a large number of times. Neural networks have recently been tasked to predict the correct skeleton in a single try, but remain much less powerful. In this paper, we challenge this two-step procedure, and task a Transformer to directly predict the full mathematical expression, constants included. One can subsequently refine the predicted constants by feeding them to the non-convex optimizer as an informed initialization. We present ablations to show that this end-to-end approach yields better results, sometimes even without the refinement step. We evaluate our model on problems from the SRBench benchmark and show that our model approaches the performance of state-of-the-art genetic programming with several orders of magnitude faster inference.
Forward citations
Cited by 4 Pith papers
-
LLM-Based Scientific Equation Discovery via Physics-Informed Token-Regularized Policy Optimization
PiT-PO adaptively fine-tunes an LLM during symbolic regression search using physics-validity and token-level redundancy constraints, reporting state-of-the-art benchmark results and a periodic-hill turbulence closure.
-
MOT-SR: Multi-Objective Tool-Augmented Scientific Equation Discovery with Large Language Models
MOT-SR combines tool-augmented data analysis with multi-objective Pareto selection to discover symbolic equations, outperforming LLM-based and classical SR baselines on benchmarks and an EMRI orbital-correction task.
-
Learning Semantics-aware Search Operators for Genetic Programming
A graph-neural-network-scored expansion and grafting operator modestly improves genetic programming success rates on symbolic regression, though not consistently across all population sizes.
-
SyMANTIC: An Efficient Symbolic Regression Method for Interpretable and Parsimonious Model Discovery in Science and Beyond
SyMANTIC discovers simple mathematical models by screening inputs with mutual information, expanding features recursively, and fitting sparse linear models with a Pareto front of accuracy versus complexity.
Discussion (0). Continue with ORCID to comment.