Non-strongly-convex smooth stochastic approximation

We consider the asymptotic behavior of posterior distributions and Bayes estimators for infinite-dimensional statistical models. We give general results on the rate of convergence of the posterior measure. These are applied to several examples, including priors on finite sieves, log-spline models

Bounds on the convergent rate is an important problem in the foundations of genetic algorithm. This paper obtained some bounds on the convergent rate of genetic algorithms by Markov chain theory. The main result is that the algorithms convergence in geometric rate under the meaning of probability

In this paper we investigate the convergence rate of a sequence of vectors provided that the convergence rates of the components are known. The result of this investigation is then used to study the m-step convergence rate of sequences. Key Words. convergence rate - Q-factor - multi

this paper, we attempt to describe various mathematical techniques which have been used to bound such rates of convergence. In particular, we describe eigenvalue analysis, random walks on groups, coupling, and minorization conditions. Connections are made to modern areas of research wherever

received from the neighboring agents. We study an asynchronous operation of this algorithm using delayed agent values. Our focus is on establishing convergence rate results for this algorithm. In particular, we first show convergence to consensus under a bounded delay condition and some connectivity

Abstract. General conditions for convergence rates of nonparametric or-thogonal series estimators of the regression function f(x) = E(Y |X = x) are considered. The estimators are obtained by the least squares method on the basis of a random observation sample (Yi,Xi), i = 1,..., n, where Xi ∈ A

squares problems, such as those arising in the training of neural networks, and it has resulted in a much better practical rate of convergence than the steepest descent method. In this paper, we present convergence results and estimates of the convergence rate of a number of variants of incremental

We improve results from [2] on subgeometric convergence rates in the local renewal theorem. The results are used in [3] to generalize previous results on convergence rates for Markov chains [4]. Key words and phrases. Renewal theorem; Convergence rates; Coupling. 1

by Julier and Uhlmann (1997) to overcome these difficulties, but it lacks of theoretical justification. In this paper, we derive some theoretical properties of the unscented transformation and contrast it with the method of linear approximation. Particularly, we derive the convergence rate of the unscented