$\left[\mathrm{BKS}^{+}06\right]$  G. Blanchard, M. Kawanabe, M. Sugiyama, V. Spokoiny, and K.-R. Müller. In search of non-gaussian components of a high-dimensional distribution. Journal of Machine Learning Research, 7(9):247-282, 2006.
[BRST21] J. Bruna, O. Regev, M. J. Song, and Y. Tang. Continuous LWE. In 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 694-707. ACM, 2021.
[CLL22] S. Chen, J. Li, and Y. Li. Learning (very) simple generative models is hard. In NeurIPS, 2022.
[DH23] J. Ding and Y. Hua. SQ lower bounds for random sparse planted vector problem. In International Conference on Algorithmic Learning Theory, volume 201 of Proceedings of Machine Learning Research, pages 558-596. PMLR, 2023.
[DK22a] I. Diakonikolas and D. Kane. Near-optimal statistical query hardness of learning half-spaces with massart noise. In Conference on Learning Theory, volume 178 of Proceedings of Machine Learning Research, pages 4258-4282. PMLR, 2022. Full version available at https://arxiv.org/abs/2012.09720.
[DK22b] I. Diakonikolas and D. Kane. Non-gaussian component analysis via lattice basis reduction. In Conference on Learning Theory, volume 178 of Proceedings of Machine Learning Research, pages 4535-4547. PMLR, 2022.
[DK23] I. Diakonikolas and D. M. Kane. Algorithmic High-Dimensional Robust Statistics. Cambridge university press, 2023. Full version available at https://sites.google.com/view/ars-book.
$\left[\mathrm{DKK}^{+}22\right]$  I. Diakonikolas, D. M. Kane, V. Kontonis, C. Tzamos, and N. Zarifis. Learning general halfspaces with general massart noise under the gaussian distribution. In STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 874-885, 2022. Full version available at https://arxiv.org/abs/2108.08767.
[DKKZ20] I. Diakonikolas, D. M. Kane, V. Kontonis, and N. Zarifis. Algorithms and SQ lower bounds for PAC learning one-hidden-layer relu networks. In Conference on Learning Theory, COLT 2020, volume 125 of Proceedings of Machine Learning Research, pages 1514–1539. PMLR, 2020.
$\left[\mathrm{DKP}^{+}21\right]$  I. Diakonikolas, D. M. Kane, A. Pensia, T. Pittas, and A. Stewart. Statistical query lower bounds for list-decodable linear regression. In Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, pages 3191-3204, 2021.
[DKPZ21] I. Diakonikolas, D. M. Kane, T. Pittas, and N. Zarifis. The optimality of polynomial regression for agnostic learning under gaussian marginals in the SQ model. In Conference on Learning Theory, COLT 2021, volume 134 of Proceedings of Machine Learning Research, pages 1552–1584. PMLR, 2021.
[DKPZ23] I. Diakonikolas, D. M. Kane, T. Pittas, and N. Zarifis. SQ lower bounds for learning mixtures of separated and bounded covariance Gaussians. In The Thirty Sixth Annual Conference on Learning Theory, COLT 2023, volume 195 of Proceedings of Machine Learning Research, pages 2319-2349. PMLR, 2023.
[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.