arXiv:2607. 04156v1 Announce Type: new Abstract: Scientific equation discovery must combine broad domain priors with strict numerical testing.
arXiv:2606. 25039v1 Announce Type: new Abstract: Recovering governing Ordinary Differential Equations (ODEs) from data is a central challenge in modeling dynamical systems across scientific domains.
arXiv:2609.36187v1 Announce Type: new Abstract: Symbolic Regression (SR) is a data-driven method for scientific discovery which searches for interpretable analytical relationships within data. Recent...
The paper investigates Test‑Time Scaling (TTS) for large language models (LLMs) in the context of automated scientific equation discovery, an open‑ended task where models iteratively search candidate equations using observed data for feedback. It frames equation discovery as a unified iterative search that encompasses Best‑of‑N, sequential refinement, tree search, and evolutionary methods, and studies how compute allocation—particularly search width—affects performance under fixed budgets. Experiments on the LLM‑SRBench dataset show that increasing search width with more compute improves results, while other factors like population‑branching split and controller choice have smaller impacts, indicating that controlling exploration versus exploitation is key to scaling LLM‑based equation discovery.
arXiv:2608. 03600v1 Announce Type: new Abstract: Partial differential equations (PDEs) become actionable in science and engineering not as isolated formulae, but as executable workflows that connect modelling assumptions, governing equations, numerical solvers, diagnostics, and decisions.
arXiv:2602. 10576v2 Announce Type: replace-cross Abstract: Symbolic regression aims to distill mathematical equations from observational data.
arXiv:2606. 09276v1 Announce Type: new Abstract: Equation discovery aims to automate the discovery of scientific models in the form of mathematical equations from data.
arXiv:2607. 28684v1 Announce Type: new Abstract: Existing benchmarks for scientific equation discovery are largely composed of well-known equations available in the public domain, making it difficult to determine whether a model is discovering laws from data or merely recalling answers from its training corpus.
MOSAIC‑SR is a new symbolic regression method that combines a pretrained Transformer with search‑based refinement. The Transformer generates multiple initial sketches, which seed searches that jointly recover equation structure and constants using scale‑aware optimization and symbolic repair. On the SRSD‑Feynman dataset and six other benchmarks, MOSAIC‑SR achieves the highest symbolic solution rate and ranks among the top two in predictive accuracy, even when irrelevant dummy variables are present.
arXiv:2607. 13608v1 Announce Type: new Abstract: Automatic scientific discovery has long been a goal of computational scholars - a machine that can discover nature's secrets on its own, moving computational systems beyond data-fitting tools toward the generation and refinement of mechanistic models of the universe.
Automatic scientific discovery has long been a goal of computational scholars - a machine that can discover nature's secrets on its own, moving computational systems beyond data-fitting tools toward the generation and refinement of mechanistic models of the universe. Recent advances in symbolic regression (SR) and large-language-model (LLM)-based agents suggest that such systems can recover equations from data, incorporate domain priors, and automate parts of the research workflow.
arXiv:2608. 04872v1 Announce Type: cross Abstract: Symbolic regression aims to discover closed-form equations from data, but existing LLM-guided methods often rely on a unified proposal loop that compresses heterogeneous search failures into a scalar score and a single prompt.
Symbolic regression aims to discover closed-form equations from data, but existing LLM-guided methods often rely on a unified proposal loop that compresses heterogeneous search failures into a scalar score and a single prompt. We propose A-SR, a self-evolving agentic framework that shifts the control unit from expression edits to role-conditioned evidence views.