Expectation-maximization algorithms for Itakura-Saito nonnegative matrix factorization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Expectation-maximization algorithms for Itakura-Saito nonnegative matrix factorization

Résumé

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.
Fichier principal
Vignette du fichier
em-algorithms-isnmf.pdf (246.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01632082 , version 1 (09-11-2017)
hal-01632082 , version 2 (23-03-2018)
hal-01632082 , version 3 (15-06-2018)

Identifiants

  • HAL Id : hal-01632082 , version 3

Citer

Paul Magron, Tuomas Virtanen. Expectation-maximization algorithms for Itakura-Saito nonnegative matrix factorization. Interspeech, Sep 2018, Hyderabad, India. ⟨hal-01632082v3⟩
299 Consultations
863 Téléchargements

Partager

Gmail Facebook X LinkedIn More