Research Article

Smoothing Screening and Reweighted Sparse Discovery of Noisy Governing Equations

Authors

  • Nadia Ghasemabadi * Department of Computer Engineering and Information Technology, La.C., Islamic Azad University, Lahijan, Iran.
  • Setayesh Zahiri Morvarid Intelligent Industrial Systems Research Group, Iran.
  • Fatemeh Rasoulpour Department of Computer Engineering and Information Technology, La.C., Islamic Azad University, Lahijan, Iran.

https://doi.org/10.22105/scfa.v3i2.106

Abstract

Discovering governing equations from noisy trajectories depends on derivative estimation, library conditioning, and model selection. This manuscript proposes HERMES, a broader slow-fast and symbolic architecture, and evaluates a regression-side realization combining per-state Savitzky–Golay filtering, window selection, correlation screening, and reweighted thresholded least squares. The reported campaign uses Lotka–Volterra, unforced Duffing, and a three-species multiscale decay chain, with four noise levels and twenty realizations per system and level. At 5% noise the pooled reported exact-recovery rate is 0.667 versus 0.000 for the tested raw-finite-difference STLSQ and ensemble-lite baselines; coefficient relative error is 0.0551±0.0647 versus 0.4615±0.5710 for STLSQ. The chain has no reported exact recovery at any level. At 10% noise Duffing’s 0.900 rate corresponds to two failures among twenty realizations. The campaign does not test hidden-state recovery, neural slow-fast decomposition, evolutionary refinement, or a Pareto-front output. Aggregation units and statistical implementation require original records, and unequal derivative preprocessing limits attribution of the observed advantage to sparse-discovery methodology.

Keywords

Equation discovery Multiscale systems Symbolic regression Sparse identification Slow-fast dynamics Noise robustness
References (37)
  1. [1] Michaelis, L., & Menten, M. L. (1913). Die kinetik der invertinwirkung. Biochem. z, 49(333–369), 352. https://www.google.com/goto?url=CAESkwEBxCJF1wK-GOVfJ3ezRkPV2vcfbNziyq4F-1yzdwHUvDMVf9YvEA1zynTMVR4yzQnT4A71alHCWQyaEdC7xsKynoP9_c4h-ufe4iDkDNdDXVlV-BpbTB06qFdC_CO_igeVLB-ytytxObddbn_jrzXxdNab27g-dFkL3a5DOrDuOQNOXDu4VjyVcqATnZjgUBVkIdA

  2. [2] Bongard, J., & Lipson, H. (2007). Automated reverse engineering of nonlinear dynamical systems. Proceedings of the national academy of sciences, 104(24), 9943–9948. https://doi.org/10.1073/pnas.0609476104

  3. [3] Schmidt, M., & Lipson, H. (2009). Distilling free-form natural laws from experimental data. Science, 324(5923), 81–85. https://doi.org/10.1126/science.1165893

  4. [4] Brunton, S. L., Proctor, J. L., & Kutz, J. N. (2016). Discovering governing equations from data by sparse identification of nonlinear dynamical systems. Proceedings of the national academy of sciences, 113(15), 3932–3937. https://doi.org/10.1073/pnas.1517384113

  5. [5] Chen, R. T. Q., Rubanova, Y., Bettencourt, J., & Duvenaud, D. K. (2018). Neural ordinary differential equations. Advances in neural information processing systems, 31. https://proceedings.neurips.cc/paper_files/paper/2018/hash/69386f6bb1dfed68692a24c8686939b9-Abstract.html

Article Metrics

How to Cite

Ghasemabadi, N. ., Zahiri, S. ., & Rasoulpour, F. . (2026). Smoothing Screening and Reweighted Sparse Discovery of Noisy Governing Equations. Soft Computing Fusion With Applications , 3(2), 139-152. https://doi.org/10.22105/scfa.v3i2.106

Similar Articles

1-10 of 58

You may also start an advanced similarity search for this article.