arXiv Machine Learning

SMILE: Bridging Continuous Optimization and Discrete Symbolic Recovery

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.

arXiv Machine Learning
Sep 2

Neural Symbollic Regression Using Deep Learning and Sparse Modelling

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 Machine Learning
Sep 21

MOSAIC-SR: Transformer-Guided Symbolic Regression for Scientific Equation Recovery

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.

By Peiyi Zheng, Yanming Kang, Hans De Sterck, Giang Tran
arXiv Machine Learning
Aug 27

InsightSR: Refining Symbolic Regression Search Spaces via Parallel Semantic and Structural LLM Guidance

InsightSR is a new framework that integrates Large Language Models (LLMs) with the PySR genetic programming engine to refine symbolic regression search spaces. It employs two LLM-guided pathways: a Semantic Seed Pathway that generates dimensionally consistent functional skeletons, and a Structural Feature Pathway that suggests nonlinear feature transformations. Over successive iterations, these pathways expand the input space and shift the search toward shallow, semantically informed trees, with a feedback loop that evaluates and refines candidate features. The method achieves a 95% exact recovery rate on the Feynman benchmark and 80.18% accuracy on the LLM-SRBench LSR-Transform task, outperforming existing genetic programming and neural-symbolic approaches while preserving strong out-of-distribution generalization.

By Yating Ling, Wenjing Cun, Zhitang Chen
arXiv Machine Learning
Oct 15

Exhaustive Canonical Skeletons Generation: A Formal Dataset for Decomposable Symbolic Regression

The paper introduces an exhaustive dataset of univariate canonical skeletons for neural symbolic regression, generated deterministically via a constrained context-free grammar. These skeletons serve as generic structural representations that eliminate redundant expressions and provide uniform operator distribution, thereby avoiding simplicity bias. The authors also present a sampling strategy for clean numerical data and benchmark 150 SR problems across three tiers, demonstrating challenges for current state‑of‑the‑art methods.

By Giorgio Morales, Anik\'o Ek\'art
arXiv Machine Learning
5d ago

DIGEST: Discovery-Guided LLM Tuning for Symbolic Regression

DIGEST is a new method for symbolic regression that combines a lightweight LLM with Genetic Programming. It uses a pretrained decoder block as a symbolic policy to seed GP populations, providing flexible generation of candidate expressions. The approach also feeds high‑quality GP discoveries back into the LLM to refine future generations, leading to improved recovery rates and faster search times on benchmark datasets.

By Kaifeng Jin, Ruizhong Qiu, Zihao Li, Xiao Lin, Dongqi Fu, Yinglong Xia, Hong Li, Hanghang Tong
arXiv Machine Learning
Aug 31

Probabilistic Symbolic Regression for Equation Discovery via Operator-induced and Regularized Symbolic Forests

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