Properties of the stochastic approximation EM algorithm with mini-batch sampling

To deal with very large datasets a mini-batch version of the Monte Carlo Markov Chain Stochastic Approximation Expectation–Maximization algorithm for general latent variable models is proposed. For exponential models the algorithm is shown to be convergent under classical conditions as the number of...

Full description

Saved in:

Bibliographic Details
Published in:	Statistics and computing Vol. 30; no. 6; pp. 1725 - 1739
Main Authors:	Kuhn, Estelle, Matias, Catherine, Rebafka, Tabea
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2020 Springer Nature B.V Springer Verlag (Germany)
Subjects:	Algorithms Approximation Artificial Intelligence Computing time Convergence Markov chains Mathematical analysis Mathematics and Statistics Methodology Probability and Statistics in Computer Science Sampling Statistical Theory and Methods Statistics Statistics and Computing/Statistics Programs Statistics Theory Stochastic approximation Mini-batch sampling 62F12 65C60 EM algorithm Monte Carlo Markov chain stochastic approximation mini-batch sampling Monte Carlo Markov chain Mathematics Subject Classification 65C60 · 62F12
ISSN:	0960-3174, 1573-1375
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!