The article discusses the empirical success of Generative Adversarial Networks (GANs) and the interest in theoretical research, focusing on Wasserstein GANs. It highlights limitations of Vanilla GANs, introduces an oracle inequality for them in Wasserstein distance, and explores convergence rates for both types of GANs. The analysis extends to neural network discriminators, addressing challenges and improvements in approximation properties.
A otro idioma
del contenido fuente
arxiv.org
Ideas clave extraídas de
by Lea Kunkel,M... a las arxiv.org 03-25-2024
https://arxiv.org/pdf/2403.15312.pdfConsultas más profundas