Robustly learning mixtures of <i>k</i> arbitrary Gaussians-Reference-Cited by-同舟云学术

Robustly learning mixtures of k arbitrary Gaussians

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Bakshi Ainesh¹,Diakonikolas Ilias²,Jia He³,Kane Daniel M.⁴,Kothari Pravesh K.¹,Vempala Santosh S.³

Affiliation:

1. Carnegie Mellon University, USA

2. University of Wisconsin-Madison, USA

3. Georgia Institute of Technology, USA

4. University of California at San Diego, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3519953

Reference57 articles.

1. D. Achlioptas and F. McSherry . 2005. On Spectral Learning of Mixtures of Distributions . In Proceedings of the Eighteenth Annual Conference on Learning Theory (COLT). 458–469 . D. Achlioptas and F. McSherry. 2005. On Spectral Learning of Mixtures of Distributions. In Proceedings of the Eighteenth Annual Conference on Learning Theory (COLT). 458–469.

2. S. Arora and R. Kannan . 2001. Learning mixtures of arbitrary Gaussians . In Proceedings of the 33rd Symposium on Theory of Computing. 247–257 . S. Arora and R. Kannan. 2001. Learning mixtures of arbitrary Gaussians. In Proceedings of the 33rd Symposium on Theory of Computing. 247–257.

3. H. Ashtiani , S. Ben-David , N. Harvey , C. Liaw , A. Mehrabian , and Y. Plan . 2018. Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes . In Proceedings of the 32nd International Conference on Neural Information Processing Systems. 3416–3425 . H. Ashtiani, S. Ben-David, N. Harvey, C. Liaw, A. Mehrabian, and Y. Plan. 2018. Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes. In Proceedings of the 32nd International Conference on Neural Information Processing Systems. 3416–3425.

4. A. Bakshi I. Diakonikolas H. Jia D. M. Kane P. K. Kothari and S. S. Vempala. 2020. Robustly Learning Mixtures of k Arbitrary Gaussians. CoRR abs/2012.02119 (2020) arxiv:2012.02119. Available at https://arxiv.org/abs/2012.02119v3 A. Bakshi I. Diakonikolas H. Jia D. M. Kane P. K. Kothari and S. S. Vempala. 2020. Robustly Learning Mixtures of k Arbitrary Gaussians. CoRR abs/2012.02119 (2020) arxiv:2012.02119. Available at https://arxiv.org/abs/2012.02119v3

5. A. Bakshi I. Diakonikolas H. Jia D. M. Kane P. K. Kothari and S. S. Vempala. 2020. Robustly Learning Mixtures of k Arbitrary Gaussians. CoRR abs/2012.02119 (2020) arxiv:2012.02119. Available at https://arxiv.org/abs/2012.02119v2 A. Bakshi I. Diakonikolas H. Jia D. M. Kane P. K. Kothari and S. S. Vempala. 2020. Robustly Learning Mixtures of k Arbitrary Gaussians. CoRR abs/2012.02119 (2020) arxiv:2012.02119. Available at https://arxiv.org/abs/2012.02119v2

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning Quantum Hamiltonians at Any Temperature in Polynomial Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Private Graphon Estimation via Sum-of-Squares;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Beyond Moments: Robustly Learning Affine Transformations with Asymptotically Optimal Error;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Optimal estimation and computational limit of low-rank Gaussian mixtures;The Annals of Statistics;2023-04-01