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.
Abstract
Discovering governing equations directly from observational data remains a fundamental challenge in science and engineering, particularly when measurements are noisy, high-dimensional, or multi-scale. Existing approaches often cast equation discovery as a regression problem that selects candidate terms to fit observed trajectories, which can limit structural stability and identifiability under realistic data conditions. We propose a structured operator-learning framework that reformulates equation discovery as a constrained dynamical inference problem integrating spectral decomposition, physics-guided sparse projection, and cross-view consistency regularization within a unified architecture. By decomposing dynamics into scale-resolved components and enforcing invariance across perturbed observations, the framework promotes stable and interpretable equation recovery. Here, we show 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. Here, the authors propose structured operator learning with spectral decomposition, sparse regression, and cross-view regularization to recover stable, interpretable governing equations under noisy, high-dimensional, and distribution-shifted data.
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 underutil...
Weizhen Li, Qiang Fu, Yifan Hong et al.· Scientific Reports· 0 citations
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...
Rishav Jha, Kameshwar Sahani, S. K. Sahani et al.· African Multidisciplinary Jo...· 0 citations
A factorized latent-conditioning formulation is introduced that jointly learns a neural operator and a low-dimensional latent representation through factorized prediction, trajectory-decoupled sampling, and dimension selection that enables generalization to previously unseen system instances.
Zi-Tuo Chen, Qiaofeng Li, Jia-Xin Hu et al.· arXiv.org· 1 citation
FLARE is a forced latent autoencoder for response equations that learns compact response coordinates, identifies sparse input-dependent latent dynamics and decodes equation rollouts to full responses, and predicts long-horizon high-dimensional responses under inputs not used for training.
Yi Zhu, Su Chen, Xiao-Jun Li et al.· arXiv.org· 0 citations
This work presents a population-level inference framework that recovers latent stochastic dynamics directly from snapshot probability distributions by decomposing the observed evolution into an intrinsic latent stochastic process and a discrepancy transport map that captures geometric deformation between the latent and...
Cheng-Yang Huang, K. Garikipati· arXiv.org· 0 citations
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.
N. Boddupalli, J. Moehlis· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.