WASSERSTEIN GENERATIVE ADVERSARIAL NETWORKS ARE MINIMAX OPTIMAL DISTRIBUTION ESTIMATORS

We provide nonasymptotic rates of convergence of the Wasserstein Generative Adversarial networks (WGAN) estimator. We build neural networks classes representing the generators and discriminators which yield a GAN that achieves the minimax optimal rate for estimating a certain probability measure μ with support in R^p. The probability μ is considered to be the push forward of the Lebesgue measure on the d-dimensional torus T^d by a map g★ : T^d → R^p of smoothness β + 1. Measuring the error with the γ -Hölder Integral Probability Metric (IPM), we obtain up to logarithmic factors, the β+γ 1 minimax optimal rate O(n^{− 2}β+^d ∨ n^{− 2} ) where n is the sample size, β determines the smoothness of the target measure μ, γ is the smoothness of the IPM (γ = 1 is the Wasserstein case) and d ≤ p is the intrinsic dimension of μ. In the process, we derive a sharp interpolation inequality between Hölder IPMs. This novel result of theory of functions spaces generalizes classical interpolation inequalities to the case where the measures involved have densities on different manifolds.