REVIEW 8 cited by
Symbolic Regression via Neural-Guided Genetic Programming Population Seeding
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 is the process of identifying mathematical expressions that fit observed output from a black-box process. It is a discrete optimization problem generally believed to be NP-hard. Prior approaches to solving the problem include neural-guided search (e.g. using reinforcement learning) and genetic programming. In this work, we introduce a hybrid neural-guided/genetic programming approach to symbolic regression and other combinatorial optimization problems. We propose a neural-guided component used to seed the starting population of a random restart genetic programming component, gradually learning better starting populations. On a number of common benchmark tasks to recover underlying expressions from a dataset, our method recovers 65% more expressions than a recently published top-performing model using the same experimental setup. We demonstrate that running many genetic programming generations without interdependence on the neural-guided component performs better for symbolic regression than alternative formulations where the two are more strongly coupled. Finally, we introduce a new set of 22 symbolic regression benchmark problems with increased difficulty over existing benchmarks. Source code is provided at www.github.com/brendenpetersen/deep-symbolic-optimization.
Forward citations
Cited by 8 Pith papers
-
Attractor Geometry Determines the Identifiability Limits of System Discovery
The smallest eigenvalue of the attractor's invariant-measure moment matrix — not the choice of algorithm — sets the identifiability ceiling for recovering governing equations from trajectory data.
-
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.
-
SymMatika: Structure-Aware Symbolic Discovery
A structure-aware symbolic regression framework combining multi-island genetic programming with reusable motif libraries reports state-of-the-art recovery rates on Nguyen and Feynman benchmarks, including 61% on Nguyen-12.
-
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.
-
DrSR: LLM based Scientific Equation Discovery with Dual Reasoning from Data and Experience
DrSR improves LLM-based symbolic regression by adding data-aware structural insights and a reflective idea library, beating prior methods on six benchmark tasks.
-
SABER: Symbolic Regression-based Angle of Arrival and Beam Pattern Estimator
AoA can be estimated from a single path loss value by fitting a cos^n inversion with symbolic regression, but the reported accuracy is only demonstrated on the training data and one fixed angle.
-
A Systematic Survey on Large Language Models for Evolutionary Optimization: From Modeling to Solving
A literature survey that classifies LLM-based optimization research into modeling and solving, with solving divided into LLMs as optimizers, low-level components, and high-level managers.
Discussion (0). Sign in to comment.