D ISTRIBUTIONAL A DVERSARIAL N ETWORKS
Anonymous authors
Paper under double-blind review
A BSTRACT
In most current formulations of adversarial training, the discriminators can be expressed as single-input operators, that is, the mapping they deﬁne is separable over observations.
In this work, we argue that this property might help explain the infamous mode collapse phenomenon in adversarially-trained generative models.
Inspired by discrepancy measures and two-sample tests between probability distributions, we propose distributional adversaries that operate on samples, i.e., on sets of multiple points drawn from a distribution, rather than on single observations.
We show how they can be easily implemented on top of existing models.
Various experimental results show that generators trained in combination with our distributional adversaries are much more stable and are remarkably less prone to mode collapse than traditional models trained with observation-wise prediction discriminators.
In addition, the application of our framework to domain adaptation results in strong improvement over recent state-of-the-art.
I NTRODUCTION
Adversarial training of neural networks, especially Generative Adversarial Networks (GANs) (Goodfellow et al., 2014), has proven to be a powerful tool for learning rich models, leading to outstanding results in various tasks such as realistic image generation, text to image synthesis, 3D object generation, and video prediction (Reed et al., 2016; Wu et al., 2016; Vondrick et al., 2016).
Despite their success, GANs are known to be difﬁcult to train.
The generator and discriminator can oscillate signiﬁcantly from iteration to iteration, and slight imbalances in their capacities frequently cause the training objective to diverge.
Another common problem suffered by GANs is mode collapse , where the distribution learned by the generator concentrates on a few modes of the true data distribution, ignoring the rest of the space.
In the case of images, this failure results in generated images that albeit realistic, lack diversity and reduce to a handful of prototypes.
A ﬂurry of recent research seeks to understand and address the causes of instability and mode collapse in adversarially-trained models.
The ﬁrst insights come from Goodfellow et al.
(2014), who note that one of the main causes of training instability is saturation of the discriminator.
Arjovsky & Bottou (2017) formalize this idea by showing that if the two distributions have supports that are disjoint or concentrated on low-dimensional manifolds that do not perfectly align, then there exists an optimal discriminator with perfect classiﬁcation accuracy almost everywhere and the usual divergences (Kullback-Leibler, Jensen-Shannon) max-out for this discriminator.
In follow-up work, Arjovsky et al.
(2017) propose an alternative training scheme based on estimating Wasserstein distance (WGAN) instead of the Jensen-Shannon divergence between real and generated distributions.
In this work, we highlight a further view on mode collapse.
The discriminator part of GANs and of variations like WGANs is separable over observations, which, as we will illustrate, can result in serious problems, even when minibatches are used.
The underlying issue is that the stochastic gradients are essentially (sums of) functions of single observations (training points).
Despite connections to two-sample tests based on Jensen-Shannon divergence, ultimately the updates based on gradients from different single observations are completely independent of each other.
We show how this lack of sharing information between observations may explain mode collapses in GANs.
Motivated by these insights, we take a different perspective on adversarial training and propose a framework that brings the discriminator closer to a truly distributional adversary, i.e., one that considers a sample 1 (a set of observations) in its entirety, retaining and sharing global information between gradients.
The key insight is that a carefully placed nonlinearity in the form of speciﬁc population comparisons can enable information-sharing and thereby stabilize training.
We develop and test two such models, and also connect them to other popular ideas in deep learning and statistics.
Contributions.
The main contributions of this work are as follows:
• We introduce a new distributional framework for adversarial training of neural networks that operates on a genuine sample ,
i
e., a collection of points, rather than an observation.
This choice is orthogonal to modiﬁcations of the types of loss (e
g. logistic vs. Wasserstein) in the literature.
• We show how off-the-shelf discriminator networks can be made distribution-aware via simple modiﬁcations to their architecture and how existing models can seamlessly ﬁt into this framework.
• Empirically, our distributional adversarial framework leads to more stable training and signiﬁcantly better mode coverage than common single-observation methods.
A direct application of our framework to domain adaptation results in strong improvements over state-of-the-art.
F AILURE OF S INGLE -O BSERVATION D ISCRIMINATORS
To motivate our distributional approaches, we illustrate with the example of the original GAN how training with single-observation-based adversaries might lead to an unrecoverable mode collapse in the generator.
The objective function for a GAN with generator G and discriminator D is
[Equation]
where D : R d → [0 , 1] maps an observation to the probability that it comes from data distribution P x , and G : R l → R d is a network parametrized by θ G that maps a noise vector z ∈ R l , drawn from a simple distribution P z , to the original data space.
The aim of G is to make the distribution P G of its generated outputs indistinguishable from the training distribution.
In practice, G is trained to instead maximize log D ( G ( z )) to prevent loss saturation early in the training.
Goodfellow et al.
(2014) showed that the discriminator converges in the limit to D ∗ ( x ) =
P x ( x ) /
( P x ( x ) + P G ( x )) for a ﬁxed G .
In this limit, given a sample Z = { z (1) , . . .
, z ( B ) } from the noise distribution P z , the gradient of G ’s loss with respect to its parameters θ G is
[Equation]
where we slightly abuse the notation ddθ G G to denote G ’s Jacobian matrix.
Thus, the gradient with respect to each observation is weighted by terms of the form ∇ D ( x ( i ) G ) /D
( x ( i ) G ) , where x ( i ) G :=
G ( z ( i ) ) .
These terms can be interpreted as relative slopes of the discriminator’s conﬁdence function.
Their magnitude and sign depend on dDdx G (the slope of D around x G ) and on D ( x G ) , the conﬁdence that x G is drawn from P x .
In at least one notable case this ratio is unambiguously low: values of x where the discriminator has high conﬁdence of real samples and ﬂat slope.
This implies that given the deﬁnition of D ∗ , the weighting term will vanish in regions of the space where the generator’s distribution has constant, low probability compared to the real distribution, such as neighborhoods of the support of P x where P G is missing a mode.
Figure 1 exempliﬁes this situation for a simple case in 1D where the real distribution is bimodal and the generator’s distribution is currently concentrated around one of the modes.
The cyan dashed line is the weighting term ∇ D ( x G ) /D
( x G ) , conﬁrming our analysis above that gradients for points around the second mode will vanish.
The effect of this vanishing of mode-seeking gradients during training is that it prevents G from spreading mass to other modes, particularly to distant ones.
Whenever G does generate a point in a region far from where most of its mass is concentrated (an event that by deﬁnition already occurs with low probability), this example’s gradient (that would update G ’s parameters to move mass to this region) will be heavily down-weighted and therefore dominated by high-weighted gradients of other examples in the batch, such as those in spiked high-density regions.
The result is a catastrophic averaging-out .
A typical run of a GAN suffering from this phenomenon on a simple distribution is shown in Figure 2 (top row), where the generator keeps generating points from the same mode across the training procedure and is unable to recover from mode collapse.
[Figure]
At a high level, this mode-collapsing phenomenon is a consequence of a myopic discriminator that bases its predictions on a single observation, leading to gradients that are not harmonized by global information.
2 Discriminators that instead predict based on an entire sample are a natural way to address this issue (Figure 2, bottom two rows), as we will show in the remainder of this work.
D ISTRIBUTIONAL A PPROACHES TO A DVERSARIAL T RAINING
To mitigate the above noted failure, we seek a discriminator that considers a sample (multiple observations) instead of a single observation when predicting whether the input is from P x .
More concretely, our discriminator is a set function M : 2 R d → R that operates on a sample { x (1) , . . .
, x ( B ) } of potentially varying size.
Next, we construct this discriminator step by step.
3. D ISTRIBUTIONAL A DVERSARIES
Neural Mean Embedding.
Despite its simplicity, the mean is a surprisingly useful statistic for discerning between distributions, and is central to the Maximum Mean Discrepancy (MMD)
(Gretton et al., 2005; Fukumizu et al., 2008; Smola et al., 2007), a powerful discrepancy measure between distributions that enjoys strong theoretical properties.
Instead of designing a kernel explicitly as in MMD, here we learn it in a fully data-driven fashion.
Speciﬁcally, we deﬁne a neural mean embedding (NME) η , where φ is learned as a neural network:
[Equation]
In practice, η only has access to P through samples of ﬁnite size { x ( i ) }
Bi =1 ∼ P , thus one effectively uses the empirical estimate
[Equation]
This distributional encoder forms one pillar of our adversarial learning framework.
We propose two alternative adversary models that build on this NME to discriminate between samples and produce a rich training signal for the generator.
Sample Classiﬁer.
First, we combine the NME with a classiﬁer to build a discriminator for adversarial training.
That is, given an empirical estimate (cid:98) η ( X ) from a sample X (drawn from the real data
P x or the generated distribution P G ), the classiﬁer ψ S outputs 1 to indicate the sample was drawn from P x and 0 otherwise.
Scoring the discriminator’s predictions via the logistic loss leads to the following value function for the adversarial game:
[Equation]
where X and Z are samples from P x and P z respectively, and D S ( · )
= ψ S ◦ (cid:98) η ( · ) is the full discriminator (NME and classiﬁer), which we refer to as the sample classiﬁer .
Eq.
(3.3) is similar to the original GAN objective (2.1), but differs in a crucial aspect: here, the expectation is inside ψ S , and the classiﬁer is only predicting one label for the entire sample instead of one label for each observation.
In other words, while in a GAN D operates on single observations and then aggregates its predictions, here D S ﬁrst aggregates the sample and then operates on this aggregated representation.
Two-sample Discriminator.
Inspired by two-sample tests, we propose to shift from a classiﬁcation to a discrepancy objective, that is, given two samples X, Z drawn independently, the discriminator predicts whether they are drawn from the same or different distributions.
Concretely, given two
NMEs η ( P 1 ) and η ( P 2 ) , the two-sample discriminator ψ 2 S uses their absolute difference to output ψ 2 S ( | η ( P 1 ) − η
( P 2 ) | ) ∈ [0 , 1] , interpreted as the conﬁdence that the two samples were indeed drawn from different distributions.
Again with the logistic loss, we arrive at the objective function
[Equation]
where we split each of the two samples X and Z into halves ( X 1 , X 2 from X and Z 1 , Z 2 from Z ), and the second line evaluates the discrepancy between the two parts of the same sample, respectively.
As before, we use D 2 S ( · , · )
=
ψ 2 S ◦ | (cid:98) η ( · ) − (cid:98) η ( · ) | to denote the full model and refer to it as a two-sample discriminator .
Choice of Objective Function.
Despite many existing adversarial objective functions in the literature (Mao et al., 2016; Arjovsky et al., 2017; Mroueh & Sercu, 2017; Bellemare et al., 2017;
Li et al., 2017; Mroueh et al., 2017), here we use the logistic loss to keep the presentation simple, to control for varying factors and to extract the effect of just our main contribution: namely, that the adversary is distribution-based and returns only one label per sample, a crucial departure from existing, single-observation adversary models such as the well-understood vanilla GAN.
This choice is orthogonal to modiﬁcations of the types of loss (e.g., logistic vs. Wasserstein).
It can, indeed, be seamlessly combined with most existing models to enhance their ability to match distributions.
3. D ISTRIBUTIONAL A DVERSARIAL N ETWORKS
We use the novel distributional adversaries proposed above in a new training framework that we name Distributional Adversarial Network (DAN) .
This framework can easily be combined with existing adversarial training algorithms by a simple modiﬁcation of their adversaries.
In this section, we examine in detail an example application of DAN to the generative adversarial setting.
In the experiments section we provide an additional application to adversarial domain adaptation.
Using distributional adversaries within the context of GANs yields a saddle-point problem analogous to the original GAN (2.1):
[Equation]
where ξ ∈ { S, 2 S } and the objective function V ξ is either (3.3) or (3.4); we refer to these as DAN- ξ .
As with GAN, we can optimize (3.5) via alternating updates on G and D ξ .
Although optimizing (3.5) directly yields generators with remarkable performance in simple settings (see empirical results in Section 5.1), when the data distribution is complex, the distributional adversaries proposed here can easily overpower G , particularly early in the training when P G and P x differ substantially.
Thus, we propose to optimize instead a regularized version of (3.5):
[Equation]
where D is a weaker single-observation discriminator (e.g., the one in the original GAN), and λ is a parameter that trades off the strength of this regularization.
Note that for λ → ∞ we recover the original GAN objective, while λ = 0 yields the purely distributional loss (3.5).
In between these two extremes, the generator receives both local and global training signals for every generated sample.
We also show empirically that DAN training is stable across a reasonable range of λ (Appendix B).
During training, all expectations with respect to data and noise distributions are approximated via ﬁnite sample averages.
In each training iteration, we draw samples from the data and noise distributions.
While for DAN-S the training procedure is similar to that of GAN, DAN-2S requires a modiﬁed training scheme.
Due to the form of the two-sample discriminator, we want a balanced exposure to pairs of samples drawn from the same and different distributions.
Thus, every time we update D 2 S , we draw samples X
= { x (1) , . . .
, x ( B ) } ∼ P x and Z = { z (1) , . . . ,
z ( B ) } ∼ P z from data and noise distributions.
We then split each sample into two parts, X 1 :=
{ x ( i ) } B 2 i =1 , X 2 =
{ x ( i ) }
Bi = B 2 +1 , Z 1 :=
{ z ( i ) }
B 2 i =1 , Z 2 = { z ( i ) }
Bi
= B 2 +1 and use the discriminator D 2 S to predict on each pair of ( X 1 , G ( Z 2 )) , ( G ( Z 1 ) , X 2 ) , ( X 1 , X 2 ) and ( G ( Z 1 ) , G ( Z 2 )) with target outputs 1 , 1 , 0 and 0 , respectively.
A detailed training procedure and its visualization are shown in Appendix A.
G RADIENT WEIGHT SHARING IN DISTRIBUTIONAL ADVERSARIES
We close this section discussing why the distributional adversaries overcome the vanishing gradients phenomenon described in Section 2.
In the case of the sample classiﬁer ( ξ = S ), a derivation as in
Section 2 shows that for a sample Z of B points from the noise distribution, the gradient of the loss with respect to G ’s parameters is
[Equation]
where we use (cid:98) η B := (cid:98) η ( { G ( z (1) ) , . .
, G ( x ( B ) ) } ) for ease of notation.
Note that, as opposed to (2.2), the gradient for each variable z
( i ) is weighted by the same left-most discriminator conﬁdence term.
This has the effect of sharing information across observations when computing gradients: whether a sample (encoded as a vector (cid:98) η B ) can fool the discriminator or not will have an effect on every observation’s gradient.
The beneﬁt is clearly revealed in Figure 2 (bottom two rows), where, in contrast to the vanilla GAN which remains stuck in mode collapse, DAN is able to recover all modes.
The gradient (3.7) suggests that the true power of this sample-based setting lies in choosing a discriminator ψ S that, through non-linearities, enforces interaction between the points in the sample.
The notion of sharing information across examples occurs also in batch normalization (BN) (Ioffe &
Szegedy, 2015), although the mechanism to achieve this interaction and the underlying motivation for doing it are very different.
While the analysis here is not rigorous, the intuitive justiﬁcation for sample-based aggregation is clear, and is conﬁrmed by our experimental results.
C ONNECTIONS
Distributional Adversaries as Discrepancy Measures.
Our sample classiﬁer implicitly deﬁnes a general notion of discrepancy between distributions:
[Equation]
for some function classes Ψ and Ξ , a monotone function ρ : R → R , and constant c .
This generalized discrepancy includes many existing adversarial objectives as special cases.
For example, if ρ and ψ S are constant functions, Ξ the space of 1-Lipschitz functions and η an embedding into R , we obtain the 1-Wasserstein distance used by WGAN (Arjovsky et al., 2017; Gulrajani et al., 2017).
Similarly, our two-sample discriminator implicitly deﬁnes the following discrepancy:
[Equation]
where ψ, Ξ are as before.
This form can be thought of as generalizing other discrepancy measures like MMD (Gretton et al., 2005; Fukumizu et al., 2008; Smola et al., 2007), deﬁned as:
[Equation]
where φ ( · ) is some feature mapping, and k ( u, v )
=
φ ( u ) (cid:62) φ ( v ) is the corresponding kernel function.
Letting φ be the identity function corresponds to computing the distance between the sample means.
More complex kernels result in distances that use higher-order moments of the two samples.
In adversarial models, MMD and its variants (e.g., central moment discrepancy) have been used either as a direct objective for the target model or as a form of adversary (Zellinger et al., 2017; Sutherland et al., 2017; Li et al., 2015; Dziugaite et al., 2015).
However, most of them require hand-picking the kernel.
An adaptive feature function, in contrast, may be able to adapt to the given distributions and thereby discriminate better.
Our distributional adversary addresses this drawback and, at the same time, generalizes MMD, owing to the fact that neural networks are universal approximators.
Since it is trainable, the underlying witness function evolves as training proceeds, taking a simpler form when the two distributions (generated and true data) are easily distinguishable, and becoming more complex as they start to resemble.
In this sense our distributional adversary bears similarity to the recent work by Li et al.
However, their learned sample embedding is input into a Gaussian kernel to compute the MMD, inheriting the quadratic time complexity (in sample size) of kernel
MMD.
Our model uses a neural network on top of the mean embedding differences to compute the discrepancy, resulting in linear time complexity and additional ﬂexibility.
A more general family of discrepancy measures of interest in the GAN literature are Integral Probability Metrics (IPM), deﬁned as
[Equation]
where F is a set of measurable and bounded real valued functions.
Comparing this to Eq.
(4.1) shows that our two-sample discriminator discrepancy generalizes IPMs too.
In this sense, our model is also connected to GAN frameworks based on IPMs (Mroueh & Sercu, 2017; Mroueh et al., 2017).
Minibatch Discrimination.
Initiated by (Salimans et al., 2016) to stabilize training, a line of work in the GAN literature considers statistics of minibatches to train generative models, known as minibatch discrimination .
Batch normalization (Ioffe & Szegedy, 2015) can be viewed as a form of minibatch discrimination, and is known to aid GAN training (Radford et al., 2015).
Zhao et al.
(2017) proposed a repelling regularizer that operates on a minibatch and orthogonalizes the pairwise sample representation, keeping the model from concentrating on only a few modes.
We derive our adversaries as acting on full distributions instead of batches, but approximate population expectations with samples in practice.
In this sense, our implementation can be viewed as generalizing minibatch discrimination: we leverage neural networks for the design of different forms of minibatch discrimination.
Such discrimination does not need hand-crafted objectives as in existing work, and will be able to adapt to the data distribution and target models.
Permutation Invariant Networks.
The NME (3.2) is a permutation invariant operator on (unordered) samples.
Recent work has explored neural architectures that operate on sets and are likewise invariant to permutations on their inputs.
Vinyals et al.
(2016) propose a content attention mechanism for unordered inputs of variable length.
Later work (Ravanbakhsh et al., 2017; Zaheer et al., 2017) embeds all samples into a ﬁxed-dimensional latent space, and then sums them to obtain a ﬁxeddimensional vector representation, used as input to another network.
Liu et al.
(2017) use a similar network for embedding a set of images into a latent space, but aggregate using a (learned) weighted sum.
Although the structure of our NEM resembles these networks in terms of permutation invariance, it differs in its motivation—discrepancy measures—as well as its usage within discriminators in adversarial training settings.
Other Related Work.
Various other approaches have been proposed to address training instability and mode collapse in GANs.
Many such methods resort to more complex network architectures or better-behaving objectives (Radford et al., 2015; Huang et al., 2017; Zhang et al., 2016;
Che et al., 2017; Zhao et al., 2017; Arjovsky et al., 2017), while others add more discriminators or generators (Durugkar et al., 2017; Tolstikhin et al., 2017) in the hope that training signals from multiple sources lead to more stable training and better mode coverage.
E MPIRICAL R ESULTS
We demonstrate the effectiveness of DAN training by applying it to generative models and domain adaptation.
In generative models, we observe remarkably better mode recovery than nondistributional models on both synthetic and real datasets, through both qualitative and quantitative evaluation of generated samples.
In domain adaptation, we leverage distributional adversaries to align latent spaces of source and target domains, and see strong improvements over state-of-the-art.
5. S YNTHETIC D ATA : M ODE R ECOVERY IN M ULTIMODAL D ISTRIBUTIONS
We ﬁrst test DAN in a simple generative setting, where the true data distribution is a simple twodimensional mixture of Gaussians.
A similar task was used as a proof of concept for mode recovery by Metz et al.
We generate a mixture of four Gaussians with means equally spaced on a circle of radius 6 , and variances of 0 .
We compare our distributional adversaries against various discriminator frameworks, including GAN, WGAN (Arjovsky et al., 2017) and WGAN-GP (Gulrajani et al., 2017).
We use equivalent 4 simple feed-forward networks with ReLU activations for all discriminators.
For these synthetic distributions, we use the pure distributional objective for DAN (i.e., setting λ (cid:54) = 0 in (3.5)).
Figure 2 displays the results for GAN and our methods; in the appendix, we show results for other models, different λ settings and other synthetic distributions.
Overall, while other methods suffer from mode collapse throughout (GAN) or are sensitive to network architectures and hyperparameters (WGAN, WGAN-GP), our DANs consistently recover all modes of the true distribution and are stable across a reasonable range of λ ’s.
5. MNIST G ENERATION : R ECOVERING M ODE F REQUENCIES
Mode recovery entails not only capturing a mode, i.e., generating samples that lie in the corresponding mode, but also recovering the true probability mass of the mode.
Next, we evaluate our model on this criterion: we train DAN on MNIST and Fashion-MNIST (Xiao et al., 2017), both of which have 10-class balanced distributions.
Since the generated samples are unlabeled, we train an external classiﬁer on (Fashion-)MNIST to label the generated data.
Besides the original GAN, we compare to four recently proposed generative models: RegGAN (Che et al., 2017), EBGAN (Zhao et al., 2017), WGAN (Arjovsky et al., 2017) and its variant WGANGP (Gulrajani et al., 2017).
To keep the approaches comparable, we use a similar neural network architecture in all cases, and did not tailor it to any particular model.
We trained models without
Batch Normalization (BN), except for RegGAN and EBGAN, which we observed to consistently beneﬁt from BN.
For DAN, we use the the regularized objective (3.5) with λ > 0 .
Both adversaries in this formulation use the same architecture except for the averaging layer of the distributional adversary, and share weights of the pre-averaging layers.
Figure 3 shows the results.
Training with the vanilla GAN and RegGAN leads to generators that place too much mass on some modes and ignore others, leading to a large Total Variation distance between the generated label distribution and the correct one.
EBGAN and WGAN perform slightly worse than
WGAN-GP and DAN on MNIST, and signiﬁcantly worse on the (harder) Fashion-MNIST dataset.
WGAN-GP performs on par with DAN on MNIST, and slightly worse than DAN on Fashion-MNIST.
Moreover, WGAN-GP is in general more sensitive to hyperparameter selection (Appendix).
5. I MAGE G ENERATION : S AMPLE D IVERSITY AS E VIDENCE OF M ODE C OVERAGE
We also test DAN on a harder task, generating faces, and compare against the samples generated by DCGAN.
The generated examples in Figure 4 show that DCGAN+BN exhibits an obvious
R e g G
A N G A N
E B G A
N
W G A N
W G A N - G P
D A N - S
D A NS 0.
T o t a l
V a r i a t i o n (a) MNIST
R e g G
A N G A N
E B G A
N
W G A N
W G A N - G P
D A N - S
D A NS 0.
T o t a l
V a r i a t i o n (b) Fashion-MNIST
[Figure]
mode-collapse, with most faces falling into a few clusters.
DCGAN without BN generates better images, but they still lack feature diversity (e.g., backgrounds, hairstyle).
The images generated by DAN, in contrast, exhibit a much richer variety of features, indicating a better coverage of the data distribution’s modes.
5. D OMAIN A DAPTATION
In the last set of experiments, we test DAN in the context of domain adaptation.
We compare against
DANN (Ganin et al., 2016), an adversarial training algorithm for domain adaptation that uses a domain-classiﬁer adversary to enforce similar source and target representations, thus allowing for the source classiﬁer to be used in combination with the target encoder.
We use the DAN framework to further encourage distributional similarities between representations from different domains.
We ﬁrst compare the algorithms on the Amazon reviews dataset preprocessed by Chen et al.
It consists of four domains: books, dvd, electronics and kitchen appliances, each of which contains reviews encoded in 5,000-dimensional feature vectors and binary labels indicating positive/negative reviews.
Results are shown in Table 1.
Our models outperform the GAN-based DANN on most source-target pairs, with an average improvement in accuracy of 1 .
41% for DAN-S and 0 .
92% for
DAN-2S. Note that we directly integrated DAN without any network structure tuning – we simply set the network structure of the distributional adversary to be the same as that of original discriminator in
DANN (except that it takes an average of latent representations in the middle).
[Table]
Lastly
[Table]
we test the effectiveness of DAN on a domain adaptation task for image label prediction.
The task is to adapt from MNIST to MNIST-M (Ganin et al., 2016), which is obtained by blending digits over patches randomly extracted from color photos from BSDS500 (Arbelaez et al., 2011).
The results are shown in Table 2.
DAN-S improves over DANN by ∼ 5% .
Again, these results were obtained by simply plugging in the DAN objective, demonstrating the ease of using DAN.
[Table]
D ISCUSSION AND F UTURE W ORK
In this work, we propose a distributional adversarial framework that, as opposed to common approaches, does not rely on a sum of observation-wise functions, but considers a sample (collection of observations) as a whole.
We show that when used within generative adversarial networks, this different approach to distribution discrimination has a stabilizing effect and remedies the well-known problem of mode collapse.
One likely reason for this is its ability to share information across observations when computing gradients.
The experimental results obtained with this new approach offer a promising glimpse of the advantages of genuine sample-based discriminators over common alternatives that are separable over observations, while the simplicity and ease of implementation make this approach an appealing plug-in, easily compatible with most existing models.
The framework proposed here is fairly general and opens the door for various possible extensions.
The two types of discriminators proposed here are by no means the only options.
There are many other approaches in the distributional discrepancy literature to draw inspiration from.
One aspect that warrants additional investigation is the effect of sample size on training stability and mode coverage.
It is sensible to expect that in order to maintain global discrimination power in settings with highly multimodal distributions, the size of samples fed to the discriminators should grow, at least with the number of modes.
Formalizing this relationship is an interesting avenue for future work.
A T RAINING FOR DAN
We show the complete training procedure for DAN in Algorithm 1 and a visual illustration in Figure 5.
Note that we set a step number k such that every other k iterations we update the distributional adversary, otherwise we update the single-observation adversary.
Algorithm 1 Training Procedure for DAN-S/2S.
Input: total number of iterations T , size of minibatch B , step number k , model mode ξ ∈ { S, 2 S } for i = 1 to T do
Draw samples X
= { x (1) , . . .
, x ( B ) } ∼ P x , Z = { z (1) , . . .
, z ( B ) } ∼ P z if mod ( i, k )
=
and λ 1 > 0 then if ξ = S then
Update distributional adversary D S
= { ψ S , η } with one gradient step on loss: log( ψ S ( η ( X )))
+ log(1 − ψ S ( η ( G ( Z )))) else if ξ = 2 S then
Divide X and Z evenly into X 1 , X 2 and Z 1 , Z 2 respectively
Update distributional adversary D 2 S
= { ψ 2 S , η } with one gradient step on loss: log( ψ 2 S ( | η ( X 1 ) − η
( X 2 ) | ))
+ log( ψ 2 S ( | η ( G ( Z 1 ))
− η ( G ( Z 2 )) | ))
+ log(1 − ψ 2 S ( | η ( X 1 ) − η
( G ( Z 2 )) | ))
+ log(1 − ψ 2 S ( | η ( G ( Z 1 ))
− η ( X 2 ) | )) end if else if λ 2 > 0 then
Update discriminator D with one gradient step on loss:
B
B (cid:88) i = (cid:104) log( D ( x ( i ) ))
+ log(1 − D ( G ( z ( i ) )))
(cid:105) end if
Draw samples X
= { x (1) , . . .
, x ( B ) } ∼ P x , Z = { z (1) , . . .
, z ( B ) } ∼ P z if ξ = S then
Update G with gradient step on loss:
[Equation]
else if ξ = 2 S then
Divide X and Z into X 1 , X 2 and Z 1 , Z
Update G with gradient step on loss:
[Equation]
end if end for
B F URTHER R ESULTS ON S YNTHETIC D ATASET
We ﬁrst show the full result for mode recovery when the true data distribution is a mixture of
Gaussians with variances of 0 .
02 on a circle of radius 6 .
The generator consists of a fully connected network with 3 hidden layers of size 128 with ReLU activations, followed by a linear projection todimensions.
The discriminator consists of a fully connected network with 3 hidden layers of sizewith ReLU activations, followed by a linear projection to 1 dimension.
Latent vectors are sampled
G Deep Mean Encoder
S
S 2 S 2 S 2 S 2 S ⌘ ⌘
Z
G ( Z )
X ⌘ ( G ( Z ))
⌘ ( X ) ⇠ ⌘ ( G ( P z ))
⇠ ⌘ ( P x ) ⌘ ( G ( Z 1 ) )
⌘ ( G ( Z 2 ) )
⌘
( X 1 ) ⌘ ( X 2 ) loss (0 , D S ( G ( Z ))) loss (1 , D S ( X )) loss (0 , D 2 S ( G ( Z 1 ) , G ( Z 2 )))
loss (1 , D 2 S ( G ( Z 1 ) , X 1 )) loss (1 , D 2 S ( G ( Z 2 ) , X 2 )) loss (0 , D 2 S ( X 1 , X 2 ))
D 2 S
D S
The intuitive argument presented in Sec.
2 suggests that GAN training would result in the same single mode being recovered throughout, which is also conﬁrmed in the ﬁrst row of Figure 6: the generator’s distribution is concentrated around a single mode, from which it cannot due to its inherited disadvantage of single observation-based discriminator and logistic loss.
WGAN does not stuck at a single mode but the mode collapse still happens.
On the other hand, WGAN-GP and DAN is able to constantly recover all 4 far-apart modes.
Note that the gradient scaling argument in Sec. 2 only says that points far away (i.e. with low probability under G ) from G ’s modes will be down weighted.
But points close to the boundary of
D ’s decision will have a large ∇ D ( x ( i ) G ) term, and thus up-weighting gradients and can cause the
G ’s whole mode to shift towards the boundary.
If after this shift, enough of G ’s mass falls closer to another mode, then this can become the attracting point and further concentrate G ’s mass.
This suggests that, for distributions with spiked, but close modes, G ’s mass should concentrate but possibly traverse from mode to mode.
This effect is indeed commonly observed for the popular 8-gaussians example shown in Figure 7.
All other models follow the same argument as in Figure 6.
Though WGAN-GP is able to recover all modes as DAN, we show that the training for WGAN-GP is unstable – a slight change in hyperparameter may end up with totally different generator distribution.
We consider the same network architecture as in public available WGAN-GP code 5 : The generator consists of a fully connected network with 3 hidden layers of size 512 with ReLU activations, followed by a linear projection to 2 dimensions.
The discriminator consists of a fully connected network with 3 hidden layers of size 512 with ReLU activations, followed by a linear projection to 1 dimension.
Latent vectors are sampled uniformly from [ − 1 , 1] 2 .
Distributional adversaries starts with 2 hidden layers of size 512, then the latent representations are averaged across the batch.
The mean representation is then fed to 1 hidden layer of size 512 and a linear projection to 1 dimension.
Minibatch size is ﬁxed to 256.
For the ﬁrst set of experiments we optimize using Adam (Kingma & Ba, 2014) with learning rate of 10 − 4 , β 1 = 0 .
5 and β 2 = 0 .
9 , and train the network for 30 , 000 iterations, where each iteration consists of 5 updates for discriminator and 1 for generator for WGAN-GP.
The result is shown in
Figure 8.
All models successfully capture all modes, despite their separation.
However, a slight change in the optimizer’s parameters to β 2 = 0 .
999 (the default value) causes WGAN-GP to fail sometime even if we run for 50 , 000 iterations, while DAN still constantly recovers the true distribution (cf.
Figure 9).
We also experiment with WGAN optimized using RMSProp with learning rate of 5 × 10 −under this setting and in contrast to previous experiments where it fails to recover any mode, it is able to recover all modes using this network architecture.
This shows that both WGAN and WGAN-GP are sensitive to network structure or hyperparameter settings, while DAN is more stable.
Finally, we show that DAN is stable across a reasonable range of λ , the trade-off parameter for single observation and distributional adversaries.
We set λ
= { 0 , 0 . 2 , 0 .
5 , 1 , 2 , 5 , 10 } for DAN and the results are shown in Figure 10 and 11.
While both DAN-S and DAN-2S are stable, DAN-2S is stable in larger range of λ than DAN-S.
To summarize, the trends we observe in these these synthetic experiments are: (i) GAN irremediably suffers from mode collapse for this simple dataset, (ii) WGAN(+GP) can fail in recovering modes or are not stable against hyperparameter choices and (iii) DAN constantly recovers all modes and is stable for all reasonable hyperparameter settings.
C MNIST E XPERIMENT D ETAILS
We use the same architecture for the generator across all models: 3 hidden layers of sizes [256 , 512 , 1024] with linear mappings and ReLU activations, followed by a fully connected linear layer and a Sigmoid activation to map it to a 784-dimensional vector.
Latent vectors are uniform samples from [ − 1 , 1] 256 .
For GAN, RegGAN and DAN the single observation discriminators consist of 3 hidden layers of sizes [1024 , 512 , 256] with linear mapping and ReLU activations, followed by a fully connected linear layer and Sigmoid activation to map it to a 1-dimensional value.
Both adversaries in this DAN use the same architecture except for the averaging layer of the distributional adversary, and share weights of the pre-averaging layers.
This is done to limit the number of additional parameters of the regularizer, so as to make training more efﬁcient.
The architecture for the decoder in EBGAN is the same with the generator, while the ones for encoders in RegGAN and EBGAN are the same as the discriminator except for the last layer where it maps to 256-dimensional vectors.
Throughout the experiments, we set the hyperparameters as shown in Table 3.
We use Adam with learning rate of 5 × 10 − 4 and β 1 = 0 .
5 , a ﬁxed minibatch size of 256 andepochs of training.
For models except WGAN and DAN we train by alternating between generator and adversary (and potentially encoder and decoder) updates.
Generated digits by each model are shown in Figure 12, where we observe a clear advantage of DAN
Model
Hypaerparameters
[Equation]
D C ELEB A E XPERIMENT D ETAILS
We use a publicly available implementation 6 of DCGAN.
The network architecture is kept as in the default conﬁguration.
We preprocess the image data by ﬁrst cropping each image to 160 ×(instead of 108 × 108 in default setting) and then resize them to 64 × 64 .
The generator consists of a fully connected linear layer mapping from latent space of [ − 1 , 1] 100 to dimension 8,192, followed by 4 deconvolution layers, three with ReLU activations and the last one followed by tanh .
The discriminator is the “reverse” of generator, except that the activation function is Leaky ReLU the last layer being a linear mapping and a Sigmoid activation to 1D value.
Both adversaries in DAN use the same architecture except for the averaging layer of the distributional adversary, and share weights of the pre-averaging layers.
We use Adam with learning rate of 5 × 10 − 4 and β 1 = 0 .
5 for training.
The batch size is ﬁxed toand we train the network for 30 epochs.
For DAN- ξ , we set λ = 5 and k = 5 .
Samples generated by different models are shown in Figure 14.
E D OMAIN A DAPTATION E XPERIMENT D ETAILS
We adapt the publicly available code 7 for DANN to train on the Amazon and MNIST-M datasets.
For the former, we let the encoder of source/target domains consists of 3 fully connected layers of sizes 1000 , 500 , 100 with ReLU activations, followed by a projection to 2 dimensions for both adversaries and classiﬁer.
For the latter dataset we set the model structure to be default in the original code: the encoder of source/target domains consists of 2 convolutional layers, each followed by ReLU and
MaxPooling layers.
The encoded vector is further mapped to 100-dimensional vector followed by ReLU , and ﬁnally 2-dimensional vector for adversaries and 10-dimensional vectors for classiﬁer.
We set the weights for the single observation adversary and distributional adversary to be both 0 .
1 and both 1 for Amazon dataset and MNIST-M dataset respectively.
[Figure]
[Figure] [Figure]