In plain words: This survey collects results on neural networks in three areas: how well they can fit data, how gradient training finds solutions that generalize, and how generative models work. It shows fast error rates are proven only for ideal best-fit networks, leaving real training unclear.
Abstract · A Survey on Statistical Theory of Deep Learning: Approximation, Training Dynamics, and Generative Models
In this article, we review the literature on statistical theories of neural networks from three perspectives: approximation, training dynamics and generative models. In the first part, results on excess risks for neural networks are reviewed in the nonparametric framework of regression (and classification in Appendix~{\color{blue}B}). These results rely on explicit constructions of neural networks, leading to fast convergence rates of excess risks. Nonetheless, their underlying analysis only applies to the global minimizer in the highly non-convex landscape of deep neural networks. This motivates us to review the training dynamics of neural networks in the second part. Specifically, we review papers that attempt to answer ``how the neural network trained via gradient-based methods finds the solution that can generalize well on unseen data.'' In particular, two well-known paradigms are reviewed: the Neural Tangent Kernel (NTK) paradigm, and Mean-Field (MF) paradigm. Last but not least, we review the most recent theoretical advancements in generative models including Generative Adversarial Networks (GANs), diffusion models, and in-context learning (ICL) in the Large Language Models (LLMs) from two perpsectives reviewed previously, i.e., approximation and training dynamics.
Namjoon Suh, Guang Cheng
arXiv:2401.07187 · stat.ML, cs.LG, math.ST · submitted Jan 14, 2024 · updated Sep 16, 2024
abstract · pdf · html · 38 pages, 2 figures. Invited for review in Annual Review of Statistics and Its Application