A scalable and understandable neural-symbolic framework that treats neural networks as functional preconditioners for symbolic discovery, creating a solid link between neural approximation and the discovery of sparse equations for scientific machine learning.
Abstract
Symbolic Regression (SR) seeks to find succinct mathematical expressions that represent the fundamental relationships within data, providing interpretability and scientific understanding that exceeds that of black-box models. Nevertheless, traditional methods like Genetic Programming face challenges with scalability and are highly sensitive to noise, while sparse regression techniques such as SINDy rely significantly on predetermined feature libraries. In this work, we present a Neural Symbolic Regression (NSR) framework that treats neural networks as functional preconditioners for symbolic discovery. Our approach uses a decoupled pipeline: a neural network first learns a smooth, noise-robust approximation of the target function in an interaction- aware nonlinear feature space. LASSO is then applied to extract sparse, interpretable closed-form expressions. To improve predictive accuracy and symbolic fidelity by integrating distributed hyperparameter optimization with Ray Tune and ASHA scheduling. Experiments on the Nguyen benchmark suite show that our approach consistently outperforms SINDy and non-tuned neural baselines in RMSE, noise robustness, and out-of-distribution generalization. Ablation studies confirm the significance of feature interactions, neural depth, and tuning strategies. In general, this study presents a scalable and understandable neural-symbolic framework, creating a solid link between neural approximation and the discovery of sparse equations for scientific machine learning.
Symbolic regression (SR) discovers closed-form mathematical expressions from data, offering interpretability beyond black-box models. Existing methods suffer from slow convergence in combinatorial search spaces and lack mechanisms to exploit compositional structure in the data. We introduce SMILE (Sine, Multiplication,...
Mansooreh Montazerin, Antonio Ortega, Ajitesh Srivastava· 0 citations
DGP proposes a differentiable symbolic tree that relaxes the discrete structure of GP trees to a continuous representation, thus allowing for efficient gradient based optimization, and designs a sampling strategy that ensures structural validity and introduces a di versification mechanism to escape local optima and enh...
Xiao-Tian Song, Peng Zeng, Andrew Lensen et al.· IEEE Transactions on Pattern...· 0 citations
A neural surrogate with analytic derivatives is used to detect separability, recursively reducing multivariate problems to simpler neural atoms, and provides a practical route from neural surrogates to interpretable closed-form empirical laws.
Rodrigo Ibata, Wassim Tenachi, F. Diakogiannis et al.· 0 citations
DENSE is an ensemble of multi layer perceptrons (MLPs) that is trained to minimize a modified Cram´er–von Mises distance in the joint space of inputs and outputs that enables non-parametric representations of arbitrary densities without (complex) likelihood design.
Leon Winheim, Hayk Amirkhanian, MarkusWalker et al.· 0 citations
TabNSM provides an effective and scalable approach to deep tabular regression, and demonstrates that selective interaction modeling, structured regression supervision, and difficulty-aware sampling provide an effective and scalable approach to deep tabular regression.
This paper combines symbolic regression with LLMs for feature engineering (SymboLLM-FE) to solve the dual challenges of poor interpretability and numerous iterations by employing a statistical prior-grounded LLM refinement mechanism and single-digit LLM calls.
Zi-Jian Cheng, Zi-Yi Jia, Zhi Zhou et al.· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 14, 2026
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.