Nonparametric learning of stochastic differential equations from sparse and noisy data
Arnab Ganguly, Riten Mitra, Jinpu Zhou

TL;DR
This paper introduces a nonparametric framework for learning stochastic differential equations directly from sparse, noisy data using kernel methods and an EM algorithm with SMC, enabling accurate drift estimation without strong assumptions.
Contribution
It develops a novel nonparametric approach for SDE drift estimation from limited data, combining RKHS, EM, and SMC techniques with theoretical convergence guarantees.
Findings
Effective in low-data regimes for drift estimation
Handles sparse, noisy observations with intractable likelihoods
Demonstrates superior performance in numerical experiments
Abstract
The paper proposes a systematic framework for building data-driven stochastic differential equation (SDE) models from sparse, noisy observations. Unlike traditional parametric approaches, which assume a known functional form for the drift, our goal here is to learn the entire drift function directly from data without strong structural assumptions, making it especially relevant in scientific disciplines where system dynamics are partially understood or highly complex. We cast the estimation problem as minimization of the penalized negative log-likelihood functional over a reproducing kernel Hilbert space (RKHS). In the sparse observation regime, the presence of unobserved trajectory segments makes the SDE likelihood intractable. To address this, we develop an Expectation-Maximization (EM) algorithm that employs a novel Sequential Monte Carlo (SMC) method to approximate the filtering…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
