mlsanityData to 14 Oct 2026

Data-Driven Weak-form Discovery of Stochastic Systems

arXiv 2603.20904 ↗First posted 21 Mar 2026stat.ME math-ph math.DScited by 0

Not on the map. Why?

Abstract (arXiv)

We present an algorithm for learning the governing equations of a stochastic dynamical system from trajectory data. It recovers interpretable symbolic expressions for both the drift b(x) and the diffusion a(x) in a single pass, yielding a model that can be queried directly for relaxation timescales, metastable escape rates, and stationary distributions. Rather than estimating the dynamics one time step at a time, the algorithm averages each candidate term across the whole trajectory before regressing; a drift-informed correction further removes the finite-sampling bias in the diffusion estimate, cutting it from 4.6% to 0.6% for state-dependent noise. We also show that the trajectory averaging must use a spatial rather than a temporal weighting: temporal weighting, as in existing weak-form methods, is biased for stochastic data with an error that grows with dataset size. On three benchmark systems -- the Ornstein--Uhlenbeck process, a double-well Langevin system, and a multiplicative-noise system -- the algorithm recovers all coefficients to within 5%, stationary densities to within 0.01 in total variation, and escape rates that match the true dynamics.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 14 references that are in the map. First posted on arXiv 21 Mar 2026.

Builds on

4 of 14 references.

References · 4

  1. 2019Neural Stochastic Differential Equations: Deep Latent Gaussian Models in the Diffusion Limitcited by 176
  2. 2020SINDy-PI: A Robust Algorithm for Parallel Implicit Sparse Identification of Nonlinear Dynamicscited by 125
  3. 2019Data-driven approximation of the Koopman generator: Model reduction, system identification, and controlcited by 85
  4. 2017Sparse learning of stochastic dynamic equationscited by 76

Built on by

Not cited yet.