Related papers: Strong and weak convergence rates for fully couple…
Some continuous optimization methods can be connected to ordinary differential equations (ODEs) by taking continuous limits, and their convergence rates can be explained by the ODEs. However, since such ODEs can achieve any convergence rate…
We describe an asynchronous parallel stochastic coordinate descent algorithm for minimizing smooth unconstrained or separably constrained functions. The method achieves a linear convergence rate on functions that satisfy an essential strong…
An Euler-type framework with equidistant step sizes is proposed for a class of time-changed stochastic differential equations.We establish the strong convergence rate of the standard Euler--Maruyama method under the global Lipschitz…
Averaging scheme has attracted extensive attention in deep learning as well as traditional machine learning. It achieves theoretically optimal convergence and also improves the empirical model performance. However, there is still a lack of…
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…
This paper generalizes results concerning strong convexity of two-stage mean-risk models with linear recourse to distortion risk measures. Introducing the concept of (restricted) partial strong convexity, we conduct an in-depth analysis of…
We exploit analogies between first-order algorithms for constrained optimization and non-smooth dynamical systems to design a new class of accelerated first-order algorithms for constrained optimization. Unlike Frank-Wolfe or projected…
For a strictly stationary sequence of random variables we derive functional convergence of the joint partial sum and partial maxima process under joint regular variation with index $\alpha \in (0,2)$ and weak dependence conditions. The…
Based on a class of moderately interacting particle systems, we establish a quantitative approximation for density-dependent McKean-Vlasov SDEs and the corresponding nonlinear, nonlocal PDEs. The SDE is driven by both Brownian motion and…
There exists a diversity of weak Local Linearization (LL) schemes for the integration of stochastic differential equations with additive noise, which differ with respect to the algorithm that is employed in the numerical implementation of…
Robust control seeks stabilizing policies that perform reliably under adversarial disturbances, with $\mathcal{H}_\infty$ control as a classical formulation. It is known that policy optimization of robust $\mathcal{H}_\infty$ control…
In this paper, we show that the concept of sigma-convergence associated to stochastic processes can tackle the homogenization of stochastic partial differential equations. In this regard, the homogenization problem for a stochastic…
The analysis of panel count data has garnered considerable attention in the literature, leading to the development of multiple statistical techniques. In inferential analysis, most works focus on leveraging estimating equation-based…
The purpose of this paper is to prove a weak convergence result for empirical processes indexed in general classes of functions and with an underlying $\alpha$-mixing sequence of random variables. In particular the uniformly boundedness…
We analyze convergence rates of stochastic optimization procedures for non-smooth convex optimization problems. By combining randomized smoothing techniques with accelerated gradient methods, we obtain convergence rates of stochastic…
We show that accelerated gradient descent, averaged gradient descent and the heavy-ball method for non-strongly-convex problems may be reformulated as constant parameter second-order difference equation algorithms, where stability of the…
The convergence of stochastic gradient descent is highly dependent on the step-size, especially on non-convex problems such as neural network training. Step decay step-size schedules (constant and then cut) are widely used in practice…
We consider the stochastic approximation problem where a convex function has to be minimized, given only the knowledge of unbiased estimates of its gradients at certain points, a framework which includes machine learning methods based on…
In this article, we are interested in the strong well-posedness together with the numerical approximation of some one-dimensional stochastic differential equations with a non-linear drift, in the sense of McKean-Vlasov, driven by a…
In this paper we study coupled fast-slow ordinary differential equations (ODEs) with small time scale separation parameter $\epsilon$ such that, for every fixed value of the slow variable, the fast dynamics are sufficiently chaotic with…