stat.MLSep 30, 2026

Inference for stochastic differential equations driven by weighted sub-fractional Brownian motion using neural networks and the Euler approximation

Authors: J. H. Ramirez-Gonzalez

Organizations: Institute of Mathematics and Statistics, University of São Paulo (IME–USP), São Paulo, Brazil

Abstract

We consider the estimation of drift, diffusion, and noise covariance from discrete observations of stochastic differential equations driven by Gaussian processes. For a fixed observation horizon T>0T>0 and a known initial state x0∈Rx_0\in\mathbb R, we study \begin{equation*} dX_t=a(X_t),dt+σ(X_t),dZ_t^{β,f}, \qquad X_0=x_0,\quad 0\leq t\leq T. \end{equation*} \smallskip\noindent Here a:R→Ra:\mathbb R\to\mathbb R is the drift coefficient, σ:R→(0,∞)σ:\mathbb R\to(0,\infty) is the diffusion coefficient, and Zβ,fZ^{β,f} is a centered Gaussian process from the weighted sub-fractional Brownian family, with covariance \begin{equation*} \operatorname{Cov}(Z_s^{β,f},Z_t^{β,f}) =\int_0^{s\wedge t} f(r)q_β(s-r,t-r),dr, \qquad 0\leq s,t\leq T. \end{equation*} \smallskip\noindent Here s∧t=min⁡{s,t}s\wedge t=\min\{s,t\}. The temporal weight f:[0,T]→[0,∞)f:[0,T]\to[0,\infty) is measurable, bounded, and positive almost everywhere, and β∈(0,2)β\in(0,2) is the covariance exponent. For u,v≥0u,v\geq0, the kernel is qβ(u,v)=[uβ+vβ−(u+v)β]/(1−β)q_β(u,v)=[u^β+v^β-(u+v)^β]/(1-β) when β≠1β\ne1. Its continuous extension at β=1β=1 is q1(u,v)=(u+v)log⁡(u+v)−ulog⁡u−vlog⁡vq_1(u,v)=(u+v)\log(u+v)-u\log u-v\log v, with 0log⁡0=00\log0=0. Using the Euler approximation, we reconstruct the Gaussian driving increments from observed transitions and use their joint density to obtain a trajectory likelihood. Neural and radial-basis representations model the drift, diffusion, and normalized temporal weight, while a likelihood profile estimates the covariance exponent and diffusion scale. We compare the method with two neural alternatives on the same simulated trajectories in twenty coefficient settings.

Figures & tables

Explore similar work

Jun 28, 2026math.OC

Fractional Stochastic Neural Networks

In this paper, we develop a fractional stochastic neural network with residual dynamics driven by fractional Brownian motion. By introducing a discrete stochastic maximum principle for the network, we construct the corresponding adjoint recursion. For deterministic network parameters, we prove mean square convergence of projected samplewise stochastic gradient descent. Numerical experiments include a closed form convergence test, noisy regression with uncertainty quantification, long memory time series generation and image classification under structured perturbations. The results identify settings in which fractional drivers improve long memory recovery or robustness relative to Brownian and deterministic baselines.
Jun 1, 2026stat.ML

Error Bounds for a Diffusion Model-Based Drift Estimator

Parameter estimation in stochastic differential equations is a classical statistical problem of much importance in many scientific fields. Recent work of Tapia Costa et al. (2026) introduced a novel technique for estimating the drift when the diffusion parameter is known, using discrete samples from multiple trajectories. Their method treats drift estimation as a denoising problem, and leverages tools from (conditional) score-matching diffusion models. Although their experiments showed promising results across different drift classes, the question of theoretical guarantees for their estimator was left unanswered. In this note, we address this gap by exploiting techniques from diffusion model theory. More concretely, we derive an explicit risk bound for the time-averaged mean-squared error of said drift estimator. Our bound decomposes the risk into the (i) Euler-Maruyama discretization, (ii) score/denoiser approximation, (iii) noise initialization, and (iv) sampling variance, revealing the trade-offs between the different hyperparameters and sources of error in the estimator.
Dec 2, 2020math.NA

Deep learning based numerical approximation algorithms for stochastic partial differential equations

In this article, we introduce a deep learning based approximation algorithm for SPDEs. Our approach employs neural networks to approximate the solutions of SPDEs along given realizations of the driving noise process. If applied to a set of simulated noise trajectories, it yields empirical distributions of SPDE solutions, from which functionals like the mean and variance can be estimated. We test the performance of the method on stochastic heat equations with additive and multiplicative noise as well as stochastic Black-Scholes equations with multiplicative noise and Zakai equations from nonlinear filtering theory. In all cases, the proposed algorithm yields accurate results with short runtimes in up to 100 space dimensions.