pith. sign in

arxiv: 1111.5421 · v2 · pith:ABDA6QSZnew · submitted 2011-11-23 · 🧮 math.PR · stat.CO· stat.ME

Markovian stochastic approximation with expanding projections

classification 🧮 math.PR stat.COstat.ME
keywords approximationstochasticapplicationsexpandingframeworkmarkovianprocessprojections
0
0 comments X
read the original abstract

Stochastic approximation is a framework unifying many random iterative algorithms occurring in a diverse range of applications. The stability of the process is often difficult to verify in practical applications and the process may even be unstable without additional stabilisation techniques. We study a stochastic approximation procedure with expanding projections similar to Andrad\'{o}ttir [Oper. Res. 43 (1995) 1037-1048]. We focus on Markovian noise and show the stability and convergence under general conditions. Our framework also incorporates the possibility to use a random step size sequence, which allows us to consider settings with a non-smooth family of Markov kernels. We apply the theory to stochastic approximation expectation maximisation with particle independent Metropolis-Hastings sampling.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.