[DKS17] I. Diakonikolas, D. M. Kane, and A. Stewart. Statistical query lower bounds for robust estimation of high-dimensional gaussians and gaussian mixtures. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, pages 73-84, 2017. Full version at http://arxiv.org/abs/1611.03473.
[DKS18] I. Diakonikolas, D. M. Kane, and A. Stewart. List-decodable robust mean estimation and learning mixtures of spherical gaussians. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pages 1047-1060, 2018. Full version available at https://arxiv.org/abs/1711.07211.
[Fe116] V. Feldman. Statistical query learning. In Encyclopedia of Algorithms, pages 2090-2095. Springer New York, 2016.
$\left[\mathrm{FGR}^{+}17\right]$  V. Feldman, E. Grigorescu, L. Reyzin, S. Vempala, and Y. Xiao. Statistical algorithms and a lower bound for detecting planted cliques. J. ACM, 64(2):8:1-8:37, 2017.
[FGV17] V. Feldman, C. Guzman, and S. S. Vempala. Statistical query algorithms for mean vector estimation and stochastic convex optimization. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, pages 1265-1277. SIAM, 2017.
[GMP20] V. Gandikota, A. Mazumdar, and S. Pal. Recovery of sparse linear classifiers from mixture of responses. Advances in Neural Information Processing Systems, 33:14688-14698, 2020.
[GP11] M. Gräf and D. Potts. On the computation of spherical designs by a new optimization approach based on fast spherical fourier transforms. Numerische Mathematik, 119(4):699-724, 2011.
$\left[\mathrm{HKP}^{+}17\right]$  S. B. Hopkins, P. K. Kothari, A. Potechin, P. Raghavendra, T. Schramm, and D. Steurer. The power of sum-of-squares for detecting hidden structures. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, pages 720-731. IEEE Computer Society, 2017.
[HL18] S. B. Hopkins and J. Li. Mixture models, robustness, and sum of squares proofs. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pages 1021-1034, 2018.
[Hop18] S. B. Hopkins. Statistical inference and the sum of squares method. PhD thesis, Cornell University, 2018.
[HS17] S. B. Hopkins and D. Steurer. Efficient bayesian estimation from few samples: Community detection and related problems. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, pages 379-390. IEEE Computer Society, 2017.
[HYJ22] N. Ho, C. Yang, and M. I. Jordan. Convergence rates for gaussian mixtures of experts. The Journal of Machine Learning Research, 23(1):14523-14603, 2022.
[JJ94] M. I. Jordan and R. A. Jacobs. Hierarchical mixtures of experts and the em algorithm. Neural computation, 6(2):181-214, 1994.
[Kan15] D. M. Kane. Small designs for path-connected spaces and path-connected homogeneous spaces. Transactions of the American Mathematical Society, 367(9):6387-6414, 2015.
[Kea98] M. J. Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 45(6):983-1006, 1998.
[KSV08] R. Kannan, H. Salmasian, and S. Vempala. The spectral method for general mixture models. SIAM J. Comput., 38(3):1141-1156, 2008.
[LL18] Y. Li and Y. Liang. Learning mixtures of linear regressions with nearly optimal complexity. In Conference On Learning Theory, pages 1125-1144. PMLR, 2018.