The paper presents a probabilistic symbolic regression framework that models mathematical expressions as ensembles of symbolic trees, using a regularizing prior to control complexity and an Occam’s window-based posterior to capture uncertainty across plausible models. It provides theoretical guarantees on posterior concentration, including near‑parametric rates when an exact finite formula exists and oracle results under misspecification. Empirical results show the method outperforms state‑of‑the‑art competitors in predictive accuracy, symbolic complexity, and structural recovery on benchmark scientific equations and a materials discovery task.
By Somjit Roy, Pritam Dey, Bani K. Mallick, Debdeep Pati
arXiv:2511. 04124v3 Announce Type: replace Abstract: Symbolic regression (SR) models complex systems by discovering mathematical expressions that capture underlying relationships in observed data.
By Giorgio Morales, John W. Sheppard
SMILE (Sine, Multiplication, Identity, Logarithm, Exponential) is a hybrid framework that merges continuous gradient-based optimization with discrete symbolic recovery for symbolic regression. It operates in three stages: structural analysis to uncover the compositional hierarchy of the target expression, continuous optimization to learn parameters of a network using interpretable activations, and symbolic recovery via structured pruning, coefficient optimization, and rounding to produce a compact expression with exact symbolic constants. Evaluated on SRBench, SMILE achieves the highest symbolic solution rate under high noise, remains on the Pareto front of accuracy versus complexity, and recovers simpler expressions much faster than competing methods.
By Mansooreh Montazerin, Antonio Ortega, Ajitesh Srivastava
Neural Symbolic Regression (NSR) uses neural networks as functional preconditioners to learn smooth, noise‑robust approximations of target functions in an interaction‑aware nonlinear feature space. A subsequent LASSO step extracts sparse, interpretable closed‑form expressions, while distributed hyperparameter optimization with Ray Tune and ASHA scheduling improves predictive accuracy and symbolic fidelity. Experiments on the Nguyen benchmark demonstrate that NSR outperforms SINDy and untuned neural baselines in RMSE, noise robustness, and out‑of‑distribution generalization, with ablation studies highlighting the importance of feature interactions, neural depth, and tuning strategies.
By Ravi Kumar U, Sumitra S
arXiv:2606. 28381v1 Announce Type: cross Abstract: Symbolic regression via genetic programming routinely fails on small, wide datasets - a regime common in clinical-trial monitoring, biostatistics, and engineering pilot studies - by converging on bloated, overfit expressions that exploit correlation rather than prediction.
By Artem Andrianov (Cyntegrity Germany GmbH, Hofheim am Taunus, Germany)
arXiv:2606. 07704v1 Announce Type: cross Abstract: Symbolic regression aims to uncover explicit scientific laws from data.
By Zeyu Xia, Jun Zhu, Dong Yan
arXiv:2602. 23561v2 Announce Type: replace-cross Abstract: Symbolic regression (SR) has gained recent traction in AI-driven scientific discovery for learning closed-form physical laws.
By Somjit Roy, Pritam Dey, Bani K. Mallick
arXiv:2606. 31990v1 Announce Type: cross Abstract: We analyze the effect of optimizing the initial population of genetic programming (GP) for symbolic regression (SR) on the accuracy and complexity of solutions.
By Lukas Kammerer, Gabriel Kronberger, Deaglan J. Bartlett, Harry Desmond, Pedro G. Ferreira, Stephan Winkler
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...
By Cristina Rossetti, Anna V. Kononova, Thomas B\"ack, Fei Liu, Niki Van Stein
arXiv:2608. 09617v1 Announce Type: new Abstract: Symbolic regression is the problem of finding an algebraic expression describing a stochastic dependence of a target variable on a set of inputs.
By Oussama Boussif, Mohammed Mahfoud, Younesse Kaddar, Moksh Jain, Sida Li, Damiano Fornasiere, Xiaoyin Chen, Yoshua Bengio, Esmeralda S. Whitammer
arXiv:2605. 23272v2 Announce Type: replace-cross Abstract: Symbolic Regression (SR) plays a central role in scientific knowledge discovery by distilling mathematical equations from observational data.
By Boxiao Wang, Kai Li, Zhiwei Chen, Yang Huang, Runxiang Wang, Ziwen Zhang, Yifan Zhang, Jian Cheng
The paper introduces a GPU-resident, batched Levenberg–Marquardt solver that efficiently optimizes constants in tree-based genetic programming for symbolic regression. By using reverse-mode automatic differentiation to assemble per-tree Jacobians in a single backward sweep, the solver’s per-iteration cost becomes independent of the number of constants per tree, achieving up to 510,000 trees per second on an NVIDIA A100. Integrated into EvoGP, the solver enables end-to-end search that recovers governing equations on 10 of 18 constructed problems, a significant improvement over stock EvoGP.
By Hao Mao, Xu Tony Liu, Shuai Lu, Peng Zhao, Wenzheng Jiang, Yuntian Chen