Sketching for Large-Scale Learning of Mixture Models

Abstract : Learning parameters from voluminous data can be prohibitive in terms of memory and computational requirements. We propose a "compressive learning'' framework where we first sketch the data by computing random generalized moments of the underlying probability distribution, then estimate mixture model parameters from the sketch using an iterative algorithm analogous to greedy sparse signal recovery. We exemplify our framework with the sketched estimation of Gaussian Mixture Models (GMMs). We experimentally show that our approach yields results comparable to the classical Expectation-Maximization (EM) technique while requiring significantly less memory and fewer computations when the number of database elements is large. We report large-scale experiments in speaker verification, where our approach makes it possible to fully exploit a corpus of 1000 hours of speech signal to learn a universal background model at scales computationally inaccessible to EM.
Liste complète des métadonnées
Contributeur : Nicolas Keriven <>
Soumis le : jeudi 1 octobre 2015 - 17:01:24
Dernière modification le : mercredi 21 mars 2018 - 09:28:02
Document(s) archivé(s) le : samedi 2 janvier 2016 - 11:24:33


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01208027, version 1


Nicolas Keriven, Anthony Bourrier, Rémi Gribonval, Patrick Pérez. Sketching for Large-Scale Learning of Mixture Models. 2015. 〈hal-01208027v1〉



Consultations de la notice


Téléchargements de fichiers