Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes

By H. Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan. 2018

68 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Mohammad Rostami
2. Thomas Steinke
3. Mark Bun
4. Soheil Kolouri
5. Zhiwei Steven Wu
6. Jonathan Ullman
7. Praveen K. Pilly
8. James L. McClelland

Citations in the corpus

• Generative Continual Concept Learning (2019, background): “(Ashtiani et al. 2018) for a rigorous analysis of estimating a distribution with GMM).”
• Private Hypothesis Selection (2019, background): “mation [68]–[78], proper learning [7], [8], [10], [79]–[81], and improper learning [52].”
• Learning Transferable Knowledge Through Embedding Spaces (2019, background): “[227] for a rigorous analysis of estimating a distribution with GMM).”