2
votes
What is the reason for mode collapse in GAN as opposed to WGAN?
I don't have a definite answer, but only a suspicion/idea:
Looking at Figure 1 from the WGAN paper, we clear see that the JS divergence on the right is not continuous at $0$, hence not differentiable ...
2
votes
How to calculate the gradient penalty proposed in "Improved Training of Wasserstein GANs"?
First of all, the discriminator in WGAN does not give a value in the range $[0,1]$. Compared to the traditional discriminator, it has a linear activation in the output layer. Therefore, the authors ...
1
vote
What to do with a GAN that trained well but got worse over time?
This is from my own experience with (Vanilla) GANs, so it might not translate exactly to your application, but maybe it gives some orientation.
your learning rate seems quite high. I've quite ...
1
vote
Accepted
Aren't scores in the Wasserstein GAN probabilities?
Figure 3 in the original WGAN paper is actually quite helpful to understand the difference between the score in WGAN and the probability in GAN (see screenshot below). The blue distribution are real ...
1
vote
Do WGAN gradients require multi-variable calculus?
A function can be optimized, even if it has two inputs!
First, note that the problem in question already occurs with traditional GANs as well. It might be easier to understand what is going on if you ...
1
vote
Is Relativistic GAN better than WGAN-GP?
For anyone looking for answer, as explained in Paper: The relativistic discriminator: a key element missing from standard GAN!,
Yes, Standard RaGAN with gradient penalty generate data of better ...
1
vote
What is being optimized with WGAN loss? Is the generator maximizing or minimizing the critic value?
I think I understand what's happening with the loss functions now.
Notation:
D = discriminator/critic
G = generator
D(x) - Critic score on real data
D(G(z)) - Critic score on fake data
∇_D - Critic ...
1
vote
Why do we use a linear interpolation of fake and real data to penalize the gradient of discriminator in WGAN-GP
In [1], section 4, the authors mention the following:
Sampling distribution We implicitly define $p_{\hat{x}}$ sampling uniformly along straight lines between pairs of points sampled from the data ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
wasserstein-gan × 18generative-adversarial-networks × 16
wasserstein-metric × 5
deep-learning × 3
implementation × 3
loss × 3
machine-learning × 2
convolutional-neural-networks × 2
training × 2
papers × 2
gradient × 2
dc-gan × 2
neural-networks × 1
python × 1
terminology × 1
math × 1
generative-model × 1
hyperparameter-optimization × 1
computational-learning-theory × 1
probability × 1
image-generation × 1
convolutional-layers × 1
kl-divergence × 1
constrained-optimization × 1
sample-efficiency × 1