Tight Bounds for Learning a Mixture of Two Gaussians

DOI10.1145/2746539.2746579zbMath1321.68405arXiv1404.4997OpenAlexW2062817469MaRDI QIDQ2941570

Eric Price, Moritz Hardt

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/1404.4997

zbMATH Keywords

sample complexity

Mathematics Subject Classification ID

Asymptotic properties of parametric estimators (62F12) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (14)

GAT–GMM: Generative Adversarial Training for Gaussian Mixture Models ⋮ Optimal estimation of high-dimensional Gaussian location mixtures ⋮ Improving fairness generalization through a sample-robust optimization method ⋮ Public-key encryption from homogeneous CLWE ⋮ Unnamed Item ⋮ A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering ⋮ Optimal estimation of Gaussian mixtures via denoised method of moments ⋮ Robust Estimators in High-Dimensions Without the Computational Intractability ⋮ Improved convergence guarantees for learning Gaussian mixture models by EM and gradient EM ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Statistical convergence of the EM algorithm on Gaussian mixture models ⋮ Large-sample properties of unsupervised estimation of the linear discriminant using projection pursuit

Uses Software

• Graphs

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

This page was built for publication: Tight Bounds for Learning a Mixture of Two Gaussians