Learning mixtures of separated nonspherical Gaussians
From MaRDI portal
Publication:1774210
DOI10.1214/105051604000000512zbMath1059.62062arXivmath/0503457OpenAlexW2010072035WikidataQ93496477 ScholiaQ93496477MaRDI QIDQ1774210
Sanjeev Arora, Ravindran Kannan
Publication date: 29 April 2005
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0503457
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Complexity and performance of numerical algorithms (65Y20)
Related Items
IAN: Iterated Adaptive Neighborhoods for Manifold Learning and Dimensionality Estimation, GAT–GMM: Generative Adversarial Training for Gaussian Mixture Models, Clusterability assessment for Gaussian mixture models, Optimal transport for conditional domain matching and label shift, Uniform consistency in nonparametric mixture models, Optimal estimation of high-dimensional Gaussian location mixtures, Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$, Identifiability of nonparametric mixture models and Bayes optimal clustering, Improved convergence guarantees for learning Gaussian mixture models by EM and gradient EM, Dimensionality reduction for data of unknown cluster structure, Unnamed Item, Statistical convergence of the EM algorithm on Gaussian mixture models, Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\), A spectral algorithm for latent Dirichlet allocation, Provable ICA with unknown Gaussian noise, and implications for Gaussian mixtures and autoencoders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Projection pursuit
- Random vectors in the isotropic position
- A constant-factor approximation algorithm for the \(k\)-median problem
- A review of semiparametric mixture models
- Theory of uniform convergence of frequencies of events to their probabilities and problems of search for an optimal solution from empirical data
- On the complexity of some geometric problems in unbounded dimension
- Mixture Densities, Maximum Likelihood and the EM Algorithm
- Extensions of Lipschitz mappings into a Hilbert space
- Random walks in a convex body and an improved volume algorithm
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Learning mixtures of arbitrary gaussians
- Probability Inequalities for Sums of Bounded Random Variables
