Related papers: Strong and weak convergence rates for slow-fast st…

We show that the convergence rate of $\ell^1$-regularization for linear ill-posed equations is always $O(\delta)$ if the exact solution is sparse and if the considered operator is injective and weak*-to-weak continuous. Under the same…

With a weighting scheme proportional to t, a traditional stochastic gradient descent (SGD) algorithm achieves a high probability convergence rate of O({\kappa}/T) for strongly convex functions, instead of O({\kappa} ln(T)/T). We also prove…

This paper gives necessary and sufficient conditions for the convergence of the solution of a weakly damped second order linear differential equation that is subjected to outside forcing, for which solutions of the unforced equation are…

This paper considers stochastic subgradient mirror-descent method for solving constrained convex minimization problems. In particular, a stochastic subgradient mirror-descent method with weighted iterate-averaging is investigated and its…

We study the strong $L^p$-convergence rates of the Euler-Maruyama method for stochastic differential equations driven by Brownian motion with low-regularity drift coefficients. Specifically, the drift is assumed to be in the…

We prove a stochastic averaging theorem for stochastic differential equations in which the slow and the fast variables interact. The approximate Markov fast motion is a family of Markov process with generator ${\mathcal L}_x$ for which we…

An averaging result is proved for stochastic evolution equations with highly oscillating coefficients. This result applies in particular to equations with almost periodic coefficients. The convergence to the solution of the averaged…

The paper studies the rate of convergence of the weak Euler approximation for It\^{o} diffusion and jump processes with H\"{o}lder-continuous generators. It covers a number of stochastic processes including the nondegenerate diffusion…

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…

We consider statistical learning question for $\psi$-weakly dependent processes, that unifies a large class of weak dependence conditions such as mixing, association,$\cdots$ The consistency of the empirical risk minimization algorithm is…

We show that if a sequence of piecewise affine linear processes converges in the strong sense with a positive rate to a stochastic process which is strongly H\"older continuous in time, then this sequence converges in the strong sense even…

For an SDE driven by a rotationally invariant $\alpha$-stable noise we prove weak uniqueness of the solution under the balance condition $\alpha+\gamma>1$, where $\gamma$ denotes the Holder index of the drift coefficient. We prove existence…

This paper establishes a discretization scheme for a large class of stochastic differential equations driven by a time-changed Brownian motion with drift, where the time change is given by a general inverse subordinator. The scheme involves…

In this paper, we propose a new way to obtain optimal convergence rates for smooth stochastic (strong) convex optimization tasks. Our approach is based on results for optimization tasks where gradients have nonrandom noise. In contrast to…

The computer algebra routines documented here empower you to reproduce and check many of the details described by an article on large deviations for slow-fast stochastic systems [abs:1001.4826]. We consider a 'small' spatial domain with two…

In this paper, we study the convergence rate of the DCA (Difference-of-Convex Algorithm), also known as the convex-concave procedure, with two different termination criteria that are suitable for smooth and nonsmooth decompositions…

This paper is concerned with the convergence rate of the solutions of nonlinear switched systems. We first consider a switched system which is asymptotically stable for a class of inputs but not for all inputs. We show that solutions…

We consider the rate of piecewise constant approximation to a locally stationary process $X(t),t\in [0,1]$, having a variable smoothness index $\alpha(t)$. Assuming that $\alpha(\cdot)$ attains its unique minimum at zero and satisfies the…

In this paper, we consider the second-order equations of Duffing type. Bounds for the derivative of the restoring force are given that ensure the existence and uniqueness of a periodic solution. Furthermore, the stability of the unique…

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…