Related papers: On the convergence of adaptive approximations for …
A class of super-linear stochastic delay differential equations (SDDEs) with variable delay and Markovian switching is considered. The main aim of this paper is to develop the partially truncated Euler-Maruyama (EM) method for the…
We study a one-dimensional McKean-Vlasov stochastic differential equation (SDE) with a drift equal to a product of a distribution depending on the state of the process and a non-linear function depending pointwise on the law density of the…
This paper investigates the mean-square exponential stability of neutral stochastic differential delay equations (NSDDEs) with Markovian switching. The analysis addresses the complexities arising from the interaction between the neutral…
The problem of posterior inference is central to Bayesian statistics and a wealth of Markov Chain Monte Carlo (MCMC) methods have been proposed to obtain asymptotically correct samples from the posterior. As datasets in applications grow…
In this paper, we get some convergence rates in total variation distance in approximating discretized paths of L{\'e}vy driven stochastic differential equations, assuming that the driving process is locally stable. The particular case of…
We consider numerical approximations of stochastic differential equations by the Euler method. In the case where the SDE is elliptic or hypoelliptic, we show a weak backward error analysis result in the sense that the generator associated…
We study the stochastic optimization problem from a continuous-time perspective, with a focus on the Stochastic Gradient Descent with Momentum (SGDM) method. We show that the trajectory of SGDM, despite its \emph{stochastic} nature,…
Continuous-time approximation of Stochastic Gradient Descent (SGD) is a crucial tool to study its escaping behaviors from stationary points. However, existing stochastic differential equation (SDE) models fail to fully capture these…
We propose an algorithm for approximating the solution of a strongly oscillating SDE, that is, a system in which some ergodic state variables evolve quickly with respect to the other variables. The algorithm profits from homogenization…
We study the convergence of a generic tamed Euler-Maruyama (EM) scheme for the kinetic type stochastic differential equations (SDEs) (also known as second order SDEs) with singular coefficients in both weak and strong probabilistic senses.…
In this article, we consider the so-called modified Euler scheme for stochastic differential equations (SDEs) driven by fractional Brownian motions (fBm) with Hurst parameter $\frac13<H<\frac12$. This is a first-order time-discrete…
In this paper, we propose an adaptive step size strategy for a class of line search methods for orthogonality constrained minimization problems, which avoids the classic backtracking procedure. We prove the convergence of the line search…
We study the statistical properties of the dynamic trajectory of stochastic gradient descent (SGD). We approximate the mini-batch SGD and the momentum SGD as stochastic differential equations (SDEs). We exploit the continuous formulation of…
Many popular learning-rate schedules for deep neural networks combine a decaying trend with local perturbations that attempt to escape saddle points and bad local minima. We derive convergence guarantees for bandwidth-based step-sizes, a…
We aim to make stochastic gradient descent (SGD) adaptive to (i) the noise $\sigma^2$ in the stochastic gradients and (ii) problem-dependent constants. When minimizing smooth, strongly-convex functions with condition number $\kappa$, we…
Classical stochastic gradient methods for optimization rely on noisy gradient approximations that become progressively less accurate as iterates approach a solution. The large noise and small signal in the resulting gradients makes it…
This paper is motivated by the problem of quantitatively bounding the convergence of adaptive control methods for stochastic systems to a stationary distribution. Such bounds are useful for analyzing statistics of trajectories and…
For parabolic stochastic partial differential equations (SPDEs), we show that the numerical methods, including the spatial spectral Galerkin method and further the full discretization via the temporal accelerated exponential Euler method,…
We study the rate of convergence of some recursive procedures based on some "exact" or "approximate" Euler schemes which converge to the invariant measure of an ergodic SDE driven by a L\'{e}vy process. The main interest of this work is to…
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…