Mini-batch learning of exponential family finite mixture models

Hien D Nguyen 1 Florence Forbes 2 Geoffrey Mclachlan 3
2 MISTIS - Modelling and Inference of Complex and Structured Stochastic Systems
Inria Grenoble - Rhône-Alpes, LJK - Laboratoire Jean Kuntzmann, INPG - Institut National Polytechnique de Grenoble
Abstract : Mini-batch algorithms have become increasingly popular due to the requirement for solving optimization problems, based on large-scale data sets. Using an existing online expectation-maximization (EM) algorithm framework, we demonstrate how mini-batch (MB) algorithms may be constructed, and propose a scheme for the stochastic stabilization of the constructed mini-batch algorithms. Theoretical results regarding the convergence of the mini-batch EM algorithms are presented. We then demonstrate how the mini-batch framework may be applied to conduct maximum likelihood (ML) estimation of mixtures of exponential family distributions, with emphasis on ML estimation for mixtures of normal distributions. Via a simulation study, we demonstrate that the mini-batch algorithm for mixtures of normal distributions can outperform the standard EM algorithm. Further evidence of the performance of the mini-batch framework is provided via an application to the famous MNIST data set.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02415068
Contributor : Florence Forbes <>
Submitted on : Monday, December 16, 2019 - 9:39:24 PM
Last modification on : Friday, December 27, 2019 - 8:14:19 PM

File

20190612_R1-FF2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02415068, version 1

Collections

Citation

Hien D Nguyen, Florence Forbes, Geoffrey Mclachlan. Mini-batch learning of exponential family finite mixture models. Statistics and Computing, Springer Verlag (Germany), In press, pp.1-40. ⟨hal-02415068⟩

Share

Metrics

Record views

18

Files downloads

17