Related papers: Error distributions for random grid approximations…
Distributed optimization plays an important role in modern large-scale machine learning and data processing systems by optimizing the utilization of computational resources. One of the classical and popular approaches is Local Stochastic…
We study strong approximation of scalar additive noise driven stochastic differential equations (SDEs) at time point $1$ in the case that the drift coefficient is bounded and has Sobolev regularity $s\in(0,1)$. Recently, it has been shown…
We present a method for approximating solutions of Stochastic Differential Equations (SDEs) with arbitrary rates. This approximation is derived for bounded and measurable test functions. Specifically, we demonstrate that, leveraging the…
We consider equidistant Riemann approximations of stochastic integrals $\int_0^T f(B^H_s)dB^H_s$ with respect to the fractional Brownian motion with $H>\frac12$, where $f$ is an arbitrary function of locally bounded variation, hence…
Stochastic approximation algorithm is a useful technique which has been exploited successfully in probability theory and statistics for a long time. The step sizes used in stochastic approximation are generally taken to be deterministic and…
In the present article we study strong approximation of solutions of scalar stochastic differential equations (SDEs) with bounded and $\alpha$-H\"older continuous drift coefficient and constant diffusion coefficient at time point $1$.…
This paper proposes a thorough theoretical analysis of Stochastic Gradient Descent (SGD) with non-increasing step sizes. First, we show that the recursion defining SGD can be provably approximated by solutions of a time inhomogeneous…
Simulation of rough volatility models involves discretization of stochastic integrals where the integrand is a function of a (correlated) fractional Brownian motion of Hurst index $H \in (0,1/2)$. We obtain results on the rate of…
This paper revisits the convergence of Stochastic Mirror Descent (SMD) in the contemporary nonconvex optimization setting. Existing results for batch-free nonconvex SMD restrict the choice of the distance generating function (DGF) to be…
We propose some multigrid methods for solving the algebraic systems resulting from finite element approximations of space fractional partial differential equations (SFPDEs). It is shown that our multigrid methods are optimal, which means…
We investigate the error of the randomized Milstein algorithm for solving scalar jump-diffusion stochastic differential equations. We provide a complete error analysis under substantially weaker assumptions than known in the literature. In…
Multivariate global polynomial approximations - such as polynomial chaos or stochastic collocation methods - are now in widespread use for sensitivity analysis and uncertainty quantification. The pseudospectral variety of these methods uses…
We view the classical Lindeberg principle in a Markov process setting to establish a probability approximation framework by the associated It\^{o}'s formula and Markov operator. As applications, we study the error bounds of the following…
This paper investigates the approximation of stochastic delay differential equations (SDDEs) via the backward Euler-Maruyama (BEM) method under generalized monotonicity and Khasminskii-type conditions in the infinite horizon. First, by…
In this paper we provide a priori error estimates in standard Sobolev (semi-)norms for approximation in spline spaces of maximal smoothness on arbitrary grids. The error estimates are expressed in terms of a power of the maximal grid…
The random splitting Langevin Monte Carlo could mitigate the first order bias in Langevin Monte Carlo with little extra work compared other high order schemes. We develop in this work an analysis framework for the sampling error under…
In centralized settings, it is well known that stochastic gradient descent (SGD) avoids saddle points and converges to local minima in nonconvex problems. However, similar guarantees are lacking for distributed first-order algorithms. The…
Under mild assumptions stochastic gradient methods asymptotically achieve an optimal rate of convergence if the arithmetic mean of all iterates is returned as an approximate optimal solution. However, in the absence of stochastic noise, the…
We combine the rough path theory and stochastic backward error analysis to develop a new framework for error analysis on numerical schemes. Based on our approach, we prove that the almost sure convergence rate of the modified Milstein…
Stochastic optimization lies at the core of most statistical learning models. The recent great development of stochastic algorithmic tools focused significantly onto proximal gradient iterations, in order to find an efficient approach for…