A spectral algorithm for learning mixture models
From MaRDI portal
Publication:598259
DOI10.1016/J.JCSS.2003.11.008zbMATH Open1074.68028OpenAlexW1980018091MaRDI QIDQ598259FDOQ598259
Authors: Santosh S. Vempala, Grant Wang 
Publication date: 6 August 2004
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2003.11.008
Recommendations
Cites Work
- Statistical analysis of finite mixture distributions
- Title not available (Why is that?)
- Mixture models: theory, geometry and applications
- Title not available (Why is that?)
- Latent semantic indexing: A probabilistic analysis
- Fast monte-carlo algorithms for finding low-rank approximations
- Isoperimetric problems for convex bodies and a localization lemma
- Spectral analysis of data
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- Learning mixtures of arbitrary Gaussians
- Title not available (Why is that?)
Cited In (53)
- Learning Theory
- Learning Theory
- A topological view of unsupervised learning from noisy data
- A method of spectral mixture analysis based on the Gaussian Markov random field model
- The random projection method in goodness of fit for functional data
- Isotropic PCA and Affine-Invariant Clustering
- Spectral Algorithms for Supervised Learning
- Learning diagonal Gaussian mixture models and incomplete tensor decompositions
- Separating Populations with Wide Data: A Spectral Analysis
- Structured matrix estimation and completion
- Learning mixtures of arbitrary distributions over large discrete domains
- The search problem in mixture models
- Covariate regularized community detection in sparse graphs
- Learning mixtures of Gaussians in high dimensions
- Beyond the low-degree algorithm: mixtures of subcubes and their applications
- Improved convergence guarantees for learning Gaussian mixture models by EM and gradient EM
- Robust moment estimation and improved clustering via sum of squares
- Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model
- When do birds of a feather flock together? \(k\)-means, proximity, and conic programming
- Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
- The Spectral Method for General Mixture Models
- IAN: Iterated Adaptive Neighborhoods for Manifold Learning and Dimensionality Estimation
- A spectral algorithm for learning hidden Markov models
- Training Gaussian mixture models at scale via coresets
- Statistical convergence of the EM algorithm on Gaussian mixture models
- Graph characteristics from the heat kernel trace
- Separating populations with wide data: a spectral analysis
- A spectral algorithm for latent Dirichlet allocation
- Statistical learning guarantees for compressive clustering and compressive mixture modeling
- PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption
- Mixture models, robustness, and sum of squares proofs
- Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$
- Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\)
- Fundamental limits of low-rank matrix estimation with diverging aspect ratios
- Cluster forests
- Good (K-means) clusterings are unique (up to small perturbations)
- Optimality of spectral clustering in the Gaussian mixture model
- Clustering subgaussian mixtures by semidefinite programming
- Improved spectral-norm bounds for clustering
- Partial recovery bounds for clustering with the relaxed \(K\)-means
- Recovering structured probability matrices
- Statistical and computational guarantees for the Baum-Welch algorithm
- Learning polynomial transformations via generalized tensor decompositions
- Title not available (Why is that?)
- Robust PCA and clustering in noisy mixtures
- Foundations of a multi-way spectral clustering framework for hybrid linear modeling
- Mixed membership Gaussians
- Optimal estimation of high-dimensional Gaussian location mixtures
- Learning mixtures of arbitrary Gaussians
- Efficiently learning mixtures of two Gaussians
- An \({\ell_p}\) theory of PCA and spectral clustering
- Sharp optimal recovery in the two component Gaussian mixture model
- Recovery guarantees for exemplar-based clustering
This page was built for publication: A spectral algorithm for learning mixture models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598259)
