Related papers: Moderate Deviation Principle for a Stochastic Appr…
This paper considers a stochastic approximation algorithm, with decreasing step size and martingale difference noise. Under very mild assumptions, we prove the non convergence of this process toward a certain class of repulsive sets for the…
We consider the set M_n of all n-truncated power moment sequences of probability measures on [0,1]. We endow this set with the uniform probability. Picking randomly a point in M_n, we show that the upper canonical measure associated with…
The term moderate deviations is often used in the literature to mean a class of large deviation principles that, in some sense, fills the gap between a convergence in probability of some random variables to a constant and a weak convergence…
In this paper, we present sufficient conditions and criteria to establish the large and moderate deviation principle of multivalued McKean-Vlasov stochastic differential equation by means of the weak convergence method.
We introduce a class of Markov chains, that contains the model of stochastic approximation by averaging and non-averaging. Using martingale approximation method, we establish various deviation inequalities for separately Lipschitz functions…
The paper is concerned with stochastic approximation procedures having three main characteristics: truncations with random moving bounds, a matrix valued random step-size sequence, and a dynamically changing random regression function. We…
The purpose of this paper is to investigate the deviation inequalities and the moderate deviation principle of the least squares estimators of the unknown parameters of general $p$th-order bifurcating autoregressive processes, under…
We develop a general framework for extracting highly uniform bounds on local stability for stochastic processes in terms of information on fluctuations or crossings. This includes a large class of martingales: As a corollary of our main…
We prove novel convergence results for a stochastic proximal gradient algorithm suitable for solving a large class of convex optimization problems, where a convex objective function is given by the sum of a smooth and a possibly non-smooth…
This paper seeks an efficient algorithm for stochastic precoding to maximize the long-term average weighted sum rates throughout a multiple-input multiple-output (MIMO) network. Unlike many existing works that assume a particular…
In this paper, we establish a central limit theorem and a moderate deviations for 2D stochastic primitive equations with multiplicative noise. The proof is mainly based on the weak convergence approach.
In this paper we address the convergence of stochastic approximation when the functions to be minimized are not convex and nonsmooth. We show that the "mean-limit" approach to the convergence which leads, for smooth problems, to the ODE…
An averaging method is applied to derive effective approximation to the following singularly perturbed nonlinear stochastic damped wave equation \nu u_{tt}+u_t=\D u+f(u)+\nu^\alpha\dot{W} on an open bounded domain $D\subset\R^n$\,, $1\leq…
The paper concerns itself with establishing large deviation principles for a sequence of stochastic integrals and stochastic differential equations driven by general semimartingales in infinite-dimensional settings. The class of…
For each $n\geq 1$, let $ {X_{in}, \quad i \geq 1} $ be independent copies of a nonnegative continuous stochastic process $X_{n}=(X_n(t))_{t\in T}$ indexed by a compact metric space $T$. We are interested in the process of partial maxima…
A determinantal approximation is obtained for the permanent of a doubly stochastic matrix. For moderate-deviation matrix sequences, the asymptotic relative error is of order $O(n^{-1})$.
In this paper we prove a Large Deviation Principle for the sequence of symmetrised empirical measures $\frac{1}{n} \sum_{i=1}^{n} \delta_{(X^n_i,X^n_{\sigma_n(i)})}$ where $\sigma_n$ is a random permutation and $((X_i^n)_{1 \leq i \leq…
Majorization-minimization algorithms consist of iteratively minimizing a majorizing surrogate of an objective function. Because of its simplicity and its wide applicability, this principle has been very popular in statistics and in signal…
Stochastic approximation is a class of algorithms that update a vector iteratively, incrementally, and stochastically, including, e.g., stochastic gradient descent and temporal difference learning. One fundamental challenge in analyzing a…
In this paper we propose a wide class of truncated stochastic approximation procedures with moving random bounds. While we believe that the proposed class of procedures will find its way to a wider range of applications, the main motivation…