Applied artificial intelligence comparison for denoising symbolic regression signal: first systematic mapping of deterministic versus Bayesian approaches

Abstract One of the limitations of symbolic regression models lies in their vulnerability to noise in the training data, leading to inaccurate trend prediction. Although Bayesian methods are considered the default solution, there are currently few benchmarks for effectiveness depending on the noise level and complexity of the relationship within the dataset. In order to establish those benchmarks, this work compares a stochastic non-causal Kalman smoother (RTS) with a deterministic smoothing spline method with various Gaussian noise levels. The latter denoising method is explored for the first time in the context of SR literature. The methods are tested on the recovery of 10 benchmark equations of varying difficulty with a classifying symbolic regression genetic programming algorithm. The results show that the splines outperform the Kalman method in low noise, close-to-linear environments, while Kalman is better for higher noise levels, and neither method consistently succeeds in complex, non-linear settings.

Authors

Institutions

Publication Details

Journal
Soft Computing
Published
2026-11-04
DOI
https://doi.org/10.1007/s00500-026-11475-9
Primary Topic
Evolutionary Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Applied artificial intelligence comparison for denoising symbolic regression signal: first systematic mapping of deterministic versus Bayesian approaches

Milad Jasemi, Victoria Corcimaru
2 links
Soft Computing
Evolutionary Algorithms and Applications
article

Applied artificial intelligence comparison for denoising symbolic regression signal: first systematic mapping of deterministic versus Bayesian approaches

Milad Jasemi, Victoria Corcimaru
article en

Abstract

Abstract One of the limitations of symbolic regression models lies in their vulnerability to noise in the training data, leading to inaccurate trend prediction. Although Bayesian methods are considered the default solution, there are currently few benchmarks for effectiveness depending on the noise level and complexity of the relationship within the dataset. In order to establish those benchmarks, this work compares a stochastic non-causal Kalman smoother (RTS) with a deterministic smoothing spline method with various Gaussian noise levels. The latter denoising method is explored for the first time in the context of SR literature. The methods are tested on the recovery of 10 benchmark equations of varying difficulty with a classifying symbolic regression genetic programming algorithm. The results show that the splines outperform the Kalman method in low noise, close-to-linear environments, while Kalman is better for higher noise levels, and neither method consistently succeeds in complex, non-linear settings.

Soft Computing
University of Montevallo (US)
Openalex Percentile: Top 95%
Evolutionary Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon