Transcription of Wasserstein Generative Adversarial Networks
{{id}} {{{paragraph}}}
Wasserstein Generative Adversarial NetworksMartin Arjovsky1 Soumith Chintala2L eon Bottou1 2 AbstractWe introduce a new algorithm named WGAN,an alternative to traditional GAN training. Inthis new model, we show that we can improvethe stability of learning, get rid of problems likemode collapse, and provide meaningful learningcurves useful for debugging and hyperparametersearches. Furthermore, we show that the cor-responding optimization problem is sound, andprovide extensive theoretical work highlightingthe deep connections to different distances be-tween IntroductionThe problem this paper is concerned with is that of unsu-pervised learning.
Wasserstein Generative Adversarial Networks the other hand, training GANs is well known for being del-icate and unstable, for reasons theoretically investigated in (Arjovsky & Bottou,2017). In this paper, we direct our attention on the various ways to measure how close the model distribution and the real dis-
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}