Related papers: Strong and weak convergence rates for slow-fast st…
We study the stochastic Leray-{\alpha} model of Euler equations with transport noise. We first use weak convergence approach to show the large deviations of the stochastic Leray-{\alpha} model of Euler equations in a suitable scaling limit.…
We study the strong rates of the Euler-Maruyama approximation for one dimensional stochastic differential equations whose drift coefficient may be neither continuous nor one-sided Lipschitz and diffusion coefficient is H\"older continuous.…
In this paper, we simulate sample paths of a class of symmetric $\alpha$-stable processes using their series expression. We will develop a result in the approximation of shot-noise series. And finally, we will get a convergence rate for the…
We present the validity of stochastic averaging principle for non-autonomous slow-fast stochastic differential equations (SDEs) whose fast motions admit random periodic solutions. Our investigation is motivated by some problems arising from…
We formulate and study a general family of (continuous-time) stochastic dynamics for accelerated first-order minimization of smooth convex functions. Building on an averaging formulation of accelerated mirror descent, we propose a…
Stochastic approximation is a foundation for many algorithms found in machine learning and optimization. It is in general slow to converge: the mean square error vanishes as $O(n^{-1})$. A deterministic counterpart known as quasi-stochastic…
A convergence theorem for the continuous weak approximation of the solution of stochastic differential equations by general one step methods is proved, which is an extension of a theorem due to Milstein. As an application, uniform second…
The theory of stochastic approximations form the theoretical foundation for studying convergence properties of many popular recursive learning algorithms in statistics, machine learning and statistical physics. Large deviations for…
A time-stepping $L1$ scheme for solving a time fractional Fokker-Planck equation of order $\alpha \in (0, 1)$, with a general driving force, is investigated. A stability bound for the semi-discrete solution is obtained for…
We use the linear scalar SDE as a test problem to show that it is possible to construct almost sure stable first-order weak balanced schemes based on the addition of stabilizing functions to the drift terms. Then, we design balanced schemes…
We investigate the large population dynamics of a family of stochastic particle systems with three-state cyclic individual behaviour and parameter-dependent transition rates. On short time scales, the dynamics turns out to be approximated…
Stochastic optimization naturally appear in many application areas, including machine learning. Our goal is to go further in the analysis of the Stochastic Average Gradient Accelerated (SAGA) algorithm. To achieve this, we introduce a new…
We propose a new explicit numerical scheme for stochastic differential equation with super-linearly growing drift and linearly growing diffusion coefficients which are also twice continuously differentiable. The rate of strong convergence…
We present an error analysis of weak convergence of one-step numerical schemes for stochastic differential equations (SDEs) with super-linearly growing coefficients. Following Milstein's weak error analysis on the one-step approximation of…
We present an error analysis of weak convergence of one-step numerical schemes for stochastic differential equations (SDEs) with super-linearly growing coefficients. Following Milstein's weak error analysis on the one-step approximation of…
There is a recent interest on first-order methods for linear programming (LP). In this paper,we propose a stochastic algorithm using variance reduction and restarts for solving sharp primal-dual problems such as LP. We show that the…
By time discretization of a second-order primal-dual dynamical system with damping $\alpha/t$ where an inertial construction in the sense of Nesterov is needed only for the primal variable, we propose a fast primal-dual algorithm for a…
In this paper we provide a novel family of stochastic orders that generalizes second order stochastic dominance, which we call the $\alpha,[a,b]$-concave stochastic orders. These stochastic orders are generated by a novel set of "very"…
This work studies the averaging principle for a fully coupled two time-scale system, whose slow process is a diffusion process and fast process is a purely jumping process on an infinitely countable state space. The ergodicity of the fast…
Stochastic gradient descent (SGD) is a simple and popular method to solve stochastic optimization problems which arise in machine learning. For strongly convex problems, its convergence rate was known to be O(\log(T)/T), by running SGD for…