T RAINING GAN S WITH O PTIMISM
Anonymous authors
Paper under double-blind review
A BSTRACT
We address the issue of limit cycling behavior in training Generative Adversarial
Networks and propose the use of Optimistic Mirror Decent (OMD) for training
Wasserstein GANs.
Recent theoretical results have shown that optimistic mirror decent (OMD) can enjoy faster regret rates in the context of zero-sum games.
WGANs is exactly a context of solving a zero-sum game with simultaneous noregret dynamics.
Moreover, we show that optimistic mirror decent addresses the limit cycling problem in training WGANs.
We formally show that in the case of bi-linear zero-sum games the last iterate of OMD dynamics converges to an equilibrium, in contrast to GD dynamics which are bound to cycle.
We also portray the huge qualitative difference between GD and OMD dynamics with toy examples, even when GD is modiﬁed with many adaptations proposed in the recent literature, such as gradient penalty or momentum.
We apply OMD WGAN training to a bioinformatics problem of generating DNA sequences.
We observe that models trained with OMD achieve consistently smaller KL divergence with respect to the true underlying distribution, than models trained with GD variants.
Finally, we introduce a new algorithm, Optimistic Adam, which is an optimistic variant of Adam.
We apply it to WGAN training on CIFAR10 and observe improved performance in terms of inception score as compared to Adam
I NTRODUCTION
Generative Adversarial Networks (GANs) Goodfellow et al.
(2014) have proven a very successful approach for ﬁtting generative models in complex structured spaces, such as distributions over images.
GANs frame the question of ﬁtting a generative model from a data set of samples from some distribution as a zero-sum game between a Generator (G) and a discriminator (D).
The Generator is represented as a deep neural network which takes as input random noise and outputs a sample in the same space of the sampled data set, trying to approximate a sample from the underlying distribution of data.
The discriminator, also modeled as a deep neural network is attempting to discriminate between a true sample and a sample generated by the generator.
The hope is that at the equilibrium of this zero-sum game the generator will learn to generate samples in a manner that is indistinguishable from the true samples and hence has essentially learned the underlying data distribution.
Despite their success at generating visually appealing samples when applied to image generation tasks, GANs are very ﬁnicky to train.
One particular problem, raised for instance in a recent survey as a major issue (Goodfellow, 2017) is the instability of the training process.
Typically training of
GANs is achieved by solving the zero-sum game via running simultaneously a variant of a Stochastic
Gradient Descent algorithm for both players (potentially training the discriminator more frequently than the generator).
The latter amounts essentially to solving the zero-sum game via running no-regret dynamics for each player.
However, it is known from results in game theory, that no-regret dynamics in zero-sum games can very often lead to limit cycles, rather than converge to an equilibrium.
Even in convexconcave zero-sum games it is only the average of the weights of the two players that constitutes an equilibrium and not the last-iterate.
In fact recent theoretical results of Mertikopoulos et al.
(2017) show the strong result that no variant of GD that falls in the large class of Follow-the-RegularizedLeader (FTRL) algorithms can converge to an equilibrium in terms of the last-iterate and are bound to converge to limit cycles around the equilibrium.
Averaging the weights of neural nets is a prohibitive approach in particular because the zero-sum game that is deﬁned by training one deep net against another is not a convex-concave zero-sum game.
Thus it seems essential to identify training algorithms that make the last iterate of the training be very close to the equilibrium, rather than only the average.
Contributions.
In this paper we propose training GANs, and in particular Wasserstein GANs
Arjovsky et al.
(2017), via a variant of gradient descent known as Optimistic Mirror Descent.
Optimistic Mirror Descent (OMD) takes advantage of the fact that the opponent in a zero-sum game is also training via a similar algorithm and uses the predictability of the strategy of the opponent to achieve faster regret rates.
It has been shown in the recent literature that Optimistic Mirror Descent and its generalization of Optimistic Follow-the-Regularized-Leader (OFTRL), achieve faster convergence rates than gradient descent in convex-concave zero-sum games (Rakhlin & Sridharan, 2013a;b) and even in general normal form games (Syrgkanis et al., 2015).
Hence, even from the perspective of faster training, OMD should be preferred over GD due to its better worst-case guarantees and since it is a very small change over GD.
Moreover, we prove the surprising theoretical result that for a large class of zero-sum games (namely bi-linear games), OMD actually converges to an equilibrium in terms of the last iterate.
Hence, we give strong theoretical evidence that OMD can help in achieving the long sought-after stability and last-iterate convergence required for GAN training.
The latter theoretical result is of independent interest, since solving zero-sum games via no-regret dynamics has found applications in many areas of machine learning, such as boosting (Freund & Schapire, 1996).
Avoiding limit cycles in such approaches could help improve the performance of the resulting solutions.
We complement our theoretical result with toy simulations that portray exactly the large qualitative difference between OMD as opposed to GD (and its many variants, including gradient penalty, momentum, adaptive step size etc.).
We show that even in a simple distribution learning setting where the generator simply needs to learn the mean of a multi-variate distribution, GD leads to limit cycles, while OMD converges pointwise.
Moreover, we give a more complex application to the problem of learning to generate distributions of DNA sequences of the same cellular function.
DNA sequences that carry out the same function in the genome, such as binding to a speciﬁc transcription factor, follow the same nucleotide distribution.
Characterizing the DNA distribution of different cellular functions is essential for understanding the functional landscape of the human genome and predicting the clinical consequence of DNA mutations (Zeng et al., 2015; 2016; Zeng & Gifford, 2017).
We perform a simulation study where we generate samples of DNA sequences from a known distribution.
Subsequently we train a GAN to attempt to learn this underlying distribution.
We show that OMD achieves consistently better performance than GD variants in terms of the Kullback-Leibler (KL) divergence between the distribution learned by the Generator and the true distribution.
Finally, we apply optimism to training GANs for images and introduce the Optimistic Adam algorithm.
We show that it achieves better performance than Adam, in terms of inception score, when trained on CIFAR10.
P RELIMINARIES : WGAN S AND O PTIMISTIC G RADIENT D ESCENT
We consider the problem of learning a generative model of a distribution of data points Q ∈ ∆( X ) .
Our goal is given a set of samples from D , to learn an approximation to the distribution Q in the form of a deep neural network G θ ( · ) , with weight parameters θ , that takes as input random noise z ∈ F (from some simple distribution F ) and outputs a sample G θ ( z ) ∈ X .
We will focus on addressing this problem via a Generative Adversarial Network (GAN) training strategy.
The GAN training strategy deﬁnes as a zero-sum game between a generator deep neural network
G θ ( · ) and a discriminator neural network D w ( · ) .
The generator takes as input random noise z ∼ F , and outputs a sample G θ ( z ) ∈ X .
A discriminator takes as input a sample x (either drawn from the true distribution Q or from the generator) and attempts to classify it as real or fake.
The goal of the generator is to fool the discriminator.
In the original GAN training strategy Goodfellow et al.
(2014), the discriminator of the zero sum game was formulated as a classiﬁer, i.e. D w ( x ) ∈ [0 , 1] with a multinomial logistic loss.
The latter boils down to the following expected zero-sum game (ignoring sampling noise).
[Equation]
If the discriminator is very powerful and learns to accurately classify all samples, then the problem of the generator amounts to solving the Jensen-Shannon divergence between the true distribution and the generators distribution.
However, if the discriminator is very powerful, then in practice the latter leads to vainishing gradients for the generator and inability to train in a stable manner.
The latter problem lead to the formulation of Wasserstein GANs (WGANs)
Arjovsky et al.
(2017), where the discriminator rather than being treated as a classiﬁer is instead trying to simulate the
Wasserstein − 1 or earth-mover metric between the true distribution and the distribution of the generator.
In this case, the function D w ( x ) is not constrained to being a probability in [0 , 1] but rather is an arbitrary 1 -Lipschitz function of x .
This reasoning leads to the following zero-sum game:
[Equation]
If the function space of the discriminator covers all 1 -Lipschitz functions of x , then the quantity sup w E x ∼ D
[ D w ( x )] − E z ∼ F [ D w ( G θ ( z ))] that the generator is trying to minimize corresponds to the earth-mover distance between the true distribution Q and the distribution of the generator.
Given the success of WGANs we will focus on WGANs in this paper.
2. G RADIENT D ESCENT VS O PTIMISTIC M IRROR D ESCENT
The standard approach to training WGANs is to train simultaneously the parameters of both networks via stochastic gradient descent.
We begin by presenting the most basic version of adversarial training via stochastic gradient descent and then comment on the multiple variants that have been proposed in the literature in the following section, where we compare their performance with our proposed algorithm for a simple example.
Let us start how training a GAN with gradient descent would look like in the absence of sampling error, i.e. if we had access to the true distribution Q .
For simplicity of notation, let:
[Equation]
denote the loss in the expected zero-sum game of WGAN, as deﬁned in Equation (2), i.e. inf θ sup w L ( θ, w ) .
The classic WGAN approach is to solve this game by running gradient descent (GD) for each player, i.e. for t ∈ { 1 , . .
, T − 1 } : with ∇ w,t = ∇ w L ( θ t , w t ) and ∇ θ,t = ∇ θ L ( θ t , w t )
[Equation]
If the loss function L ( θ, w ) was convex in θ and concave w and the step size η is chosen of the order 1 √ T , then standard results in game theory and no-regret learning imply that the pair (¯ θ, ¯ w ) of average parameters, i.e. ¯ w = 1 T (cid:80) Tt =1 w t and ¯ θ = 1 T (cid:80)
Tt
=1 θ t is an (cid:15) -equilibrium of the zero-sum game, for (cid:15)
=
O (cid:16) 1 √ T (cid:17) .
However, no guarantees are known beyond the convex-concave setting and, more importantly for the paper, even in convex-concave games, no guarantees are known for the last-iterate pair ( θ T , w T ) .
Rakhlin and Sridharan (Rakhlin & Sridharan, 2013a) proposed an alternative algorithm for solving zero-sum games in a decentralized manner, namely Optimistic Mirror Descent (OMD), that achieves faster convergence rates to equilibrium of (cid:15)
=
O (cid:0) 1 T (cid:1) for the average of parameters.
The algorithm essentially uses the last iterations gradient as a predictor for the next iteration’s gradient.
This follows from the intuition that if the opponent in the game is using a stable (or regularized) algorithm, then the gradients between the two iterations will not change much.
Later Syrgkanis et al.
(2015) showed that this intuition extends to show faster convergence of each individual player’s regret in general normal form games.
Given these favorable properties of OMD when learning in games, we propose replacing GD with
OMD when training WGANs.
The update rule of a OMD is a small adaptation to GD.
OMD is parameterized by a predictor of the next iteration’s gradient which could either be simply last iteration’s gradient or an average of a window of last gradient or a discounted average of past gradients.
In the case where the predictor is simply the last iteration gradient, then the update rule for OMD boils down to the following simple form:
[Equation]
The simple modiﬁcation in the GD update rule, is inherently different than any of the existing adaptations used in GAN training, such as Nesterov’s momentum, or gradient penalty.
General OMD and intuition.
The intuition behind OMD can be more easily understood when
GD is viewed through the lens of the Follow-the-Regularized-Leader formulation.
In particular, it is well known that GD is equivalent to the Follow-the-Regularized-Leader algorithm with an (cid:96)regularizer, i
[Equation]
e.:
[Equation]
It is known that if the learner knew in advance the gradient at the next iteration
[Equation]
then by adding that to the above optimization would lead to constant regret that comes solely from the regularization term.
OMD essentially augments FTRL by adding a predictor M t +1 of the next iterations gradient,
i
[Equation]
e.:
[Equation]
For an arbitrary set of predictors, the latter boils down to the following set of update rules:
[Equation]
In the theoretical part of the paper we will focus on the case where the predictor is simply the last iteration gradient, leading to update rules in Equation (5).
In the experimental section we will also explore performance of other alternatives for predictors.
2. S TOCHASTIC G RADIENT D ESCENT AND S TOCHASTIC O PTIMISTIC M IRROR D ESCENT
In practice we don’t really have access to the true distribution Q and hence we replace Q with an empirical distribution Q n over samples { x 1 , . . .
, x n } and F n of random noise samples { z 1 , . .
z n } , leading to empirical loss for the zero-sum game of:
[Equation]
Even in this setting it might be impractical to compute the gradient of the expected loss with respect to Q n or F n , e.g. E x ∼ Q n [ ∇ w D w ( x )] .
However, GD and OMD still leads to small loss if we replace gradients with unbiased estimators of them.
Hence, we can replace expectation with respect to Q n or F n , by simply evaluating the gradients at a single sample or on a small batch of B samples.
Hence, we can replace the gradients at each iteration with the variants:
[Equation]
Replacing ∇ w,t and ∇ θ,t with the above estimates in Equation (4) and (5), leads to Stochastic
Gradient Descent (SGD) and Stochastic Optimistic Mirror Decent (SOMD) correspondingly.
A N I LLUSTRATIVE E XAMPLE : L EARNING THE M EAN OF A D ISTRIBUTION
We consider the following very simple WGAN example: The data are generated by a multivariate normal distribution, i.e. Q (cid:44) N ( v, I ) for some v ∈ R d .
The goal is for the generator to learn the unknown parameter v .
In Appendix C we also consider a more complex example where the generator is trying to learn a co-variance matrix.
We consider a WGAN, where the discriminator is a linear function and the generator is a simple additive displacement of the input noise z , which is drawn from F (cid:44) N (0 , I ) , i.e
[Equation]
The goal of the generator is to ﬁgure out the true distribution, i.e. to converge to θ = v .
The WGAN loss then takes the simple form:
[Equation]
We ﬁrst consider the case where we optimize the true expectations above rather than assuming that we only get samples of x and samples of z .
Due to linearity of expectation, the expected zero-sum game takes the form:
[Equation]
We see here that the unique equilibrium of the above game is for the generator to choose θ = v and for the discriminator to choose w = 0 .
For this simple zero sum game, we have ∇ w,t = v − θ t and ∇ θ,t = − w t .
Hence, the GD dynamics take the form:
[Equation]
(GD Dynamics for Learning Means) while the OMD dynamics take the form:
[Equation]
OMD Dynamics for Learning Means)
We simulated simultaneous training in this zero-sum game under the GD and under OMD dynamics and we ﬁnd that GD dynamics always lead to a limit cycle irrespective of the step size or other modiﬁcations.
In Figure 1 we present the behavior of the GD vs OMD dynamics in this game for v = (3 , 4) .
We see that even though GD dynamics leads to a limit cycle (whose average does indeed equal to the true vector), the OMD dynamics converge to v in terms of the last iterate.
In Figurewe see that the stability of OMD even carries over to the case of Stochastic Gradients, as long as the batch size is of decent size.
[Figure]
In the appendix we also portray the behavior of the GD dynamics even when we add gradient penalty (Gulrajani et al., 2017) to the game loss (instead of weight clipping), adding Nesterov momentum to the GD update rule (Nesterov, 1983) or when we train the discriminator multiple times in between a train iteration of the generator.
We see that even though these modiﬁcations do improve the stability of the GD dynamics, in the sense that they narrow the band of the limit cycle, they still lead to a non-vanishing limit cycle, unlike OMD.
In the next section, we will in fact prove formally that for a large class of zero-sum games including the one presented in this section, OMD dynamics converge to equilibrium in the sense of last-iterate convergence, as opposed to average-iterate convergence.
[Figure]
L AST -I TERATE C ONVERGENCE OF O PTIMISTIC A DVERSARIAL T RAINING
In this section, we show that Optimistic Mirror Descent exhibits ﬁnal-iterate, rather than only average-iterate convergence to min-max solutions for bilinear functions.
More precisely, we consider the problem min
x max y x T
Ay , for some matrix A , where x and y are unconstrained.
In
Appendix D, we also show that our convergence result appropriately extends to the general case, where the bi-linear game also contains terms that are linear in the players’ individual strategies, i.e. games of the form:
[Equation]
[Equation]
In the simpler min x max y x T
Ay problem, Optimistic Mirror Descent takes the following form, for all t ≥ 1 :
[Equation]
Initialization: For the above iteration to be meaningful we need to specify x 0 , x − 1 , y 0 , y − 1 .
We choose any x 0 ∈ R ( A ) , and y 0 ∈ R ( A T ) , and set x − 1 = 2 x 0 and y − 1 =
y − 1 , where R ( · ) represents column space.
In particular, our initialization means that the ﬁrst step taken by the dynamics gives x 1 = x 0 and y 1 = y 0 .
We will analyze Optimistic Mirror Descent under the assumption λ ∞ ≤ 1 , where λ ∞ =
max {||
A || ,
||
A T ||} and ||·|| denotes spectral norm of matrices.
We can always enforce that λ ∞ ≤by appropriately scaling A .
Scaling A by some positive factor clearly does not change the min-max solutions ( x ∗ , y ∗ ) , only scales the optimal value x ∗ T
Ay ∗ by the same factor.
We remark that the set of equilibrium solutions of this minimax problem are pairs ( x, y ) such that x is in the null space of A T and y is in the null space of A .
In this section we rigorously show that Optimistic Mirror Descent converges to the set of such min-max solutions.
This is interesting in light of the fact that Gradient Descent actually diverges, even in the special case where A is the identity matrix, as per the following proposition whose proof is provided in Appendix D.3.
Proposition 1.
Gradient descent applied to the problem min x max y x T
y diverges starting from any initialization x 0 , y
such that x 0 , y 0 (cid:54) = 0 .
Next, we state our main result of this section, whose proof can be found in Appendix D, where we also state its appropriate generalization to the general case (14).
Theorem 1 (Last Iterate Convergence of OMD) .
Consider the dynamics of Eq.
(15) and (16) and any initialization 12 x − 1 = x 0 ∈ R ( A ) , and 12 y − 1 = y 0 ∈ R ( A T ) .
Let also
[Equation]
, where for a matrix X we denote by X + its generalized inverse and by || X
|| its spectral norm.
Suppose that max {||
A
|| ,
|| A T ||} ≡ λ ∞ ≤ 1 and η < γ , and let ∆ t
= (cid:12)(cid:12)(cid:12)(cid:12)
A T x t (cid:12)(cid:12)(cid:12)(cid:12) 2
+ ||
Ay t ||
Then ∆ 1 = ∆ 0 and for all t ≥ 2 :
[Equation]
In particular, ∆ t → O ( η 2 ∆ 0 ) as t → + ∞ .
Hence, for large enough t , the last iterate of OMD is within O ( η √ ∆ 0 ) distance from the space of equilibrium points of the game, where √ ∆ 0 is the distance of the initial point ( x 0 , y 0 ) from the equilibrium space, and where both distances are taken with respect to the norm (cid:112)
x T AA T x +
y T A T Ay .
E XPERIMENTAL R ESULTS FOR G ENERATING DNA S EQUENCES
We take our theoretical intuition to practice, applying OMD to the problem of generating DNA sequences from an observed distribution of sequences.
DNA sequences that carry out the same function can be viewed as samples from some distribution.
For many important cellular functions, this distribution can be well modeled by a position-weight matrix (PWM) that speciﬁes the probability of different nucleotides occuring at each position (Stormo, 2000).
Thus, training GANs from
DNA sequences sampled from a PWM distribution serves as a practically motivated problem where we know the ground truth and can thus quantify the performance of different training methods in terms of the KL divergence between the trained generator distribution and the true distribution.
In our experiments, we generated 40,000 DNA sequences of six nucleotides according to a given position weight matrix.
A random 10% of the sequences were held out as the validation set.
Each sequence was then embedded into a 4 × 6 matrix by encoding each of the four nucleotides with an one-hot vector.
On this dataset, we trained WGANs with different variants of OMD and SGD and evaluated their performance in terms of the KL divergence between the empirical distribution of the
WGAN-generated samples and the true distribution described by the position weight matrix.
Both the discriminator and generator of the WGAN used in this analysis were chosen to be convolutional neural networks (CNN), given the recent success of CNNs in modeling DNA-protein binding (Zeng et al., 2016; Alipanahi et al., 2015).
The detailed structure of the chosen CNNs can be found in
Appendix E.
The discriminator is trained 5 times before training the generator once as suggested in
Arjovsky et al.
To account for the impact of learning rate and training epochs, we explored two different ways of model selection when comparing different optimization strategies: (1) using the iteration and learning rate that yields the lowest discriminator loss on the held out test set.
This is inspired by the observation in Arjovsky et al.
(2017) that the discriminator loss negatively correlates with the quality of the generated samples.
(2) using the model obtained after the last epoch of the training.
To account for the stochastic nature of the initialization and optimizers, we trained 50 independent models for each learning rate and optimizer, and compared the optimizer strategies by the resulting distribution of KL divergences across 50 runs.
For GD, we used variants of Equation (4) to examine the effect of using momentum and an adaptive step size.
Speciﬁcally, we considered momentum, Nesterov momentum and Adagrad.
The speciﬁc form of all these modiﬁcations is given for reference in Appendix A.
For OMD we used the general predictor version of Equation (10) with a ﬁxed step size and with the following variants of the next iteration predictor M t +1 : (v1) Last iteration gradient: M t +1 = ∇ f t , (v2)
Running average of past gradients:
M t +1 = 1 t (cid:80) ti =1 ∇ f i , (v3)
Hyperbolic discounted average of past gradients:
M t +1 = λM t
+ (1 − λ ) ∇ f t , λ ∈ (0 , 1) .
[Figure]
a) WGAN with the lowest validation discriminator loss
[Figure]
For all afore-described algorithms
[Figure]
we experimented with their stochastic variants.
Figure 3 shows the KL divergence between the WGAN-generated samples and the true distribution.
When evaluated by the epoch and learning rate that yields the lowest discriminator loss on the validation set,
WGAN trained with Stochastic OMD (SOMD) achieved signiﬁcantly lower KL divergence than the competing SGD variants.
Evaluated by the last epoch, SOMD is much less sensitive to the choice of learning rate than the SGD variants.
And considering the best performance across different learning rates, SOMD outperformed vanilla SGD and SGD with Adagrad, and performed comparably to
SGD with momentum or Nesterov momentum.
G ENERATING I MAGES FROM CIFAR10 WITH O PTIMISTIC A DAM
In this section we applying optimistic WGAN training to generating images, after training on CIFAR10.
Given the success of Adam on training image WGANs we will use an optimistic version of the Adam algorithm, rather than vanilla OMD.
We denote the latter by Optimistic Adam .
Optimistic Adam could be of independent interest even beyond training WGANs.
We present Optimistic
Adam for (G) but the analog is also used for training (D).
We trained on CIFAR10 images with
Algorithm 1 Optimistic ADAM , proposed algorithm for training WGANs on images.
Parameters: stepsize η , exponential decay rates for moment estimates β 1 , β 2 ∈ [0 , 1) , stochastic loss as a function of weights (cid:96) t ( θ ) , initial parameters θfor each iteration t ∈ { 1 , . .
, T } do
Compute stochastic gradient: ∇ θ,t = ∇ θ (cid:96) t ( θ )
Update biased estimate of ﬁrst moment: m t = β 1 m t − 1 + (1 − β 1 ) · ∇ θ,t
Update biased estimate of second moment: v t = β 2 v t − 1 + (1 − β 2 ) · ∇ 2 θ,t
Compute bias corrected ﬁrst moment: ˆ m t = m t / (1 − β t 1 )
Compute bias corrected second moment: ˆ v t = v t / (1 − β t 2 )
Perform optimistic gradient step : θ t = θ t − 1 − 2 η · ˆ m t √ ˆ v t + (cid:15) + η ˆ m t − 1 √ ˆ v t − 1 + (cid:15)
Return θ T
Optimistic Adam with the hyper-parameters matched to Gulrajani et al.
and we observe that it outperforms Adam in terms of inception score (see Figure 10), a standard metric of quality of
WGANs (Gulrajani et al., 2017; Salimans et al., 2016).
In particular we see that optimistic Adam achieves high numbers of inception scores after very few epochs of training.
Importantly, we note that when training Adam we only trained the discriminator once after one iteration of the generator training.
The latter is inline with the intuition behind the use of optimism: optimism hinges on the fact that the gradient at the next iteration is very predictable since it is coming from another regularized algorithm.
However, if we train the other algorithm multiple times, then the gradient is not that predictable and the beneﬁts of optimism are lost.
We see that vanilla Adam performs poorly when the discriminator is trained only once in between iterations of the generator training.
Moreover, even if we use vanilla Adam and train 5 times (D) in between a training of (G), as proposed by Arjovsky et al.
(2017), then performance is again worse than Optimistic Adam with a 1:1 ratio of training.
The same learning rate 0 . 0001 and betas ( β 1 = 0 . 5 , β 2 = 0 . 9 ) as in Appendix B of Gulrajani et al.
(2017) were used for all the methods compared.
We also matched other hyper-parameters such as gradient penalty coefﬁcient λ and batch size.
For a larger sample of images see Appendix G.
[Figure]
A V ARIANTS OF GD T RAINING
For ease of reference we brieﬂy describe the exact form of update rules for several modiﬁcations of
GD training that we have used in our experimental results.
Adagrad:
[Equation]
Momentum:
[Equation]
Nesterov momentum:
[Equation]
B P ERSISTENCE OF L IMIT C YCLES IN GD T RAINING
In Figure 5 we portray example Gradient Descent dynamics in the illustrative example described in
Section 3 under multiple adaptations proposed in the literature.
We observe that oscillations persist in all such modiﬁed GD dynamics, though alleviated by some.
We brieﬂy describe the modiﬁcations in detail ﬁrst.
Gradient penalty.
The Wasserstein GAN is based on the idea that the discriminator is approximating all 1 -Lipschitz functions of the data.
Hence, when training the discriminator we need to make sure that the function D w ( x ) has a bounded gradient with respect to x .
One approach to achieving this is weight-clipping, i.e. clipping the weights to lie in some interval.
However, the latter might introduce extra instability during training.
Gulrajani et al.
(2017) introduce an alternative approach by adding a penalty to the loss function of the zero-sum game that is essentially the (cid:96) 2 norm of the gradient of D w ( x ) with respect to x .
In particular they propose the following regularized WGAN loss:
[Equation]
where Q (cid:15) is the distribution of the random vector (cid:15)x + (1 − (cid:15) )
G ( z ) when x ∼ Q and z ∼ F .
The expectations in the latter can also be replaced with sample estimates in stochastic variants of the training algorithms.
For our simple example, ∇ x D w ( x ) = w .
Hence, we get the gradient penalty modiﬁed WGAN:
[Equation]
Hence, the gradient of the modiﬁed loss function with respect to θ remains unchanged, but the gradient with respect to w becomes:
[Equation]
Momentum.
GD with momentum was deﬁned in Equation (18).
For the case of the simple illustrative example, these dynamics boil down to:
[Equation]
Nesterov momentum.
GD with Nesterov’s momentum was deﬁned in Equation (19).
For the illustrative example, we see that Nesterov’s momentum is identical to momentum in the absence of gradient penalty.
The reason being that the function is bi-linear.
However, with a gradient penalty,
Nesterov’s momentum boils down to the following update rule.
[Equation]
Asymmetric training.
Another approach to reducing cycling is to train the discriminator more frequently than the generator.
Observe that if we could exactly solve the supremum problem of the discriminator after every iteration of the generator, then the generator would be simply solving a convex minimization problem and GD should converge point-wise.
The latter approach could lead to slow convergence given the ﬁniteness of samples in the case of stochastic training.
Hence, we cannot really afford completely solving the discriminators problem.
However, training the discriminator for multiple iterations, brings the problem faced by the generator closer to convex minimization rather than solving an equilibrium problem.
Hence, asymmetric training could help with cycling.
We observe below that asymmetric training is the most effective modiﬁcation in reducing the range of the cycles and hence making the last-iterate be close to the equilibrium.
However, it does not really eliminate the cycles, rather it simply makes their range smaller.
[Figure]
C A NOTHER E XAMPLE : L EARNING A C O -V ARIANCE M ATRIX
We demonstrate the beneﬁts of using OMD over GD in another simple illustrative example.
In this case, the example is does not boil down to a bi-linear game and therefore, the simulation results portray that the theoretical results we provided for bi-linear games, carry over qualitatively beyond the linear case.
Consider the case where the data distribution is a mean zero multi-variate normal with an unknown co-variance matrix, i.e., x ∼ N (0 , Σ) .
We will consider the case where the discriminator is the set of all quadratic functions:
[Equation]
The generator is a linear function of the random input noise z ∼ N (0 , I ) , of the form:
[Equation]
The parameters W and V are both d × d matrices.
The WGAN game loss associated with these functions is then:
[Equation]
Expanding the latter we get:
[Equation]
Given that the covariance matrix is symmetric positive deﬁnite
[Equation]
we can write it as Σ = UU T .
Then the loss simpliﬁes to:
[Equation]
The equilibrium of this game is for the generator to choose V ik = U ik for all i, k , and for the discriminator to pick W ij = 0 .
For instance, in the case of a single dimension we have L ( V, W ) =
W · ( σ 2 − V 2 ) , where σ 2 is the variance of the Gaussian.
Hence, the equilibrium is for the generator to pick V =
σ and the discriminator to pick W = 0 .
Dynamics without sampling noise.
For the mean GD dynamics the update rules are as follows:
[Equation]
We can write the latter updates in a simpler matrix form:
[Equation]
Similarly the OMD dynamics are:
[Equation]
Due to the non-convexity of the generators problem and because there might be multiple optimal solutions (e.g. if Σ is not strictly positive deﬁnite), it is helpful in this setting to also help dynamics by adding (cid:96) 2 regularization to the loss of the game.
The latter simply adds an extra 2 λW t at each gradient term ∇ W L ( V t , W t ) for the discriminator and a 2 λV t at each gradient term ∇ V L ( V t , W t ) for the generator.
In Figures 7 and 6 we give the weights and the implied covariance matrix Σ G =
V V T of the generator’s distribution for each of the dynamics for an example setting of the step-size and regularization parameters and for two and three dimensional gaussians respectively.
We again see how OMD can stabilize the dynamics to converge pointwise.
Stochastic dynamics.
In Figure 8 and 9 we also portray the instability of GD and the robustness of the stability of OMD under stochastic dynamics.
In the case of stochastic dynamics the gradients are replaced with unbiased estimates or with averages of unbiased estimates over a small minibatch.
In the case of a mini-batch of one, the unbiased estimates of the gradients in this setting take the following form:
[Equation]
Stochastic Gradients) where x t , z t are samples drawn from the true distribution and from the random noise distribution respectively.
Hence, the stochastic dynamics simply follow by replacing gradients with unbiased estimates:
[Equation]
[Figure] [Figure]
[Figure] [Figure]
[Figure]
D L AST I TERATE C ONVERGENCE OF OMD IN B ILINEAR C ASE
The goal of this section is to show that Optimistic Mirror Descent exhibits last iterate convergence to min-max solutions for bilinear functions.
In Section D.1, we provide the proof of Theorem 1, that
OMD exhibits last iterate convergence to min-max solutions of the following min-max problem
[Equation]
where A is an abitrary matrix and x and y are unconstrained.
In Section D.2, we state the appropriate extension of our theorem to the general case:
[Equation]
D. P ROOF OF T HEOREM
As stated in Section 4, for the min-max problem (29) Optimistic Mirror Descent takes the following form, for all t ≥ 1 :
[Equation]
where for the above iterations to be meaningful we need to specify x 0 , x − 1 , y 0 , y − 1 .
As stated in Section 4 we allow any initialization x 0 ∈ R ( A ) , and y 0 ∈ R ( A T ) , and set x − 1 = 2 xand y − 1 = 2 y − 1 , where R ( · ) represents column space.
In particular, our initialization means that the ﬁrst step taken by the dynamics gives x 1 = x 0 and y 1 = y 0 .
Before giving our proof of Theorem 1, we need some further notation.
For all i ∈ N , we set:
[Equation]
(cid:12)(cid:12)(cid:12)(cid:12) 2where k ∈ Z and j ∈ { 0 , 1 } are such that: i = 2 k + j.
With this notation, ∆ 0 t = (cid:12)(cid:12)(cid:12)(cid:12)
A T x t (cid:12)(cid:12)(cid:12)(cid:12) 2
+ ||
Ay t || 22 , ∆ 1 t = (cid:12)(cid:12)(cid:12)(cid:12)
AA T x t (cid:12)(cid:12)(cid:12)(cid:12) 2 2 + (cid:12)(cid:12)(cid:12)(cid:12)
A T
Ay t (cid:12)(cid:12)(cid:12)(cid:12) 2 2 , ∆ 2 t = (cid:12)(cid:12)(cid:12)(cid:12)
A T AA T x t (cid:12)(cid:12)(cid:12)(cid:12) 2 2 + (cid:12)(cid:12)(cid:12)(cid:12) AA T
Ay t (cid:12)(cid:12)(cid:12)(cid:12) 2 2 , etc.
We also use the notation (cid:104) u, v (cid:105) X
= u T XX T v , for vectors u, v ∈ R d and square d × d matrices
X .
We similarly deﬁne the norm notation
|| u
|| X
= (cid:112) (cid:104) u, u (cid:105) X .
Given our notation, we have the following claim, shown in Appendix D.3.
Claim
[Equation]
With our notation in place, we show (through iterated expansion of the update rule), the following lemma, proved in Appendix D.3:
Lemma 2.
For the dynamics of Eq.
(31) and (32) and any initialization 12 x − 1 = x 0 ∈ R ( A ) , and 12 y − 1 = y
0 ∈ R
( A T )
we have the following for all i, t ∈ N such that i ≥ 0 and t ≥ 2 :
[Equation]
We are ready to prove Theorem 1.
Its proof is implied by the following stronger theorem, and
Corollary 6.
Theorem 3.
Consider the dynamics of Eq.
(31) and (32) and any initialization 12 x − 1 = x 0 ∈ R ( A ) , and 12 y − 1 = y
0 ∈ R
( A T ) .
Let γ = max (cid:16)(cid:12)(cid:12) (cid:12) (cid:12)(cid:12) (cid:12) (cid:0) AA T (cid:1) + (cid:12)(cid:12) (cid:12) (cid:12)(cid:12) (cid:12) , (cid:12)(cid:12) (cid:12) (cid:12)(cid:12) (cid:12) (cid:0) A T A (cid:1) + (cid:12)(cid:12) (cid:12) (cid:12)(cid:12) (cid:12) (cid:17) , where for a matrix X we denote by X + its generalized inverse and by || X || its spectral norm.
Suppose that max {||
A
|| ,
|| A T ||} ≡ λ ∞ ≤ 1 and η < γ .
Then, for all i ∈ N :
[Equation]
and, for all i, t ∈ N such that t ≥ 2 , the following condition holds:
[Equation] [Equation]
Proof.
Eq.
(33) holds trivially as under our initialization x 1 = x 0 and y
= y 0 .
We use induction on t to prove (34).
We start our proof by showing the inductive step, and postpone establishing the basis of our induction to the end of this proof.
For the inductive step, we assume that H ( i, τ ) holds for all i ≥ 0 and 1 ≤ τ < t , for some t > 2 .
Assuming this, we show next that H ( i, t ) holds for all i .
To do this, we make use of a couple of lemmas, whose proofs are given in Appendix D.3.
Lemma 4.
Under the conditions of the theorem, for all i ≥ 0 , t ≥ 2 :
[Equation]
Lemma 5.
Under the conditions of the theorem, for all i ≥ 0 , t ≥ 0 :
[Equation]
Given these lemmas
[Equation]
we show our inductive step.
So for t ≥ 3 :
[Equation]
where for the ﬁrst inequality we used Lemma 4, for the second inequality we used that ∆ i +1 t − 1 ≤ ∆ i +1 t − 2 + O ( η 3 ∆ 00 )
(which is implied by the induction hypothesis), for the third inequality we used that λ ∞ ≤ 1 and that ∆ i + ≤ ∆ 00 (which also easily follows from the fact that λ ∞ ≤ 1 ), for the fourth inequality we used Lemma 5 and that ∆ i +1 t − 2 ≤ ∆
+ O ( η 2 ∆ 00 ) , which follows by ﬁrst noting that ∆ i +1 t − 2 ≤ ∆ 0 t − 2 (which easily follows from the fact that λ ∞ ≤ 1 ) and then noting that ∆ 0 t − 2 ≤ ∆
+ O ( η 2 ∆ 00 )
(which follows by iteratively applying the inductive hypothesis and using (33)), and for the last inequality we used that ∆ it − 1 ≤ ∆ it −
+ O ( η 3 ∆ 00 ) , which follows from the inductive hypothesis, and that η < γ .
Hence:
[Equation]
This completes the proof of our inductive step.
It remains to show the basis of the induction, namely that H ( i, 2) holds for all
i ∈ N .
To do this, we follow the derivation in lines (35)-(40) above, noticing that what we needed for this derivation to go through holds for t = 2 .
In particular, the ﬁrst inequality uses Lemma 4, which holds for t = 2 .
The second inequality goes through because ∆ i + = ∆ i +10 , for all i , given (33).
The third inequality goes through for the same reasons that were used in the induction step.
The fourth inequality goes through since ∆ i + ≥ 1 γ ∆ i 0 , which holds from Lemma 5, and ∆ i + ≤ ∆ 00 , which holds since λ ∞ ≤ 1 .
The last inequality follows from the fact that ∆ i 1 = ∆ i 0 .
Corollary 6.
Under the conditions of Theorem 3, ∆ 0 t ≡ (cid:12)(cid:12)(cid:12)(cid:12)
A T x t (cid:12)(cid:12)(cid:12)(cid:12) 2
+ ||
Ay t ||
→ O ( η 2 ∆ 00 ) as t → + ∞ .
In particular, for large enough t , the last iterate of OMD is within O ( η (cid:112) ∆ 00 ) distance from the space of equilibrium points of the game, where (cid:112) ∆ 00 is the distance of the initial point ( x 0 , y 0 ) from the equilibrium space, and where both distances are taken with respect to the norm (cid:112)
x T AA T x +
y T A T Ay .
Proof of Corollary 6: It follows from (33) and (34) that:
[Equation]
which shows the ﬁrst part of our claim.
For the second part of our claim recall that the solutions to (29) are all pairs ( x, y ) such that x is in the null space of A T and y is in the null space of A .
D. G ENERAL B ILINEAR C ASE
Theorem 7.
Consider OMD for the min-max problem (30) :
[Equation]
Under the same conditions as Corollary 6 and whenever (30) is ﬁnite, OMD exhibits last iterate convergence in the same sense as in Corollary 6.
In particular, for large enough t , the last iterate of OMD is within O ( η √ ∆ 0 ) distance from the space of equilibrium points of the game, where √ ∆is the distance of the initial point ( x 0 , y 0 ) from the equilibrium space, and where both distances are taken with respect to the norm (cid:112)
x T AA T x +
y T A T Ay .
Whenever (30) is inﬁnite or undeﬁned, the
OMD dynamics travels to inﬁnity and we characterize its motion.
Proof of Theorem 7: Trivially, we need only consider functions of the form x T Ay + b T x + c T y .
We consider the following decompositions of b and c :
[Equation]
where b 1 ∈ R ( A ) , b 2 ∈ N ( A T ) c
= c 1 + cwhere c 1 ∈ R ( A T ) , c 2 ∈ N ( A )
Given the above we can also deﬁne b 3 and c 3 as follows:
[Equation]
feasible since b 1 ∈ R ( A )
[Equation]
feasible since c 1 ∈ R ( A T )
Then, we can make the following variable substition:
[Equation]
so that:
[Equation]
since b 2 ∈ N ( A T )
[Equation]
since c 2 ∈ N ( A )
We also state the OMD dynamics for x t and y t for problem (30):
[Equation]
Note that given this update step:
[Equation]
Analogously:
[Equation]
Note that these are precisely the dynamics for which we proved convergence in Theorem 1.
Thus, by invoking Theorem 3 and Corollary 6 on the sequence ( α t , β t ) and then substituting back ( x t , y t ) , we have that for all large enough t :
[Equation]
such that ||
[Equation]
where ∆ 0 =
[Equation]
In particular, this shows that, whenever (30) is ﬁnite (i.e. b 2 =
c 2 = 0 ), OMD exhibits last iterate convergence.
For large enough t , the last iterate of OMD is within O ( η √ ∆ 0 ) distance from the space of equilibrium points of the game, where √ ∆ 0 is the distance of ( x 0 + b 3 , y
+ c 3 ) from the equilibrium space in the norm (cid:112) x T AA T x + y T A T Ay .
Whenever (30) is inﬁnite or undeﬁned, the OMD dynamics travels to inﬁnity linearly, with ﬂuctuations around the divergence speciﬁed as above.
D. O MITTED P ROOFS
Proof of Proposition 1: To show this, we consider the (cid:96) 2 distance of the solution at time t .
First, recall the GD update step in the special case of f ( x, y )
=
x T y :
[Equation]
Then, note that the squared (cid:96) 2 distance of the running iterate ( x t , y t ) to the unique equilibrium solution (0 , 0) is given by d ( t ) :
=
|| x
[Equation]
|| 22 , which we can calculate:
[Equation]
This indicates that for any value of η > 0 , the running iterate of GD diverges from the equilibrium [Equation]
Proof of Claim 1: For our ﬁrst claim, observe that:
[Equation]
For our second claim:
[Equation]
Proof of Lemma 2: First, we note the following scaled update rule:
[Equation]
Then, taking the norm of both sides
[Equation]
and using the statements of Claim 1:
[Equation]
Expanding the ﬁrst inner product above:
[Equation]
Then
[Equation]
multiplying by 2 η and substituting yields:
[Equation]
Now, consider the following inner product:
[Equation]
Once again, we multiply by − 4 η 2 and substitute:
[Equation]
Now, we use the update step for time t − 2 ; For all t ≥ 1 , this is well-formed, since x − 1 and y −are deﬁned.
To ensure that this step is sound for t = 0 requires we deﬁne the following, where X + denotes the generalized inverse:
[Equation]
We deﬁne these such that: A T x − 2 =
A T x 0 + y 0 η
and Ay − 2 =
Ay 0 − x 0 η (since x 0 ∈ R ( A ) and y 0 ∈ R
( A T ) , and thus:
[Equation]
This allows us to use the following expansion freely for all t ≥ 0 :
[Equation]
We can gather the inner product terms and use this update rule to get our ﬁnal desired result:
[Equation]
Proof of Lemma 4: To prove this
[Equation]
ﬁrst consider the following trivial inequality:
[Equation]
≥
[Equation]
Then, rearranging:
[Equation]
Now, using the update rule we know that:
[Equation]
Applying this for t − 4 (using the same construction of x − 2 , y − 2 found in the Proof of Lemma 2 to ensure well-formedness) yields:
[Equation]
Now
[Equation]
we can apply this bound to the result of Lemma 2:
[Equation]
Which is what we sought out to prove.
Proof of Lemma 5: Now, note that choosing x 0 ∈ R ( A ) =
⇒ x t ∈ R ( A ) =
R ( AA T ) ∀ t , due to the update step.
Similarly, y t ∈ R ( A T ) .
Thus, x = AA T ( AA T ) + x , and similarly y =
A T A ( A T A ) + .
Letting Q
= ( AA T ) + and P =
( A T A )
+ , and recalling key properties of the generalized inverse:
[Equation]
| 2if j =(cid:12)(cid:12)(cid:12)(cid:12) PM i +
A T x (cid:12)(cid:12)(cid:12)(cid:12) 2 2 + ||
QN
i +
Ay t ||if j =≤ max ( || Q || , || P || ) ·
∆ i +1 t
E DNA-G ENERATION WGAN A RCHITECTURE
Operation
Kernel
Output Shape
BatchNorm?
Nonlinearity
Length of DNA sequence: L =
Gradient penalty: λ = 1 e −
Batch size:
G ( z ) :
z - - -
Fully connectedno tanh
Fully connected16 ×
Lyes tanh
Reshape16 × 1 × L- -
Upsampling by16 × 1 × L - -
Convolution [1 × 3] ×4 × 1 × L no tanh
D ( x ) : x4 × 1 × L - -
Convolution [1 × 3] ×16 × 1 × L no tanh
Fully connectedno tanh
Fully connectedno linear
F CIFAR10 WGAN A RCHITECTURE
Operation
Kernel
Output Shape
BatchNorm?
Nonlinearity
Gradient penalty: λ =
Batch size:
G ( z ) :
z - - -
Fully connectedno
LeakyReLU
Fully connectedyes
LeakyReLU
Reshape128 × 8 ×- -
TransposedConv [5 × 5] ×128 × 16 ×yes
LeakyReLU
Convolution [5 × 5] ×64 × 16 ×yes
LeakyReLU
TransposedConv [5 × 5]
×64 × 32 ×yes
LeakyReLU
Convolution [5 × 5] ×3 × 32 ×no tanh
D ( x ) : x3 × 32 ×- -
Convolution [5 × 5] ×64 × 32 ×no
LeakyReLU
Convolution [5 × 5] ×128 × 14 ×no
LeakyReLU
Convolution [
[Table] [Table]
[Table]
Fully connected
[Table]
Fully connected
[Table]
linear
G CIFAR10 G ENERATOR I MAGE S AMPLES
[Figure]
G. C OMPARISON OF E ARLY E POCH I MAGES OF O PTIMISTIC A DAM VS A DAM
Below we give samples of images from an early epoch 19 Generator trained via Optimistic Adam with 1:1 training ratio, Adam with 1:1 and Adam with 5:1 ratio on CIFAR10.
We see that Optimistic
Adam has already achieved visually appealing results unlike the latter two vanilla Adam based versions.