English

From Adaptive Kernel Density Estimation to Sparse Mixture Models

Machine Learning 2018-12-12 v1 Machine Learning

Abstract

We introduce a balloon estimator in a generalized expectation-maximization method for estimating all parameters of a Gaussian mixture model given one data sample per mixture component. Instead of limiting explicitly the model size, this regularization strategy yields low-complexity sparse models where the number of effective mixture components reduces with an increase of a smoothing probability parameter P>0\mathbf{P>0}. This semi-parametric method bridges from non-parametric adaptive kernel density estimation (KDE) to parametric ordinary least-squares when P=1\mathbf{P=1}. Experiments show that simpler sparse mixture models retain the level of details present in the adaptive KDE solution.

Keywords

Cite

@article{arxiv.1812.04397,
  title  = {From Adaptive Kernel Density Estimation to Sparse Mixture Models},
  author = {Colas Schretter and Jianyong Sun and Peter Schelkens},
  journal= {arXiv preprint arXiv:1812.04397},
  year   = {2018}
}

Comments

in Proceedings of iTWIST'18, Paper-ID: 20, Marseille, France, November, 21-23, 2018

R2 v1 2026-06-23T06:38:53.914Z