The search problem in mixture models
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- 10.1162/jmlr.2003.3.4-5.993
- A geometric analysis of subspace clustering with outliers
- A spectral algorithm for latent Dirichlet allocation
- An introduction to matrix concentration inequalities
- Convex and Nonconvex Formulations for Mixed Regression With Two Components: Minimax Optimal Rates
- Efficiently learning mixtures of two Gaussians
- Introduction to Information Retrieval
- Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
- Learning with side information: PAC learning bounds
- Mixture Densities, Maximum Likelihood and the EM Algorithm
- Online tensor methods for learning latent variable models
- Tensor decompositions for learning latent variable models
- Tight bounds for learning a mixture of two Gaussians (extended abstract)
This page was built for publication: The search problem in mixture models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558537)