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.
|Number of pages||4|
|Journal||Proceedings of Machine Learning Research|
|State||Published - 2018|
|Event||31st Annual Conference on Learning Theory, COLT 2018 - Stockholm, Sweden|
Duration: 6 Jul 2018 → 9 Jul 2018