Compressive Gaussian Mixture estimation
Lists
Only you see this
Abstract
When fitting a probability model to voluminous data, memory and computational time can become prohibitive. In this paper, we propose a framework aimed at fitting a mixture of isotropic Gaussians to data vectors by computing a low-dimensional sketch of the data. The sketch represents empirical moments of the underlying probability distribution. Deriving a reconstruction algorithm by analogy with compressive sensing, we experimentally show that it is possible to precisely estimate the mixture parameters provided that the sketch is large enough. Our algorithm provides good reconstruction and scales to higher dimensions than previous probability mixture estimation algorithms, while consuming less memory in the case of numerous data. It also provides a privacy-preserving data analysis tool, since the sketch doesn't disclose information about individual datum it is based on.
BibTeX
@inproceedings{bourrier2013compressive,
author = {Anthony Bourrier and Rémi Gribonval and Patrick Pérez},
title = {{Compressive Gaussian Mixture estimation}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2013},
url = {https://openreview.net/forum?id=y3fGAEHPgc},
}Loading related content...