Comparison of continuous and discrete-time data-based modeling for hypoelliptic systems

Abstract

We compare two approaches to the predictive modeling of dynamical systems from partial observations at discrete times. The first is continuous in time, where one uses data to infer a model in the form of stochastic differential equations, which are then discretized for numerical solution. The second is discrete in time, where one directly infers a discrete-time model in the form of a nonlinear autoregression moving average model. The comparison is performed in a special case where the observations are known to have been obtained from a hypoelliptic stochastic differential equation. We show that the discrete-time approach has better predictive skills, especially when the data are relatively sparse in time. We discuss open questions as well as the broader significance of the results.

25 pages

References in corpus (2)

• Data-driven non-Markovian closure models
• A discrete approach to stochastic parametrization and dimensional reduction in nonlinear dynamics

Cited by in corpus (10)

• Data-driven model reduction, Wiener projections, and the Koopman-Mori-Zwanzig formalism
• Machine Learning for Prediction with Missing Dynamics
• Data-driven molecular modeling with the generalized Langevin equation
• Maximally predictive states: from partial observations to long timescales
• Machine Learning-Based Statistical Closure Models for Turbulent Dynamical Systems
• Data-driven model reduction for stochastic Burgers equations
• Simulation of elliptic and hypo-elliptic conditional diffusions
• Modeling of Missing Dynamical Systems: Deriving Parametric Models using a Nonparametric Framework
• Statistical Inference of 1D Persistent Nonlinear Time Series and Application to Predictions
• Shock trace prediction by reduced models for a viscous stochastic Burgers equation