Séminaire de Probabilités et Statistique :

Le 02 mars 2020 à 13:45 - SupAgo- salle 9/106

Présentée par Kuhn Estelle - INRA

Properties of the Stochastic Approximation EM Algorithm with Mini-batch Sampling

Joint work with Catherine Matias and Tabea Rebafka To deal with very large datasets, we propose a mini-batch version of the Monte Carlo Markov Chain Stochastic Approximation Expectation-Maximization algorithm for general latent variable models. For exponential models, the algorithm is shown to be convergent under classical conditions as the number of iterations increases. Numerical experiments illustrate the performance of the mini-batch algorithm in various models. In particular, we highlight that mini-batch sampling results in an important speed-up of the convergence of the sequence of estimators generated by the algorithm. Moreover, insights on the effect of the mini-batch size on the limit distribution of the estimator provided by the algorithm are presented.