Related papers: Error estimates for tamed Euler and Randomized Eul…

Although generative diffusion models (GDMs) are widely used in practice, their theoretical foundations remain limited, especially concerning the impact of different discretization schemes applied to the underlying stochastic differential…

This paper studies the weak convergence order of the stochastic theta method for stochastic differential equations (SDEs) driven by time-changed L\'{e}vy noise under global Lipschitz and linear growth conditions. In contrast to classical…

The approximation of invariant measures for nonlinear ergodic stochastic differential equations (SDEs) is a central problem in scientific computing, with important applications in stochastic sampling, physics, and ecology. We first propose…

Existing fundamental theorems for mean-square convergence of numerical methods for stochastic differential equations (SDEs) require globally or one-sided Lipschitz continuous coefficients, while strong convergence results under merely local…

Recently, Martin Hutzenthaler pointed out that the explicit Euler method fails to converge strongly to the exact solution of a stochastic differential equation (SDE) with superlinearly growing and globally one sided Lipschitz drift…

An implicit Euler--Maruyama method with non-uniform step-size applied to a class of stochastic partial differential equations is studied. A spectral method is used for the spatial discretization and the truncation of the Wiener process. A…

We propose two Euler-Maruyama (EM) type numerical schemes in order to approximate the invariant measure of a stochastic differential equation (SDE) driven by an $\alpha$-stable L\'evy process ($1<\alpha<2$): an approximation scheme with the…

We analyse a Monte Carlo particle method for the simulation of the calibrated Heston-type local stochastic volatility (H-LSV) model. The common application of a kernel estimator for a conditional expectation in the calibration condition…

This manuscript is dedicated to the numerical approximation of super-linear slow-fast stochastic differential equations (SFSDEs). Borrowing the heterogeneous multiscale idea, we propose an explicit multiscale Euler-Maruyama scheme suitable…

We introduce a new Langevin dynamics based algorithm, called e-TH$\varepsilon$O POULA, to solve optimization problems with discontinuous stochastic gradients which naturally appear in real-world applications such as quantile estimation,…

We study the strong rate of convergence of the Euler--Maruyama scheme for a multidimensional stochastic differential equation (SDE) $$ dX_t = b(X_t) \, dt + dL_t, $$ with irregular $\beta$-H\"older drift, $\beta > 0$, driven by a L\'evy…

We consider the problem of sampling from a target distribution, which is \emph {not necessarily logconcave}, in the context of empirical risk minimization and stochastic optimization as presented in Raginsky et al. (2017). Non-asymptotic…

We revisit the problem of sampling from a target distribution that has a smooth strongly log-concave density everywhere in $\mathbb R^p$. In this context, if no additional density information is available, the randomized midpoint…

Randomized smoothing is a widely adopted technique for optimizing nonsmooth objective functions. However, its efficiency analysis typically relies on global Lipschitz continuity, a condition rarely met in practical applications. To address…

We consider the long-time behavior of an explicit tamed exponential Euler scheme applied to a class of parabolic semilinear stochastic partial differential equations driven by additive noise, under a one-sided Lipschitz continuity…

This work presents a randomized-tamed Milstein scheme for stochastic differential equations whose drift coefficient exhibits superlinear growth in the state variable and limited temporal regularity, quantified by $\beta$-H\"older continuity…

Obtaining stable diffusion-based samplers in high- and infinite-dimensional settings is challenging because errors can accumulate across high-frequency coordinates and make the dynamics unstable under refinement of the finite-dimensional…

We propose a new algorithm---Stochastic Proximal Langevin Algorithm (SPLA)---for sampling from a log concave distribution. Our method is a generalization of the Langevin algorithm to potentials expressed as the sum of one stochastic smooth…

Langevin algorithms are gradient descent methods augmented with additive noise, and are widely used in Markov Chain Monte Carlo (MCMC) sampling, optimization, and machine learning. In recent years, the non-asymptotic analysis of Langevin…

We establish a sharp uniform-in-time error estimate for the Stochastic Gradient Langevin Dynamics (SGLD), which is a widely-used sampling algorithm. Under mild assumptions, we obtain a uniform-in-time $O(\eta^2)$ bound for the KL-divergence…