The simulated online EM algorithm for latent factor models

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

The estimation of latent factor models are treated in an integrated maximum likelihood context where one parameter is marginalized and another is estimated. An extension to the online Expectation Maximization (EM) algorithm is employed the simulated online Expectation Maximization algorithm. Both these algorithms apply to exponential family models, but the simulated version of the algorithm can make use of Monte Carlo simulation to compute the stochastic E-steps while maintaining the convergence properties of the original online EM algorithm. A class of important latent factor models are identified that can be expressed in complete data exponential family form, the algorithm is applied to one of these models Itakura-Saito Non-negative Matrix Factorisation. An additional parameter is introduced into this model and it is conjectured if this is set to a high value the posterior variance of the parameters is reduced and estimation becomes easier. Simulations are provided that support this conjecture, although online estimation for models with even a modest number of components continues to be hampered by the presence of local minima. © 2012 American Institute of Physics.

Author supplied keywords

Cite

CITATION STYLE

APA

Rohde, D., Cappé, O., & Dikmen, O. (2012). The simulated online EM algorithm for latent factor models. In AIP Conference Proceedings (Vol. 1490, pp. 294–303). https://doi.org/10.1063/1.4759614

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free