Almost sure convergence of a class of stochastic algorithms
From MaRDI portal
The author considers a wide class of random algorithms searching for a fixed point of a non-random function. Under certain assumptions, the almost sure convergence of these procedures is shown. Moreover, the paper presents an application to annealing of EM procedure.
Recommendations
- On the almost sure convergence of a general stochastic approximation procedure
- scientific article; zbMATH DE number 774863
- scientific article; zbMATH DE number 3922395
- On Convergence of Iterated Random Maps
- Almost sure convergence of randomly truncated stochastic algorithms under verifiable condi\-tions
Cites work
- A stochastic approximation type EM algorithm for the mixture problem
- Almost sure convergence of a class of stochastic algorithms
- Bounds on Moments of Certain Random Variables
- scientific article; zbMATH DE number 3723610 (Why is no real title available?)
- scientific article; zbMATH DE number 3768853 (Why is no real title available?)
- scientific article; zbMATH DE number 3504208 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- Mixture Densities, Maximum Likelihood and the EM Algorithm
- Statistical analysis of finite mixture distributions
- Tools for statistical inference. Observed data and data augmentation methods
Cited in
(18)- Asymptotic properties of a stochastic EM algorithm for mixtures with censored data
- Almost sure convergence of a class of stochastic algorithms
- Convergence of the Monte Carlo expectation maximization for curved exponential families.
- On the almost sure asymptotic behaviour of stochastic algorithm
- Geometric convergence of algorithms in gambling theory
- Almost sure convergence of extremum seeking algorithm using stochastic perturbation
- Two slice-EM algorithms for fitting generalized linear mixed models with binary response
- Almost sure convergence and in quadratic mean of the gradient stochastic process for the sequential estimation of a conditional expectation
- On the Almost Sure Rate of Convergence of Linear Stochastic Approximation Algorithms
- scientific article; zbMATH DE number 3922395 (Why is no real title available?)
- On the convergence of markovian stochastic algorithms with rapidly decreasing ergodicity rates
- On Convergence of Iterated Random Maps
- Stochastic versions of the em algorithm: an experimental study in the mixture case
- scientific article; zbMATH DE number 1946759 (Why is no real title available?)
- scientific article; zbMATH DE number 1990619 (Why is no real title available?)
- An alternative proof for convergence of stochastic approximation algorithms
- Exponential inequalities for Mann's stochastic algorithm
- Almost sure convergence of randomly truncated stochastic algorithms under verifiable condi\-tions
This page was built for publication: Almost sure convergence of a class of stochastic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318333)
