B
OUNDARY
S EEKING G ENERATIVE A DVERSARIAL N ETWORKS
Anonymous authors
Paper under double-blind review
A BSTRACT
Generative adversarial networks (GANs, Goodfellow et al., 2014) are a learning framework that rely on training a discriminator to estimate a measure of difference between a target and generated distributions.
GANs, as normally formulated, rely on the generated samples being completely differentiable w.r.t.
the generative parameters, and thus do not work for discrete data.
We introduce a method for training GANs with discrete data that uses the estimated difference measure from the discriminator to compute importance weights for generated samples, thus providing a policy gradient for training the generator.
The importance weights have a strong connection to the decision boundary of the discriminator, and we call our method boundary-seeking GANs (BGANs).
We demonstrate the effectiveness of the proposed algorithm with discrete image and character-based natural language generation.
In addition, the boundary-seeking objective extends to continuous data, which can be used to improve stability of training.
I NTRODUCTION
Generative adversarial networks (GAN, Goodfellow et al., 2014) involve a unique generative learning framework that uses two separate models, a generator and discriminator, with opposing or adversarial objectives.
Training a GAN only requires back-propagating a learning signal that originates from a learned objective function, which corresponds to the loss of the discriminator trained in an adversarial manner.
This framework is powerful because it trains a generator without relying on an explicit formulation of the probability density, using only samples from the generator to train.
GANs have been shown to generate often-diverse and realistic samples even when trained on highdimensional large-scale continuous data (Radford et al., 2015).
GANs however have a serious limitation on the type of variables they can model, because they require the composition of the generator and discriminator to be fully differentiable.
With discrete variables, this is not true.
For instance, consider using a step function at the end of a generator in order to generate a discrete value.
In this case, back-propagation alone cannot provide the training signal, because the derivative of a step function is 0 almost everywhere.
This is problematic, as many important real-world datasets are discrete, such as character- or word-based representations of language.
The general issue of credit assignment for computational graphs with discrete operations (e.g. discrete stochastic neurons) is difﬁcult and open problem, and only approximate solutions have been proposed in the past (Bengio et al., 2013;
Gu et al., 2015; Gumbel & Lieblein, 1954; Jang et al., 2016; Maddison et al., 2016; Tucker et al., 2017).
However, none of these have yet been shown to work with GANs.
In this work, we make the following contributions:
• We provide a theoretical foundation for boundary-seeking GANs (BGAN), a principled method for training a generator of discrete data using a discriminator optimized to estimate an f -divergence (Nguyen et al., 2010; Nowozin et al., 2016).
The discriminator can then be used to formulate importance weights which provide policy gradients for the generator.
• We verify this approach quantitatively works across a set of f -divergences on a simple classiﬁcation task.
We also verify that this approach works on a variety of benchmarks.
• We show that the boundary-seeking objective extends theoretically to the continuous case and verify it works well with some common and difﬁcult image benchmarks.
Finally, we show that this objective has some improved stability properties within training and without.
B OUNDARY -S EEKING GAN S
In this section, we will introduce boundary-seeking GANs (BGAN), an approach for training a generative model adversarially with discrete data, as well as provide its theoretical foundation.
For
BGAN, we assume the normal generative adversarial learning setting commonly found in work on
GANs (Goodfellow et al., 2014), but these ideas should extend elsewhere.
2. G ENERATIVE ADVERSARIAL LEARNING AND PROBLEM STATEMENT
Assume that we are given empirical samples from a target distribution, { x ( i )
∈ X} Mi =1 , where X is the domain (such as the space of images, word- or character- based representations of natural language, etc.).
Given a random variable Z over a space Z (such as [0 , 1] m ), we wish to ﬁnd the optimal parameters, ˆ θ ∈ R d , of a function, G θ : Z → X (such as a deep neural network), whose induced probability distribution, Q θ , describes well the empirical samples.
In order to put this more succinctly, it is beneﬁcial to talk about a probability distribution of the empirical samples, P , that is deﬁned on the same space as Q θ .
We can now consider the difference measure between P and Q θ , D ( P , Q θ ) , so the problem can be formulated as ﬁnding the parameters:
[Equation]
Deﬁning an appropriate difference measure is a long-running problem in machine learning and statistics, and choosing the best one depends on the speciﬁc setting.
Here, we wish to avoid making strong assumptions on the exact forms of P or Q θ , and we desire a solution that is scalable and works with very high dimensional data.
Generative adversarial networks (GANs, Goodfellow et al., 2014) fulﬁll these criteria by introducing a discriminator function , D φ : X → R , with parameters, φ , then deﬁning a value function ,
[Equation]
where samples z are drawn from a simple prior, h ( z ) (such as U (0 , 1) or N (0 , 1) ).
Here, D φ is a neural network with a sigmoid output activation, and as such can be interpreted as a simple binary classiﬁer, and the value function can be interpreted as the negative of the Bayes risk .
GANs train the discriminator to maximize this value function (minimize the mis-classiﬁcation rate of samples coming from P or Q θ ), while the generator is trained to minimize it.
In other words, GANs solve an optimization problem:
[Equation]
Optimization using only back-propogation and stochastic gradient descent is possible when the generated samples are completely differentiable w.r.t.
the parameters of the generator, θ .
In the non-parametric limit of an optimal discriminator, the value function is equal to a scaled and shifted version of the Jensen-Shannon divergence, 2 ∗ D JSD ( P || Q θ ) − log 4 , 1 which implies the generator is minimizing this divergence in this limit.
f -GAN (Nowozin et al., 2016) generalized this idea over all f -divergences, which includes the Jensen-Shannon (and hence also GANs) but also the Kullback–Leibler, Pearson χ 2 , and squared-Hellinger.
Their work provides a nice formalism for talking about GANs that use f -divergences, which we rely on here.
Deﬁnition 2.1 ( f -divergence and its dual formulation) .
Let f : R + → R be a convex lower semicontinuous function and f (cid:63) :
C ⊆ R → R be the convex conjugate with domain C .
Next, let T be an arbitrary family of functions,
T = { T : X → C} .
Finally, let P and Q be distributions that are completely differentiable w.r.t.
the same Lebesgue measure, µ .
The f -divergence, D f
( P || Q θ ) , generated by f , and its dual representation are (Nguyen et al., 2010):
[Equation]
The dual form allows us to change a problem involving likelihood ratios (which may be intractable) to an optimization problem over T .
This kind of optimization is well-studied if T is a family of neural networks with parameters φ (a.k.a., deep learning ), so the supremum can be found with gradient ascent (Nowozin et al., 2016).
Deﬁnition 2.2 (Variational lower-bound for the f -divergence) .
Let T φ = ν ◦ F φ be a function, which is the composition of an activation function, ν : R → C and a neural network, F φ : X → R .
We can write the lower-bound of the supremum in Equation 4 as 3 :
[Equation]
GANs are extremely powerful for training a generator of continuous data, leveraging a dual representation along with a neural network with theoretically unlimited capacity to estimate a difference measure.
For the remainder of this work, we will refer to T φ = ν ◦ F φ as the discriminator and F φ as the statistic network (which is a slight deviation from other works).
We will generalize the term
GAN to refer to all models that simultaneously minimize and maximize a variational lower-bound ,
V ( P , Q θ , T φ ) , of a difference measure (such as a divergence or distance).
In principle, this extends to variants of GANs which are based on integral probability metrics (IPMs, Sriperumbudur et al., 2009) that leverage a dual representation, such as those that rely on restricting T through parameteric regularization (Arjovsky et al., 2017) or by constraining its output distribution (Mroueh &
Sercu, 2017; Mroueh et al., 2017; Sutherland et al., 2016).
2. E STIMATION OF THE TARGET DISTRIBUTION
Here we will show that, with the variational lower-bound of an f -divergence along with a family of positive activation functions, ν : R → R + , we can estimate the target distribution, P , using the generated distribution, Q θ , and the discriminator, T φ .
Theorem 1.
Let f be a convex function and T (cid:63) ∈ T a function that satisﬁes the supremum in
Equation 4 in the non-parametric limit.
Let us assume that P and Q θ ( x ) are absolutely continuous w.r.t.
a measure µ and hence admit densities, p ( x ) and q θ ( x ) .
Then the target density function, p ( x ) , is equal to ( ∂f (cid:63) /∂T )
( T (cid:63) ( x ))
q θ ( x ) .
Proof.
Following the deﬁnition of the f -divergence and the convex conjugate, we have:
[Equation]
As f (cid:63) is convex, there is an absolute maximum when ∂f (cid:63) ∂t ( t ) =
p ( x ) q θ ( x ) .
Rephrasing t as a function,
T ( x ) , and by the deﬁnition of T (cid:63) ( x ) , we arrive at the desired result.
Theorem 1 indicates that the target density function can be re-written in terms of a generated density function and a scaling factor.
We refer to this scaling factor, w (cid:63) ( x ) =
( ∂f (cid:63) /∂T )
( T (cid:63) ( x )) , as the optimal importance weight to make the connection to importance sampling 4 .
In general, an optimal discriminator is hard to guarantee in the saddle-point optimization process, so in practice, T φ will deﬁne a lower-bound that is not exactly tight w.r.t.
the f -divergence.
Nonetheless, we can deﬁne an estimator for the target density function using a sub-optimal T φ .
Deﬁnition 2.3 ( f -divergence importance weight estimator) .
Let f and f (cid:63) , and T φ ( x ) be deﬁned as in Deﬁnitions 2.1 and 2.2 but where ν : R → R + ⊆
C is a positive activation function.
Let w ( x ) =
( ∂f (cid:63) /∂T )
( T ( x )) and β = E Q φ [ w ( x )] be a partition function.
The f -divergence importance weight estimator, ˜ p ( x ) is
[Equation]
[Table]
The non-negativity of ν is important as the densities are positive.
Table 1 provides a set of fdivergences (following suggestions of Nowozin et al.
with only slight modiﬁcations) which are suitable candidates and yield positive importance weights.
Surprisingly, each of these yield the same function over the neural network before the activation function: w ( x ) =
e F φ ( x ) .
5 It should be noted that ˜ p ( x ) is a potentially biased estimator for the true density; however, the bias only depends on the tightness of the variational lower-bound: the tighter the bound, the lower the bias.
This problem reiterates the problem with all GANs, where proofs of convergence are only provided in the optimal or near-optimal limit (Goodfellow et al., 2014; Nowozin et al., 2016; Mao et al., 2016).
2. B OUNDARY - SEEKING GAN S
As mentioned above and repeated here, GANs only work when the value function is completely differentiable w.r.t.
the parameters of the generator, θ .
The gradients that would otherwise be used to train the generator of discrete variables are zero almost everywhere, so it is impossible to train the generator directly using the value function.
Approximations for the back-propagated signal exist (Bengio et al., 2013; Gu et al., 2015; Gumbel & Lieblein, 1954; Jang et al., 2016; Maddison et al., 2016; Tucker et al., 2017), but as of this writing, none has been shown to work satisfactorily in training GANs with discrete data.
Here, we introduce the boundary-seeking GAN as a method for training GANs with discrete data.
We ﬁrst introduce a policy gradient based on the KL-divergence which uses the importance weights as a reward signal.
We then introduce a lower-variance gradient which deﬁnes a unique reward signal for each z and prove this can be used to solve our original problem.
Policy gradient based on importance sampling Equation 7 offers an option for training a generator in an adversarial way.
If we know the explicit density function, q θ , (such as a multivariate
Bernoulli distribution), then we can, using ˜ p ( x ) as a target (keeping it ﬁxed w.r.t.
optimization of θ ), train the generator using the gradient of the KL-divergence:
[Equation]
Here, the connection to importance sampling is even clearer, and this gradient resembles other importance sampling methods for training generative models in the discrete setting (Bornschein &
Bengio, 2014; Rubinstein & Kroese, 2016).
However, we expect the variance of this estimator will be high, as it requires estimating the partition function, β (for instance, using Monte-Carlo sampling).
We address reducing the variance from estimating the normalized importance weights next.
Lower-variance policy gradient Let q θ ( x ) =
(cid:82) Z g θ ( x | z ) h ( z ) dz be a probability density function with a conditional density, g θ ( x | z ) :
Z → [0 , 1] d (e.g., a multivariate Bernoulli distribution), and prior over z , h ( z ) .
Let α ( z ) =
E g θ ( x | z ) [ w ( x )]
=
(cid:82) X g θ ( x | z ) w ( x ) dx be a partition function over the conditional distribution.
Let us deﬁne ˜
p
( x | z ) =
w ( x ) α ( z ) g θ ( x | z ) as the (normalized) [Table] [Table] [Equation]
[Table] [Equation] [Table]
[Equation]
[Table] each conditional g θ ( x | z [Table] m ) )
[Table]
independently if P and Q θ are multi-variate)
[Equation]
[Table]
importance
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
parameters
[Equation]
[Table]
parameters
[Table]
convergence conditional distribution weighted by w ( x ) α ( z ) .
The expected conditional KL-divergence over h ( z ) is:
[Equation]
Let x ( m ) ∼ g θ ( x | z ) be samples from the prior and ˜ w ( x ( m ) )
=
w ( x ( m ) )
[Equation]
m (cid:48) w ( x ( m
[Equation]
) ) be a Monte-Carlo estimate of the normalized importance weights.
The gradient of the expected conditional KL-divergence w.r.t.
the generator parameters, θ , becomes:
[Equation]
where we have approximated the expectation using the Monte-Carlo estimate.
Minimizing the expected conditional KL-divergences is stricter than minimizing the KL-divergence in Equation 7, as it requires all of the conditional distributions to match independently.
We show that the KL-divergence of the marginal probabilities is zero when the expectation of the conditional
KL-divergence is zero as well as show this estimator works better in practice in the Appendix.
Algorithm 1 describes the training procedure for discrete BGAN.
This algorithm requires an additional M times more computation to compute the normalized importance weights, though these can be computed in parallel exchanging space for time.
When the P and Q θ are multi-variate (such as with discrete image data), we make the assumption that the observed variables are independent conditioned on Z .
The importance weights, w , are then applied uniformly across each of the observed variables.
Connection to policy gradients REINFORCE is a common technique for dealing with discrete data in GANs (Che et al., 2017; Li et al., 2017).
Equation 9 is a policy gradient in the special case that the reward is the normalized importance weights.
This reward approaches the likelihood ratio in the non-parametric limit of an optimal discriminator.
Here, we make another connection to REINFORCE as it is commonly used, with baselines, by deriving the gradient of the reversed
KL-divergence.
Deﬁnition 2.4 (REINFORCE-based BGAN) .
Let T φ ( x ) be deﬁned as above where ∂f (cid:63) /∂T
( T φ ( x ))
=
e F φ ( x ) .
Consider the gradient of the reversed KL-divergence:
[Equation]
From this, it is clear that we can consider the output of the statistic network, F φ ( x ) , to be a reward and b = log β
= E Q θ [ w ( x )] to be the analog of a baseline.
This gradient is similar to those used in previous works on discrete GANs, which we discuss in more detail in Section 3.
2. C ONTINUOUS VARIABLES AND THE STABILITY OF GAN S
For continuous variables, minimizing the variational lower-bound sufﬁces as an optimization technique as we have the full beneﬁt of back-propagation to train the generator parameters, θ .
However, while the convergence of the discriminator is straightforward, to our knowledge there is no general proof of convergence for the generator except in the non-parametric limit or near-optimal case.
What’s worse is the value function can be arbitrarily large and negative.
Let us assume that max T =
M < ∞ is unique.
As f (cid:63) is convex, the minimum of the lower-bound over θ is:
[Equation]
In other words, the generator objective is optimal when the generated distribution, Q θ , is nonzero only for the set { x | T ( x )
= M } .
Even outside this worst-case scenario, the additional consequence of this minimization is that this variational lower-bound can become looser w.r.t.
the f -divergence, with no guarantee that the generator would actually improve.
Generally, this is avoided by training the discriminator in conjunction with the generator, possibly for many steps for every generator update.
However, this clearly remains one source of potential instability in GANs.
Equation 7 reveals an alternate objective for the generator that should improve stability.
Notably, we observe that for a given estimator, ˜ p ( x ) , q θ ( x ) matches when w ( x ) =
( ∂f (cid:63) /∂T )
( T ( x ))
= 1 .
Deﬁnition 2.5 (Continuous BGAN objective for the generator) .
Let G θ : Z → X be a generator function that takes as input a latent variable drawn from a simple prior, z ∼ h ( z ) .
Let T φ and w ( x ) be deﬁned as above.
We deﬁne the continuous BGAN objective as: ˆ θ = arg min θ (log w ( G θ ( z ))) 2 .
We chose the log , as with our treatments of f -divergences in Table 1, the objective is just the square of the statistic network output:
[Equation]
This objective can be seen as changing a concave optimization problem (which is poor convergence properties) to a convex one.
R ELATED WORK AND DISCUSSION
On estimating likelihood ratios from the discriminator Our work relies on estimating the likelihood ratio from the discriminator, the theoretical foundation of which we draw from fGAN (Nowozin et al., 2016).
The connection between the likelihood ratios and the policy gradient is known in previous literature (Jie & Abbeel, 2010), and the connection between the discriminator output and the likelihood ratio was also made in the context of continuous GANs (Mohamed & Lakshminarayanan, 2016; Tran et al., 2017).
However, our work is the ﬁrst to successfully formulate and apply this approach to the discrete setting.
Importance sampling Our method is very similar to re-weighted wake-sleep (RWS, Bornschein & Bengio, 2014), which is a method for training Helmholtz machines with discrete variables.
RWS also relies on minimizing the KL divergence, the gradients of which also involve a policy gradient over the likelihood ratio.
Neural variational inference and learning (NVIL, Mnih & Gregor, 2014), on the other hand, relies on the reverse KL.
These two methods are analogous to our importance sampling and REINFORCE-based BGAN formulations above.
GAN for discrete variables Training GANs with discrete data is an active and unsolved area of research, particularly with language model data involving recurrent neural network (RNN) generators (Yu et al., 2016; Li et al., 2017).
Many REINFORCE-based methods have been proposed for language modeling (Yu et al., 2016;
Li et al., 2017; Dai et al., 2017) which are similar to our REINFORCE-based BGAN formulation and effectively use the sigmoid of the estimated loglikelihood ratio.
The primary focus of these works however is on improving credit assignment , and their approaches are compatible with the policy gradients provided in our work.
There have also been some improvements recently on training GANs on language data by rephrasing the problem into a GAN over some continuous space (Lamb et al., 2016;
Kim et al., 2017; Gulrajani et al., 2017).
However, each of these works bypass the difﬁculty of training GANs with discrete data by rephrasing the deterministic game in terms of continuous latent variables or simply ignoring the discrete sampling process altogether, and do not directly solve the problem of optimizing the generator from a difference measure estimated from the discriminator.
Remarks on stabilizing adversarial learning, IPMs, and regularization A number of variants of GANs have been introduced recently to address stability issues with GANs.
Speciﬁcally, generated samples tend to collapse to a set of singular values that resemble the data on neither a persample or distribution basis.
Several early attempts in modifying the train procedure (Berthelot et al., 2017; Salimans et al., 2016) as well as the identifying of a taxonomy of working architectures (Radford et al., 2015) addressed stability in some limited setting, but it wasn’t until Wassertstein GANs (WGAN, Arjovsky et al., 2017) were introduced that there was any signiﬁcant progress on reliable training of GANs.
WGANs rely on an integral probability metric (IPM, Sriperumbudur et al., 2009) that is the dual to the Wasserstein distance .
Other GANs based on IPMs, such as Fisher GAN (Mroueh & Sercu, 2017) tout improved stability in training.
In contrast to GANs based on f -divergences, besides being based on metrics that are “weak”, IPMs rely on restricting T to a subset of all possible functions.
For instance in WGANs, T = { T | (cid:107) T (cid:107) L ≤ K } , is the set of K-Lipschitz functions.
Ensuring a statistic network, T φ , with a large number of parameters is Lipschitz-continuous is hard , and these methods rely on some sort of regularization to satisfy the necessary constraints.
This includes the original formulation of WGANs, which relied on weight-clipping, and a later work (Gulrajani et al., 2017) which used a gradient penalty over interpolations between real and generated data.
Unfortunately, the above works provide little details on whether T φ is actually in the constrained set in practice, as this is probably very hard to evaluate in the high-dimensional setting.
Recently, Roth et al.
(2017) introduced a gradient norm penalty similar to that in Gulrajani et al.
(2017) without interpolations and which is formulated in terms of f -divergences.
In our work, we’ve found that this approach greatly improves stability, and we use it in nearly all of our results.
That said, it is still unclear empirically how the discriminator objective plays a strong role in stabilizing adversarial learning, but at this time it appears that correctly regularizing the discriminator is sufﬁcient.
D ISCRETE VARIABLES : EXPERIMENTS AND RESULTS 4. A DVERSARIAL CLASSIFICATION
We ﬁrst verify the gradient estimator provided by BGAN works quantitatively in the discrete setting by evaluating its ability to train a classiﬁer with the CIFAR-10 dataset (Krizhevsky & Hinton, 2009).
The “generator” in this setting is a multinomial distribution, g θ ( y | x ) modeled by the softmax output of a neural network.
The discriminator, T φ ( x, y ) , takes as input an image / label pair so that the variational lower-bound is:
[Equation]
For these experiments, we used a simple 4 -layer convolutional neural network with an additional 3 fully-connected layers.
We trained the importance sampling BGAN on the set of f -divergences given in Table 1 as well as the REINFORCE counterpart for 200 epochs and report the accuracy on the test set.
In addition, we ran a simple classiﬁcation baseline trained on cross-entropy as well as a continuous approximation to the problem as used in WGAN-based approaches (Gulrajani et al., 2017).
No regularization other than batch normalization (BN, Ioffe & Szegedy, 2015) was used with the generator, while gradient norm penalty (Roth et al., 2017) was used on the statistic networks.
For
WGAN, we used clipping, and chose the clipping parameter, the number discriminator updates, and the learning rate separately based training set performance.
The baseline for the REINFORCE method was learned using a moving average of the reward.
[Table]
Our results are summarized in Table 4.
Overall, BGAN performed similarly to the baseline on the test set [Table] with the REINFORCE method performing only slightly worse.
For WGAN, despite our best efforts, we could only achieve an error rate of 72 . 3% on the test set [Table] and this was after a total of 600 epochs to train.
Our efforts to train WGAN using gradient penalty failed completely, despite it working with higher-dimension discrete data (see Appendix) [Table]
4. D ISCRETE IMAGE AND NATURAL LANGUAGE GENERATION
Image data: binary MNIST and quantized CelebA We tested BGAN using two imaging benchmarks: the common discretized MNIST dataset (Salakhutdinov & Murray, 2008) and a new quantized version of the CelebA dataset (see Liu et al., 2015, for the original CelebA dataset).
For CelebA quantization, we ﬁrst downsampled the images from 64 × 64 to 32 × 32 .
We then generated a 16 -color palette using Pillow, a fork of the Python Imaging Project (https://pythonpillow.org).
This palette was then used to quantize the RGB values of the CelebA samples to a one-hot representation of 16 colors.
Our models used deep convolutional GANs (DCGAN, Radford et al., 2015).
The generator is fed a vector of 64 i.i.d.
random variables drawn from a uniform distribution, [0 , 1] .
The output nonlinearity was sigmoid for MNIST to model the Bernoulli centers for each pixel, while the output was softmax for quantized CelebA.
Our results show that training the importance-weighted BGAN on discrete MNIST data is stable and produces realistic and highly variable generated handwritten digits (Figure 1).
Further quantitative experiments comparing BGAN against WGAN with the gradient penalty (WGAN-GP Gulrajani et al., 2017) showed that when training a new discriminator on the samples directly (keeping the generator ﬁxed), the ﬁnal estimated distance measures were higher (i.e., worse) for WGAN-GP than
BGAN, even when comparing using the Wasserstein distance .
The complete experiment and results
[Table]
1-billion word Next, we test BGAN in a natural language setting with the 1-billion word dataset (Chelba et al., 2013), modeling at the character-level and limiting the dataset to sentences of at least 32 and truncating to 32 characters.
For character-level language generation, we follow the architecture of recent work (Gulrajani et al., 2017), and use deep convolutional neural networks for both the generator and discriminator.
Training with BGAN yielded stable, reliably good character-level generation (Table 3), though generation is poor compared to recurrent neural network-based methods (Sutskever et al., 2011;
Mikolov, 2012).
However, we are not aware of any previous work in which a discrete GAN, without any continuous relaxation (Gulrajani et al., 2017), was successfully trained from scratch without pretraining and without an auxiliary supervised loss to generate any sensible text.
Despite the low quality of the text relative to supervised recurrent language models, the result demonstrates the stability and capability of the proposed boundary-seeking criterion for training discrete GANs.
C ONTINUOUS VARIABLES : EXPERIMENTS AND RESULTS
Here we present results for training the generator on the boundary-seeking objective function.
In these experiments, we use the original GAN variational lower-bound from Goodfellow et al.
(2014), only modifying the generator function.
All results use gradient norm regularization (Roth et al., 2017) to ensure stability.
5. G ENERATION BENCHMARKS
We test here the ability of continuous BGAN to train on high-dimensional data.
In these experiments, we train on the CelebA, LSUN (Yu et al., 2015) datasets, and the 2012 ImageNet dataset with all 1000 labels (Krizhevsky et al., 2012).
The discriminator and generator were both modeled as 4 -layer
Resnets (He et al., 2016) without conditioning on labels or attributes.
Figure 3 shows examples from BGAN trained on these datasets.
Overall, the sample quality is very good.
Notably, our Imagenet model produces samples that are high quality, despite not being trained conditioned on the label and on the full dataset.
However, the story here may not be that BGAN necessarily generates better images than using the variational lower-bound to train the generator, since we found that images of similar quality on CelebA could be attained without the boundaryseeking loss as long as gradient norm regularization was used, rather we conﬁrm that BGAN works well in the high-dimensional setting.
5. S TABILITY OF CONTINUOUS BGAN
As mentioned above, gradient norm regularization greatly improves stability and allows for training with very large architectures.
However, training still relies on a delicate balance between the generator and discriminator: over-training the generator may destabilize learning and lead to worse results.
We ﬁnd that the BGAN objective is resilient to such over-training.
Stability in training with an overoptimized generator To test this, we train on the CIFARdataset using a simple DCGAN architecture.
We use the original GAN objective for the discriminator, but vary the generator loss as the variational lower-bound, the proxy loss (i.e., the generator loss [Figure] [Figure] function used in Goodfellow et al., 2014), and the boundary-seeking loss (BGAN).
To better study the effect of these losses, we update the generator for 5 steps for every discriminator step.
Our results (Figure 5) show that over-optimizing the generator signiﬁcantly degrades sample quality.
However, in this difﬁcult setting, BGAN learns to generate reasonable samples in fewer epochs than other objective functions, demonstrating improved stability.
Following the generator gradient We further test the different objectives by looking at the effect of gradient descent on the pixels.
In this setting, we train a DCGAN (Radford et al., 2015) using the proxy loss.
We then optimize the discriminator by training it for another 1000 updates.
Next, we
[Figure]
the causes that in training is the adversarial learning
C ONCLUSION
Reinterpreting the generator objective to match the proposal target distribution reveals a novel learning algorithm for training a generative adversarial network (GANs, Goodfellow et al., 2014).
This proposed approach of boundary-seeking provides us with a uniﬁed framework under which learning algorithms for both discrete and continuous variables are derived.
Empirically, we veriﬁed our approach quantitatively and showed the effectiveness of training a GAN with the proposed learning algorithm, which we call a boundary-seeking GAN (BGAN), on both discrete and continuous variables, as well as demonstrated some properties of stability
A PPENDIX 7. C OMPARISON OF DISCRETE METHODS
In these experiments, we produce some quantitative measures for BGAN against WGAN with the gradient penalty (WGAN-GP, Gulrajani et al., 2017) on the discrete MNIST dataset.
In order to use back-propagation to train the generator, WGAN-GP uses the softmax probabilities directly, bypassing the sampling process at pixel-level and problems associated with estimating gradients through discrete processes.
Despite this, WGAN-GP is been able to produce samples that visually resemble the target dataset.
Here, we train 3 models on the discrete MNIST dataset using identical architectures with the BGAN with the JS and reverse KL f -divergences and WGAN-GP objectives.
Each model was trained for 300 generator epochs, with the discriminator being updated 5 times per generator update for
WGAN-GP and 1 time per generator update for the BGAN models (in other words, the generators were trained for the same number of updates).
This model selection procedure was chosen as the difference measure (i.e., JSD, reverse KL divergence, and Wasserstein distance) as estimated during training converged for each model.
WGAN-GP was trained with a gradient penalty hyper-parameter of 5 . 0 , which did not differ from the suggested 10 .
in our experiments with discrete MNIST.
The
BGAN models were trained with the gradient norm penalty of 5 .
(Roth et al., 2017).
Next, for each model, we trained 3 new discriminators with double capacity (twice as many hidden units on each layer) to maximize the the JS and reverse KL divergences and Wasserstein distance, keeping the generators ﬁxed.
These discriminators were trained for 200 epochs (chosen from convergence) with the same gradient-based regularizations as above.
For all of these models, the discriminators were trained using the samples , as they would be used in practical applications.
For comparison, we also trained an additional discriminator, evaluating the WGAN-GP model above on the Wasserstein distance using the softmax probabilities.
Final evaluation was done by estimating difference measures using 60000 MNIST training examples againt 60000 samples from each generator, averaged over 12 batches of 5000 .
We used the training set as this is the distribution over which the discriminators were trained.
Test set estimates in general were close and did not diverge from training set distances, indicating the discriminators were not overﬁtting, but training set estimates were slightly higher on average.
[Table]
Our results show that the estimates from the sampling distribution from BGAN is consistently lower than that from WGAN-GP, even when evaluating using the Wasserstein distance .
However, when training the discriminator on the softmax probabilities, WGAN-GP has a much lower Wasserstein distance.
Despite quantitative differences, samples from these different models were indistinguishable as far as quality by visual inspection.
This indicates that, though playing the adversarial game using the softmax outputs can generate realistic-looking samples, this procedure ultimately hurts the generator’s ability to model a truly discrete distribution
[Table]
7. T HEORETICAL AND EMPIRICAL VALIDATION OF THE VARIANCE REDUCTION METHOD
Here we validate the policy gradient provided in Equation 10 theoretically and empirically.
Theorem 2.
Let the expectation of the conditional KL-divergence be deﬁned as in Equation 9.
Then E
[Equation]
Proof.
As the conditional KL-divergence is has an absolute minimum at zero, the expectation can only be zero when the all of the conditional KL-divergences are zero.
In other words:
[Equation]
As per the deﬁnition of ˜ p
( x | z ) , this implies that α ( z ) = w ( x ) =
C is a constant.
If w ( x ) is a constant, then the partition function β = C E Q θ [1] =
C is a constant.
Finally, when w ( x ) β
= 1 , ˜ p
[Equation]
⇒ [Equation] p
[Equation] |
[Equation]
In order to empirically evaluate the effect of using an Monte-Carlo estimate of β from Equationversus the variance-reducing method in Equation 10, we trained several models using various sample sizes from the prior, h ( z ) , and the conditional, g θ ( x | z ) .
We compare both methods with 64 samples from the prior and 5 , 10 , and 100 samples from the conditional.
In addition, we compare to a model that estimates β using 640 samples from the prior and a single sample from the conditional.
These models were all run on discrete MNIST forepochs with the same architecture as those from Section 4.2 with a gradient penalty of 1 . 0 , which was the minimum needed to ensure stability in nearly all the models.
Our results (Figure 6) show a clear improvement using the variance-reducing method from Equation 10 over estimating β .
Wall-clock times were nearly identical for methods using the same number of total samples (blue, green, and red dashed and solid line pairs). Both methods improve as the number of conditional samples is increased.