Related papers: Randomized Milstein algorithm for approximation of…
We propose a straightforward and effective method for discretizing multi-dimensional diffusion processes as an extension of Milstein scheme. The new scheme is explicitly given and can be simulated using Gaussian variates, requiring the same…
We introduce multilevel Picard (MLP) approximations for McKean--Vlasov stochastic differential equations (SDEs) with nonconstant diffusion coefficient. Under standard Lipschitz assumptions on the coefficients, we show that the MLP algorithm…
Literature is full of inference techniques developed to estimate the parameters of stochastic dynamical systems driven by the well-known Brownian noise. Such diffusion models are often inappropriate models to properly describe the dynamics…
Overdamped Langevin dynamics are reversible stochastic differential equations which are commonly used to sample probability measures in high-dimensional spaces, such as the ones appearing in computational statistical physics and Bayesian…
Various bias-correction methods such as EXTRA, gradient tracking methods, and exact diffusion have been proposed recently to solve distributed {\em deterministic} optimization problems. These methods employ constant step-sizes and converge…
In the study of McKean-Vlasov stochastic differential equations (MV-SDEs), numerical approximation plays a crucial role in understanding the behavior of interacting particle systems (IPS). Classical Milstein schemes provide strong…
This paper proves joint convergence of the approximation error for several stochastic integrals with respect to local Brownian semimartingales, for nonequidistant and random grids. The conditions needed for convergence are that the Lebesgue…
Inspired by the stochastic particle method, this paper establishes an easily implementable explicit numerical method for McKean-Vlasov stochastic differential equations (MV-SDEs) with superlinear growth coefficients. The paper establishes…
We revisit the classical problem of estimating an unknown distribution from its samples by fitting a mixture model that minimizes cross-entropy loss. Framing the task as a stochastic convex optimization problem over the space of $ M…
This paper studies sampling error bounds for denoising diffusion probabilistic models (DDPMs) in the 2-Wasserstein distance. Our contributions are threefold. (i) Under general Lipschitz-type conditions on the score function and for a broad…
Distributed stochastic optimization algorithms can simultaneously process large-scale datasets, significantly accelerating model training. However, their effectiveness is often hindered by the sparsity of distributed networks and data…
Gradient flow in the 2-Wasserstein space is widely used to optimize functionals over probability distributions and is typically implemented using an interacting particle system with $n$ particles. Analyzing these algorithms requires showing…
In a high-frequency context, we investigate the efficient estimation of scaling and jump activity parameters for a stochastic differential equation driven by a L{\'e}vy process with both diffusion component and pure-jump component. We first…
We present a Milstein-type scheme for stochastic differential equations driven by L\'evy noise with super-linear diffusion coefficients and establish its strong convergence.
In this paper, we propose a new threshold-kernel jump-detection method for jump-diffusion processes, which iteratively applies thresholding and kernel methods in an approximately optimal way to achieve improved finite-sample performance. We…
We study distributed optimization problems over a network when the communication between the nodes is constrained, and so information that is exchanged between the nodes must be quantized. This imperfect communication poses a fundamental…
The problem of drift estimation for the solution $X$ of a stochastic differential equation with L\'evy-type jumps is considered under discrete high-frequency observations with a growing observation window. An efficient and asymptotically…
We investigate the convergence of hitting times for jump-diffusion processes. Specifically, we study a sequence of stochastic differential equations with jumps. Under reasonable assumptions, we establish the convergence of solutions to the…
We provide necessary and sufficient first order geometric conditions for the stochastic invariance of a closed subset of R^d with respect to a jump-diffusion under weak regularity assumptions on the coefficients. Our main result extends the…
Diffusion approximation provides weak approximation for stochastic gradient descent algorithms in a finite time horizon. In this paper, we introduce new tools motivated by the backward error analysis of numerical stochastic differential…