Not Every Term Adds New Structure: Sobolev Novelty for Symbolic Regression
cs.LG, cs.AI
Submitted: 2026-09-26
Updated: 2026-09-26
Comments: Code is available at https://github.com/CAS-CLab/Sobolev-Novelty
License: http://creativecommons.org/licenses/by/4.0/
The gist: Symbolic regression (SR) aims to discover compact and meaningful mathematical equations from data, but searching the vast combinatorial space of symbolic structures remains challenging.
Terminology
Abstract
Symbolic regression (SR) aims to discover compact and meaningful mathematical equations from data, but searching the vast combinatorial space of symbolic structures remains challenging. Existing methods typically guide this process using expression-level objectives, such as fitting error, which assess a candidate equation as a whole but provide little information about whether an individual term contributes genuinely new structure or is largely redundant with the rest of the expression. We introduce Sobolev Novelty, a term-level measure of structural independence for symbolic equations. For each term, we construct an empirical Sobolev signature from its function values and exact derivatives over the observed inputs, and quantify how much of this behavior cannot be reconstructed by the remaining terms. We further derive a theory-calibrated threshold, yielding a principled and tuning-free criterion for identifying structurally novel terms. Using this threshold, 92.6% of terms in benchmark ground-truth equations exhibit sufficient structural novelty, compared with only 38.3% on average for expressions produced by 15 SR methods, revealing a substantial gap between scientific equations and current SR solutions. As a lightweight plug-in, Sobolev Novelty can be incorporated into diverse SR paradigms to support term pruning, search guidance, LLM feedback, and data selection, yielding consistent performance gains and demonstrating broad applicability.
Sources
- Interpretable Machine Learning for Science with PySR and SymbolicRegression.jl
- Bayesian Symbolic Regression
- Learning concise representations for regression by evolving networks of trees
- Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradients
- Influence-Guided Symbolic Regression: Scientific Discovery via LLM-Driven Equation Search with Granular Feedback
- Symbolic Physics Learner: Discovering governing equations via Monte Carlo tree search
- RSRM: Reinforcement Symbolic Regression Machine
- Beyond Accuracy and Complexity: The Effective Information Criterion for Structurally Stable Symbolic Regression
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks