Location of Repository

Author manuscript, published in "Signal Processing with Adaptive Sparse Structured Representations (SPARS) 2013 Switzerland (2013)" Compressive Gaussian Mixture Estimation

By Anthony Bourrier, Rémi Gribonval and Patrick Pérez


Abstract—We propose a framework to estimate the parameters of a mixture of isotropic Gaussians using empirical data drawn from this mixture. The difference with standard methods is that we only use a sketch computed from the data instead of the data itself. The sketch is composed of empirical moments computed in one pass on the data. To estimate the mixture parameters from the sketch, we derive an algorithm by analogy with Iterative Hard Thresholding, used in compressed sensing to recover sparse signals from a few linear projections. We prove experimentally that the parameters can be precisely estimated if the sketch is large enough, while using less memory than an EM algorithm if the data is numerous. Our approach also preserves the privacy of the initial data, since the sketch doesn’t provide information on the individual data. I. INTRODUCTION AND RELATED WORK Fitting a probability mixture model to data vectors is a widespread technique in machine learning. However, it usually requires extensiv

Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://hal.inria.fr/docs/00/81... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.