Discovery of Nonlinear Dynamics with Automated Basis Function Generation

• URL: http://arxiv.org/abs/2605.09696v1
• Date: Sun, 10 May 2026 18:30:17 GMT
• Title: Discovery of Nonlinear Dynamics with Automated Basis Function Generation
• Abstract summary: AutoSINDy is a hybrid Discovery-then- curation framework.<n>It combines the exploratory power of symbolic regression with the robust sparsity-promoting capabilities of SINDy.<n>It consistently recovers ground-truth equations even under high observational noise.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Discovering governing equations from observational data remains a fundamental challenge in scientific modeling, particularly when the underlying mathematical structure is unknown. Traditional sparse identification methods like SINDy excel at discovering parsimonious models but require researchers to specify candidate basis functions a priori, a limitation that often leads to model failure when critical terms are omitted or when systems exhibit unconventional dynamics. Purely symbolic regression approaches offer unlimited flexibility but struggle with noise sensitivity and frequently produce overly complex, unstable equations. We present AutoSINDy, a hybrid Discovery-then-Solve framework that combines the exploratory power of symbolic regression with the robust sparsity-promoting capabilities of SINDy. Our method operates in three stages: (1) PySR-based symbolic regression discovers candidate functional forms from bootstrapped data chunks; (2) a curation pipeline decomposes, expands, and filters these expressions using collinearity analysis to construct a minimal yet comprehensive library; and (3) SINDy identifies sparse governing equations from this custom-tailored library. Extensive experiments across canonical nonlinear systems demonstrate that AutoSINDy consistently recovers ground-truth equations even under high observational noise, achieving a ground-truth recovery rate of 92.8% across all trials. Compared with standard SINDy using enriched libraries and standalone symbolic regression, AutoSINDy achieves higher predictive accuracy, superior generalization to unseen trajectories, and substantially lower symbolic complexity.

Related papers

• How Low Can You Go? Active Learning for Sparse Model Discovery in the Ultra-Low-Data Limit [2.9937025170705582]
  This work introduces an active learning strategy for dynamics discovery in the ultra-low data limit.<n>Rather than sampling randomly, our method prioritizes regions that are most informative for model identification.<n>Across all scenarios, the proposed method accurately identifies the governing dynamics with significantly fewer data samples than random sampling.
  arXiv  Detail & Related papers  (2026-06-10T15:06:59Z)
• Influence-Guided Symbolic Regression: Scientific Discovery via LLM-Driven Equation Search with Granular Feedback [56.69850045068714]
  We introduce textitInfluence-Guided Regression (IGSR), a method that frames equation discovery as an iterative two-step process.<n>We demonstrate IGSRs effectiveness on a diverse suite of benchmarks, including LLM-SRBench, pharmacological PKPD models, an epidemiological simulation, and real-world genomic data.
  arXiv  Detail & Related papers  (2026-05-27T23:48:01Z)
• A neural operator framework for data-driven discovery of stability and receptivity in physical systems [29.64126196034103]
  We introduce a data-driven framework that automatically identifies stability properties and optimal forcing responses from observation data alone.<n>We demonstrate the method on both canonical chaotic models and high-dimensional fluid flows.<n>This equation-free methodology establishes a broadly applicable tool for analyzing complex, high-dimensional datasets.
  arXiv  Detail & Related papers  (2026-04-21T13:43:32Z)
• Automated Discovery of Conservation Laws via Hybrid Neural ODE-Transformers [0.0]
  We propose a hybrid framework to automate the discovery of conserved quantities from noisy trajectory data.<n>Our approach integrates three components: (1) a Neural Ordinary Differential Equation that learns a continuous model of the system's dynamics, (2) a Transformer that generates symbolic candidate invariants conditioned on the learned vector field, and (3) a symbolic-numeric verifier that provides a strong numerical certificate for the validity of these candidates.
  arXiv  Detail & Related papers  (2025-10-30T17:32:04Z)
• Data-Efficient Symbolic Regression via Foundation Model Distillation [34.0701397977874]
  EQUATE is a framework that adapts foundation models for symbolic equation discovery in low-data regimes via distillation.<n>It consistently outperforms state-of-the-art baselines in both accuracy and robustness.<n>These results highlight EQUATE as a practical and generalizable solution for data-efficient symbolic regression.
  arXiv  Detail & Related papers  (2025-08-27T00:18:48Z)
• Impilict Runge-Kutta based sparse identification of governing equations in biologically motivated systems [0.0]
  This study presents a novel data-driven framework by integrating high order implicit Runge-Kutta methods (IRKs) with the sparse identification, termed IRK-SINDy.<n>Results indicate that IRK-SINDy outperforms conventional SINDy and the RK4-SINDy framework, particularly under conditions of extreme data scarcity and noise.
  arXiv  Detail & Related papers  (2025-02-27T17:44:37Z)
• No Equations Needed: Learning System Dynamics Without Relying on Closed-Form ODEs [56.78271181959529]
  This paper proposes a conceptual shift to modeling low-dimensional dynamical systems by departing from the traditional two-step modeling process.<n>Instead of first discovering a closed-form equation and then analyzing it, our approach, direct semantic modeling, predicts the semantic representation of the dynamical system.<n>Our approach not only simplifies the modeling pipeline but also enhances the transparency and flexibility of the resulting models.
  arXiv  Detail & Related papers  (2025-01-30T18:36:48Z)
• Discovering physical laws with parallel symbolic enumeration [67.36739393470869]
  We introduce parallel symbolic enumeration (PSE) to efficiently distill generic mathematical expressions from limited data.<n>Experiments show that PSE achieves higher accuracy and faster computation compared to the state-of-the-art baseline algorithms.<n> PSE represents an advance in accurate and efficient data-driven discovery of symbolic, interpretable models.
  arXiv  Detail & Related papers  (2024-07-05T10:41:15Z)
• Deep Generative Symbolic Regression [83.04219479605801]
  Symbolic regression aims to discover concise closed-form mathematical equations from data. Existing methods, ranging from search to reinforcement learning, fail to scale with the number of input variables. We propose an instantiation of our framework, Deep Generative Symbolic Regression.
  arXiv  Detail & Related papers  (2023-12-30T17:05:31Z)
• Discovering Interpretable Physical Models using Symbolic Regression and Discrete Exterior Calculus [55.2480439325792]
  We propose a framework that combines Symbolic Regression (SR) and Discrete Exterior Calculus (DEC) for the automated discovery of physical models. DEC provides building blocks for the discrete analogue of field theories, which are beyond the state-of-the-art applications of SR to physical problems. We prove the effectiveness of our methodology by re-discovering three models of Continuum Physics from synthetic experimental data.
  arXiv  Detail & Related papers  (2023-10-10T13:23:05Z)
• A Priori Denoising Strategies for Sparse Identification of Nonlinear Dynamical Systems: A Comparative Study [68.8204255655161]
  We investigate and compare the performance of several local and global smoothing techniques to a priori denoise the state measurements. We show that, in general, global methods, which use the entire measurement data set, outperform local methods, which employ a neighboring data subset around a local point.
  arXiv  Detail & Related papers  (2022-01-29T23:31:25Z)
• Multiplicative noise and heavy tails in stochastic optimization [62.993432503309485]
  empirical optimization is central to modern machine learning, but its role in its success is still unclear. We show that it commonly arises in parameters of discrete multiplicative noise due to variance. A detailed analysis is conducted in which we describe on key factors, including recent step size, and data, all exhibit similar results on state-of-the-art neural network models.
  arXiv  Detail & Related papers  (2020-06-11T09:58:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.