$\left[\mathrm{MHPG}^{+}23\right]$  Alireza Mousavi-Hosseini, Sejun Park, Manuela Girotti, Ioannis Mitlagkas, and Murat A Erdogdu. Neural networks efficiently learn low-dimensional representations with sgd. International Conference on Learning Representations, 2023.
[MHWSE23] Alireza Mousavi-Hosseini, Denny Wu, Taiji Suzuki, and Murat A. Erdogdu. Gradient-based feature learning under structured data. In Thirty-seventh Conference on Neural Information Processing Systems (NeurIPS 2023), 2023.
[Min17] Stanislav Minsker. On some extensions of Bernstein's inequality for self-adjoint operators. Statistics & Probability Letters, 127:111-119, 2017.
[MM22] Song Mei and Andrea Montanari. The generalization error of random features regression: Precise asymptotics and the double descent curve. Communications on Pure and Applied Mathematics, 75(4):667-766, 2022.
[MMM21] Song Mei, Theodor Misiakiewicz, and Andrea Montanari. Generalization error of random feature and kernel methods: hypercontractivity and kernel matrix concentration. Applied and Computational Harmonic Analysis, 2021.
[Rah17] Sharif Rahman. Wiener-hermite polynomial expansion for multivariate gaussian probability measures. Journal of Mathematical Analysis and Applications, 454(1):303-334, 2017.
[RGKZ21] Maria Refinetti, Sebastian Goldt, Florent Krzakala, and Lenka Zdeborova. Classifying high-dimensional gaussian mixtures: Where kernel methods fail and neural networks succeed. In International Conference on Machine Learning, pages 8936-8947. PMLR, 2021.
[Sam23] Holger Sambale. Some notes on concentration for  $\alpha$ -subexponential random variables. In High Dimensional Probability IX: The Ethereal Volume, pages 167-192. Springer, 2023.
[SS02] Bernhard Schölkopf and Alexander J Smola. Learning with kernels: support vector machines, regularization, optimization, and beyond. MIT press, 2002.
[Sze39] Gabor Szeg. Orthogonal polynomials, volume 23. American Mathematical Soc., 1939.
[TV23] Yan Shuo Tan and Roman Vershynin. Online stochastic gradient descent with arbitrary initialization solves non-smooth, non-convex phase retrieval. Journal of Machine Learning Research, 24(58):1-47, 2023.
[Ver10] Roman Vershynin. Introduction to the non-asymptotic analysis of random matrices. arXiv preprint arXiv:1011.3027, 2010.
[Ver18] Roman Vershynin. High-dimensional probability: An introduction with applications in data science, volume 47. Cambridge university press, 2018.
[WZ21] Zhichao Wang and Yizhe Zhu. Deformed semicircle law and concentration of nonlinear random matrices for ultra-wide neural networks. arXiv preprint arXiv:2109.09304, 2021.
[WZ23] Zhichao Wang and Yizhe Zhu. Overparameterized random feature regression with nearly orthogonal data. In International Conference on Artificial Intelligence and Statistics, pages 8463-8493. PMLR, 2023.
$\left[\mathrm{XHM}^{+}22\right]$  Lechao Xiao, Hong Hu, Theodor Misiakiewicz, Yue Lu, and Jeffrey Pennington. Precise learning curves and higher-order scalings for dot-product kernel regression. Advances in Neural Information Processing Systems, 35:4558-4570, 2022.
[YS19] Gilad Yehudai and Ohad Shamir. On the power and limitations of random features for understanding neural networks. Advances in Neural Information Processing Systems, 32, 2019.
[Zhi21] Nikita Zhivotovskiy. Dimension-free bounds for sums of independent matrices and simple tensors via the variational principle. arXiv preprint arXiv:2108.08198, 2021.