← Back to papers
2018 COLT COLT 2018

Open problem: Improper learning of mixtures of Gaussians

Abstract

We ask whether there exists an efficient unsupervised learning algorithm for mixture of Gaussians in the over-complete case (number of mixtures is larger than the dimension). The notion of learning is taken to be worst-case compression-based, to allow for improper learning.

🧭 Keyword Pioneer — over-complete case
🐝 Cross-Pollinator — Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio

Authors

Elad Hazan , Livni Roi

Topics

Machine Learning > Core Methods > Clustering Machine Learning > Learning Types > Unsupervised Learning Machine Learning > Optimization & Theory > Statistical Learning

Keywords

unsupervised learning mixture of gaussian improper learning over-complete case compression-based learning
Download PDF

Related papers

Algorithmic Regularization in Over-parameterized Matrix Sensing and Neural Networks with Quadratic Activations 2018
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure 2018
Actively Avoiding Nonsense in Generative Models 2018
A Faster Approximation Algorithm for the Gibbs Partition Function 2018
Size-Independent Sample Complexity of Neural Networks 2018