A probabilistic analysis of EM for mixtures of separated, spherical Gaussians
From MaRDI portal
Publication:3174072
Recommendations
- Learning mixtures of separated nonspherical Gaussians
- Learning mixtures of arbitrary Gaussians
- Statistical convergence of the EM algorithm on Gaussian mixture models
- Efficiently learning mixtures of two Gaussians
- Improved convergence guarantees for learning Gaussian mixture models by EM and gradient EM
Cited in
(17)- Fundamental limits of low-rank matrix estimation with diverging aspect ratios
- Improved convergence guarantees for learning Gaussian mixture models by EM and gradient EM
- CHIME: clustering of high-dimensional Gaussian mixtures with EM algorithm and its optimality
- Singularity, misspecification and the convergence rate of EM
- A spectral algorithm for learning hidden Markov models
- Learning polynomial transformations via generalized tensor decompositions
- scientific article; zbMATH DE number 1833439 (Why is no real title available?)
- Sketched learning for image denoising
- Learning by unsupervised nonlinear diffusion
- Clustering subgaussian mixtures by semidefinite programming
- A method of spectral mixture analysis based on the Gaussian Markov random field model
- Statistical convergence of the EM algorithm on Gaussian mixture models
- scientific article; zbMATH DE number 5217595 (Why is no real title available?)
- Learning mixtures of Bernoulli templates by two-round EM with performance guarantee
- Covariate regularized community detection in sparse graphs
- A spectral algorithm for latent Dirichlet allocation
- How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models
This page was built for publication: A probabilistic analysis of EM for mixtures of separated, spherical Gaussians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174072)
