2025/02/04 by Grigory Bartosh, Dmitry Vetrov, Bartosh, Grigory +3 · 2 voices · 8 citations
Computer Science · Mathematics · #Applied mathematics #Bayesian Modeling and Causal Inference #Computer science #Gaussian Processes and Bayesian Inference #Machine Learning and Data Classification #Matching (statistics) #Mathematical optimization #Mathematics #Physics #Scalability #Statistics #Stochastic differential equation #Training (meteorology)
paper · pdf · open access · doi:10.48550/arxiv.2502.02472
published in UvA-DARE (University of Amsterdam) (University of Amsterdam)
openalex publication_date 2025/02/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Latent Stochastic Differential Equation (SDE) is a powerful tool for time series and sequence modeling. However, training Latent SDEs typically relies on adjoint sensitivity methods, which depend on simulation and backpropagation through approximate SDE solutions, which limit scalability. In this work, we propose SDE Matching, a new simulation-free method for training Latent SDEs. Inspired by modern Score- and Flow Matching algorithms for learning generative dynamics, we extend these ideas to the domain of stochastic dynamics for time series and sequence modeling, eliminating the need for costly numerical simulations. Our results demonstrate that SDE Matching achieves performance comparable to adjoint sensitivity methods while drastically reducing computational complexity.