The data-driven discovery of governing equations for dynamical systems has emerged as a transformative paradigm, enabling the extraction of interpretable and generalizable models from observational data. While modern techniques have advanced this field, traditional subset regression remains a foundational yet underutilized tool due to its reliance on uncorrelated residuals, a requirement often violated by time-series data. In this work, we revisit subset regression to identify dynamical systems governed by ordinary differential equations (ODEs), partial differential equations (PDEs), and differential algebraic equations (DAEs). We propose subset regression with known number of active features (sub-KNAFE), a user-determined sparsity mechanism that flexibly adapts to various complex nonlinear systems, while retaining the computational efficiency and inherent interpretability of traditional subset regression. We integrate sub-KNAFE with the SINDy framework, overcoming the limitation of subset regression in dynamical system identification. Numerical tests across a range of signal-to-noise ratios and dataset sizes demonstrate sub-KNAFE's superior noise robustness and data efficiency. Practical utility for sub-KNAFE is validated on two real-world datasets: the classic Lynx-Hare ecological population data and the ISO New England power system dataset, demonstrating its strong potential for practical deployment in scientific discovery and engineering applications.
Identifying stochastic dynamical systems from observational data remains a major challenge in applied mathematics and engineering, particularly when complex systems are influenced by random perturbations and incomplete empirical information. This comprehensive review aims to examine state-of-the-art data-driven methods for discovering governing equations, estimating parameters, and predicting the behavior of stochastic dynamical systems. The review systematically analyzes key methodological approaches, including Sparse Identification of Nonlinear Dynamics (SINDy), Dynamic Mode Decomposition (DMD) and its extensions, Koopman operator theory, neural ordinary differential equations, and Bayesian inference. Each approach is evaluated in terms of its theoretical foundations, computational requirements, robustness to noise, and applicability to different classes of stochastic systems. Drawing on numerical experiments and real-world case studies, the findings show that no single method consistently outperforms others across all scenarios. Instead, hybrid approaches that integrate physics-informed constraints with machine learning demonstrate the strongest potential for advancing data-driven system identification. The review concludes that future research should address real-time identification, uncertainty quantification, and the integration of multi-fidelity data sources to improve the reliability and scalability of stochastic system modeling. This work contributes a comprehensive framework for guiding researchers and practitioners in selecting and implementing appropriate identification methods for stochastic dynamical systems.
Rishav Jha, Kameshwar Sahani, S. K. Sahani et al.· African Multidisciplinary Jo...· 0 citations
An interpretable identification framework based on universal neural ordinary differential equations (UNODEs), symbolic regression, and parameter refinement is developed that is competitive on autonomous polynomial systems and more effective in recovering compact symbolic structures for non-polynomial and explicitly time-varying dynamics.
Qing-Tong Dong· Engineering Research Express· 0 citations
It is shown that the method consistently identifies compact governing equations while maintaining strong long-horizon predictive accuracy across canonical nonlinear systems and representative industrial processes, even under noisy and distribution-shifted data.
Multi-step training of sparse, interpretable models of dynamical systems directly from time-series data yields models with accurate short-term dynamics and strong agreement in long-time statistical properties, including mean, variance, and Lyapunov exponents.
We study the reconstruction of an unknown dynamical system from a single noisy scalar time series. The goal is to recover the underlying dynamics for forecasting. We introduce a method that uses differential embedding coordinates to identify a rational closure of the embedding dynamics directly from data. The closure is identified through a weak-form regression pipeline, which avoids unstable pointwise differentiation of noisy data. When applied to noise-free Lorenz and R\"ossler systems, the method recovers closures that support long forecasts across a broad ensemble of realizations ($18.1$ and $7.1$ Lyapunov times respectively). Under $15$--$30\%$ additive Gaussian noise, performance becomes system-dependent. For the Lorenz system, forecast horizons remain short even in the best cases, whereas the R\"ossler system generally performs better in absolute terms, though not once normalized by the Lyapunov time. Our proposed method recovers directly interpretable closure coefficients which we compared against the known analytic closures of the Lorenz and R\"ossler systems.
This work presents a modular framework for discovering piecewise-smooth dynamical systems by first estimating switching hyperplanes from data and then learning smooth dynamics within each region using geometry-constrained neural networks.
D. Murari, Erik Jansson, Chris Budd Obe et al.· 0 citations