Efficiency of the Stochastic Approximation Method
M. Japundžić (2012)
The Yugoslav Journal of Operations Research
Similarity:
M. Japundžić (2012)
The Yugoslav Journal of Operations Research
Similarity:
Peggy Cénac (2013)
ESAIM: Probability and Statistics
Similarity:
We study the almost sure asymptotic behaviour of stochastic approximation algorithms for the search of zero of a real function. The quadratic strong law of large numbers is extended to the powers greater than one. In other words, the convergence of moments in the almost sure central limit theorem (ASCLT) is established. As a by-product of this convergence, one gets another proof of ASCLT for stochastic approximation algorithms. The convergence result is applied to several examples as...
Václav Dupač, Vladimir V. Ivanov (1977)
Aplikace matematiky
Similarity:
Jérôme Lelong (2013)
ESAIM: Probability and Statistics
Similarity:
We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins–Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to ensure convergence when standard algorithms fail because the expected-value function grows too fast. In this work, we give a self contained proof of a central limit theorem for this algorithm under local assumptions on the expected-value function,...
Stéphanie Allassonnière, Estelle Kuhn (2010)
ESAIM: Probability and Statistics
Similarity:
The estimation of probabilistic deformable template models in computer vision or of probabilistic atlases in Computational Anatomy are core issues in both fields. A first coherent statistical framework where the geometrical variability is modelled as a hidden random variable has been given by [S. Allassonnière , (2007) 3–29]. They introduce a Bayesian approach and mixture of them to estimate deformable template models. A consistent stochastic algorithm has been introduced...
Chaoqing Jia, Jun Hu, Chongyang Lv, Yujing Shi (2020)
Kybernetika
Similarity:
This paper is concerned with the design of event-based state estimation algorithm for nonlinear complex networks with fading measurements and stochastic coupling strength. The event-based communication protocol is employed to save energy and enhance the network transmission efficiency, where the changeable event-triggered threshold is adopted to adjust the data transmission frequency. The phenomenon of fading measurements is described by a series of random variables obeying certain probability...
W. Wertz (1985)
Banach Center Publications
Similarity:
Marius Iosifescu (1985)
Banach Center Publications
Similarity: