Learning Mixtures of Gaussians in High Dimensions
From MaRDI portal
Publication:2941572
DOI10.1145/2746539.2746616zbMath1321.68403arXiv1503.00424OpenAlexW2047064469MaRDI QIDQ2941572
Qingqing Huang, Rong Ge, Sham M. Kakade
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.00424
Related Items
GAT–GMM: Generative Adversarial Training for Gaussian Mixture Models ⋮ Learning diagonal Gaussian mixture models and incomplete tensor decompositions ⋮ A new method of moments for latent variable models ⋮ Smoothed analysis for tensor methods in unsupervised learning ⋮ Overcomplete Order-3 Tensor Decomposition, Blind Deconvolution, and Gaussian Mixture Models ⋮ An alternative to EM for Gaussian mixture models: batch and stochastic Riemannian optimization ⋮ Recovery guarantees for exemplar-based clustering ⋮ Optimal estimation and computational limit of low-rank Gaussian mixtures ⋮ Convergence rates of latent topic models under relaxed identifiability conditions ⋮ Recovering Structured Probability Matrices ⋮ Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
Uses Software
Cites Work
- Unnamed Item
- Ramsey partitions and proximity data structures
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Shortest-path queries in static networks
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
