Donate
Donate
Improved Training of Wasserstein GANs
Add an identifier
Thank You!
Abstract: Generative Adversarial Networks (GANs) are powerful generative models, but
suffer from training instability. The recently proposed Wasserstein GAN (WGAN)
makes progress toward stable training of GANs, but sometimes can still generate
only low-quality samples or fail to converge. We find that these problems are
often due to the use of weight clipping in WGAN to enforce a Lipschitz
constraint on the critic, which can lead to undesired behavior. We propose an
alternative to clipping weights: penalize the n ...
2
votes
0
answers
851
views
Recent Votes
Recent Awards •
All
Invitee to
Yuval Filmus
▴
15
Founding Contributor to
FrankS
▴
55
Invitee to
marco.fellous-asiani
▴
15
Founding Contributor to
Ken
▴
45
Recent Replies
Answer: When a question is asked about a paper, are the authors contacted?
by
Andy
46
It depends.
**Authors that are registered users:**
If an author of the paper is
- a registered user,
- known to be the author (se…
Answer: How to write a good question?
by
Andy
46
There are no hard rules criteria for what makes a "good" post. The most important thing is that it either contains **information that's us…
Answer: Implementing an algorithm
by
Andy
46
Use a distibution that's symmetric around the origin and normalize the results so they lie on the sphere. E.g. you can use a Gaussian. He…
Answer: Application of Property RD
by
Dustin
125
It is used to prove the bound in proposition 4.6 which is then used crucially in proposition 4.7 to prove the uniform boundedness of the op…
Traffic: 4 users visited in the last hour