Expectation-Maximization Algorithms for Itakura-Saito Nonnegative Matrix Factorization

Paul Magron, Tuomas Virtanen


This paper presents novel expectation-maximization (EM) algorithms for estimating the nonnegative matrix factorization model with Itakura-Saito divergence. Indeed, the common EM-based approach exploits the space-alternating generalized EM (SAGE) variant of EM but it usually performs worse than the conventional multiplicative algorithm. We propose to explore more exhaustively those algorithms, in particular the choice of the methodology (standard EM or SAGE variant) and the latent variable set (full or reduced). We then derive four EM-based algorithms, among which three are novel. Speech separation experiments show that one of those novel algorithms using a standard EM methodology and a reduced set of latent variables outperforms its SAGE variants and competes with the conventional multiplicative algorithm.


 DOI: 10.21437/Interspeech.2018-1840

Cite as: Magron, P., Virtanen, T. (2018) Expectation-Maximization Algorithms for Itakura-Saito Nonnegative Matrix Factorization. Proc. Interspeech 2018, 856-860, DOI: 10.21437/Interspeech.2018-1840.


@inproceedings{Magron2018,
  author={Paul Magron and Tuomas Virtanen},
  title={Expectation-Maximization Algorithms for Itakura-Saito Nonnegative Matrix Factorization},
  year=2018,
  booktitle={Proc. Interspeech 2018},
  pages={856--860},
  doi={10.21437/Interspeech.2018-1840},
  url={http://dx.doi.org/10.21437/Interspeech.2018-1840}
}