arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.02682cs.LGstat.ML
收藏

Wasserstein GANs的一些理论见解

Some Theoretical Insights into Wasserstein GANs

Sorbonne Université(索邦大学);Criteo AI Lab(科睿唯安人工智能实验室)

Gérard Biau, Maxime Sangnier, Ugo Tanielian

摘要:

生成对抗网络(GANs)在图像、视频和文本生成等不同领域都取得了出色的成果。在这些成功的基础上,大量的实证研究已经验证了称为Wasserstein GANs(WGANs)的表亲方法的好处,它在训练过程中带来了稳定性。在本文中,我们通过提出WGAN性质的一些理论进展,为建筑物添加了一块新的石头。首先,我们在由神经网络参数化的积分概率度量的背景下正确定义了WGAN的架构,并强调了它们的一些基本数学特征。我们强调特别有趣的优化性能所产生的使用参数1-Lipschitz的。然后,在一种由经验驱动的方法中,我们研究了当样本大小趋于无穷大时经验WGAN的收敛性,并通过强调一些权衡性质来澄清生成器和迭代器的对抗效应。这些功能最后说明了使用合成和真实世界的数据集的实验。

英文摘要:

Generative Adversarial Networks (GANs) have been successful in producing outstanding results in areas as diverse as image, video, and text generation. Building on these successes, a large number of empirical studies have validated the benefits of the cousin approach called Wasserstein GANs (WGANs), which brings stabilization in the training process. In the present paper, we add a new stone to the edifice by proposing some theoretical advances in the properties of WGANs. First, we properly define the architecture of WGANs in the context of integral probability metrics parameterized by neural networks and highlight some of their basic mathematical features. We stress in particular interesting optimization properties arising from the use of a parametric 1-Lipschitz discriminator. Then, in a statistically-driven approach, we study the convergence of empirical WGANs as the sample size tends to infinity, and clarify the adversarial effects of the generator and the discriminator by underlining some trade-off properties. These features are finally illustrated with experiments using both synthetic and real-world datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑