Author:
Nguyen Hien Duy,Forbes Florence,Fort Gersende,Cappé Olivier
Abstract
AbstractModern statistical and machine learning settings often involve high data volume and data streaming, which require the development of online estimation algorithms. The online Expectation–Maximization (EM) algorithm extends the popular EM algorithm to this setting, via a stochastic approximation approach.We show that an online version of the Minorization–Maximization (MM) algorithm, which includes the online EM algorithm as a special case, can also be constructed in a similar manner. We demonstrate our approach via an application to the logistic regression problem and compare it to existing methods.
Publisher
Springer International Publishing
Reference23 articles.
1. Bohning, D.: Multinomial logistic regression algorithm. Ann. Inst. Stat. Math. (1992)
2. Borkar, V.S.: Stochastic approximation: A dynamical systems viewpoint. Springer (2009)
3. Cappé, O., Moulines, E.: On-line expectation-maximization algorithm for latent data models. J. Roy. Stat. Soc. B Stat. Meth. 71, 593–613 (2009)
4. Cui, Y., Pang, J.: Modern nonconvex nondifferentiable optimization. SIAM, Philadelphia (2022)
5. Delyon, B., Lavielle, M., Moulines, E.: Convergence of a stochastic approximation version of the EM algorithm. Ann. Stat. 27, 94–128 (1999)