Goal-oriented learning of stochastic differential equations using error bounds on path-space observables
Not on the map. Why?
Abstract (arXiv)
Stochastic differential equations (SDEs), which serve as the governing equations for dynamical systems in a broad range of applications, can become cost-prohibitive for numerical simulation at scales necessary for quantifying key properties. Surrogate models of the drift function of an SDE, learned from data of the high-fidelity system, are routinely used to increase the efficiency of simulation and prediction of properties. However, standard choices of loss function for learning the surrogate model fail to provide error guarantees in certain path-dependent observables, such as transition times. This paper introduces an error bound for path-space observables and employs it as a novel variational loss for the goal-oriented learning of the drift function of a SDE. We show the error bound holds for a broad class of observables, including mean first hitting times on unbounded time domains. We derive an analytical gradient of the goal-oriented loss by leveraging the formula for Fr'echet derivatives of expected path functionals, which remains tractable for implementation in stochastic gradient descent schemes. We demonstrate that surrogate models of overdamped Langevin systems developed via goal-oriented learning achieve improved accuracy in predicting the statistics of a first hitting time observable and robustness to distributional shift in the data.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 48 references that are in the map. First posted on arXiv 20 Mar 2026.
Builds on
11 of 48 references.
References · 11
- 2021E(3)-Equivariant Graph Neural Networks for Data-Efficient and Accurate Interatomic Potentialscited by 708
- 2021Maximum Likelihood Training of Score-Based Diffusion Modelscited by 672
- 2019Monte Carlo Gradient Estimation in Machine Learningcited by 283
- 2022Learning Local Equivariant Representations for Large-Scale Atomistic Dynamicscited by 256
- 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 227
- 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 208
- 2018Tighter Variational Bounds are Not Necessarily Bettercited by 76
- 2021Optimal Transport for Parameter Identification of Chaotic Dynamics via Invariant Measurescited by 10
- 2021Scalable conditional deep inverse Rosenblatt transports using tensor-trains and gradient-based dimension reductioncited by 9
- 2021Error Bounds of the Invariant Statistics in Machine Learning of Ergodic Ito Diffusionscited by 5
- 2024Invariant Measures in Time-Delay Coordinates for Unique Dynamical System Identificationcited by 5
Built on by
Not cited yet.