We study in this paper the rate of convergence for learning distributions with the Generative Adversarial Networks (GAN) framework, which subsumes Wasserstein, Sobolev and MMD GANs as special cases. We study a wide range of parametric and nonparametric target distributions, under a collection of objective evaluation metrics. On the nonparametric end, we investigate the minimax optimal rates and fundamental difficulty of the density estimation under the adversarial framework. On the parametric end, we establish theory for neural network classes, that characterizes the interplay between the choice of generator and discriminator. We investigate how to improve the GAN framework with better theoretical guarantee through the lens of regularization. We discover and isolate a new notion of regularization, called the \textit{generator/discriminator pair regularization}, that sheds light on the advantage of GAN compared to classic parametric and nonparametric approaches for density estimation.

本论文研究了生成性对抗网络（GANs）的收敛速率和损失函数，探讨了在不同参数和非参数条件下的目标分布，都能通过GANs进行逼近， 建立了基于生成器和判别器的正则化理论，提出了生成器-判别器对正则化的新概念，为分布估计提供了有效的统计保证。

生成对抗网络学习分布的效果