G ENERATIVE A DVERSARIAL N ETWORK T RAINING IS A C ONTINUAL L EARNING P ROBLEM
Anonymous authors
Paper under double-blind review
A BSTRACT
Generative Adversarial Networks (GANs) have proven to be a powerful framework for learning to draw samples from complex distributions.
However, GANs are also notoriously difﬁcult to train, with mode collapse and oscillations a common problem.
We hypothesize that this is at least in part due to the evolution of the generator distribution and the catastrophic forgetting tendency of neural networks, which leads to the discriminator losing the ability to remember synthesized samples from previous instantiations of the generator.
Recognizing this, our contributions are twofold.
First, we show that GAN training makes for a more interesting and realistic benchmark for continual learning methods evaluation than some of the more canonical datasets.
Second, we propose leveraging continual learning techniques to augment the discriminator, preserving its ability to recognize previous generator samples.
We show that the resulting methods add only a light amount of computation, involve minimal changes to the model, and result in better overall performance on the examined image and text generation tasks.
I NTRODUCTION
Generative Adversarial Networks (Goodfellow et al., 2014) (GANs) are a popular framework for modeling draws from complex distributions, demonstrating success in a wide variety of settings,
for example image synthesis
(Radford et al., 2016; Karras et al., 2018) and language modeling (Li et al., 2017).
In the GAN setup, two agents, the discriminator and the generator (each usually a neural network), are pitted against each other.
The generator learns a mapping from an easy-to-sample latent space to a distribution in the data space, which ideally matches the real data’s distribution.
At the same time, the discriminator aims to distinguish the generator’s synthesized samples from the real data samples.
When trained successfully, GANs yield impressive results; in the image domain for example, synthesized images from GAN models are signiﬁcantly sharper and more realistic than those of other classes of models (Larsen et al., 2016).
On the other hand, GAN training can be notoriously ﬁnicky.
One particularly well-known and common failure mode is mode collapse (Che et al., 2017; Srivastava et al., 2017): instead of producing samples sufﬁciently representing the true data distribution, the generator maps the entire latent space to a limited subset of the real data space.
When mode collapse occurs, the generator does not “converge,” in the conventional sense, to a stationary distribution.
Rather, because the discriminator can easily learn to recognize a modecollapsed set of samples and the generator is optimized to avoid the discriminator’s detection, the two end up playing a never-ending game of cat and mouse: the generator meanders towards regions in the data space the discriminator thinks are real (likely near where the real data lie) while the discriminator chases after it.
Interestingly though, if generated samples are plotted through time (as in Figure 1), it appears that the generator can revisit previously collapsed modes.
At ﬁrst, this may seem odd.
The discriminator was ostensibly trained to recognize that mode in a previous iteration and did so well enough to push the generator away from generating those samples.
Why has the discriminator seemingly lost this ability?
We conjecture that this oscillation phenomenon is enabled by catastrophic forgetting (McCloskey &
Cohen, 1989; Ratcliff, 1990): neural networks have a well-known tendency to forget how to complete old tasks while learning new ones.
In most GAN models, the discriminator is a binary classiﬁer, with the two classes being the real data and the generator’s outputs.
Implicit to the training of a standard classiﬁer is the assumption that the data are drawn independently and identically distributed (i.i.d.).
Importantly, this assumption does not hold true in GANs: the distribution of the generator
[Figure]
class (and thus the discriminator’s training data) evolves over time.
Moreover, these changes in the generator’s distribution are adversarial, designed speciﬁcally to deteriorate discriminator performance on the fake class as much as possible.
Thus, the alternating training procedure of GANs in actuality corresponds to the discriminator learning tasks sequentially, where each task corresponds to recognizing samples from the generator at that particular point in time.
Without any measures to prevent catastrophic forgetting, the discriminator’s ability to recognize fake samples from previous iterations will be clobbered by subsequent gradient updates, allowing a mode-collapsed generator to revisit old modes if training runs long enough.
Given this tendency, a collapsed generator can wander indeﬁnitely without ever learning the true distribution.
With this perspective in mind, we cast training the GAN discriminator as a continual learning problem, leading to two main contributions.
( i )
While developing systems that learn tasks in a sequential manner without suffering from catastrophic forgetting has become a popular direction of research, current benchmarks have recently come under scrutiny as being unrepresentative to the fundamental challenges of continual learning (Farquhar & Gal, 2018).
We argue that GAN training is a more realistic setting, and one that current methods tend to fail on.
( ii ) Such a reframing of the GAN problem allows us to leverage relevant methods to better match the dynamics of training the min-max objective.
In particular, we build upon the recently proposed elastic weight consolidation (Kirkpatrick et al., 2017) and intelligent synapses (Zenke et al., 2017).
By preserving the discriminator’s ability to identify previous generator samples, this memory prevents the generator from simply revisiting past distributions.
Adapting the GAN training procedure to account for catastrophic forgetting provides an improvement in GAN performance for little computational cost and without the need to train additional networks.
Experiments on CelebA and CIFAR10 image generation and COCO Captions text generation show discriminator continual learning leads to better generations.
B ACKGROUND : C ATASTROPHIC FORGETTING IN GAN S
Consider distribution p real ( x ) , from which we have data samples D real .
Seeking a mechanism to draw samples from this distribution, we learn a mapping from an easy-to-sample latent distribution p ( z ) to a data distribution p gen ( x ) , which we want to match p real ( x ) .
This mapping is parameterized as a neural network G φ ( z ) with parameters φ , termed the generator.
The synthesized data are drawn x =
G φ ( z ) , with z ∼ p ( z ) .
The form of p gen ( x ) is not explicitly assumed or learned; rather, we learn to draw samples from p gen ( x ) .
To provide feedback to G φ ( z ) , we simultaneously learn a binary classiﬁer that aims to distinguish synthesized samples D gen drawn from p gen ( x ) from the true samples D real .
We also parameterize this classiﬁer as a neural network D θ ( x ) ∈ [0 , 1] with parameters θ , with D θ ( x ) termed the discriminator.
By incentivizing the generator to fool the discriminator into thinking its generations are actually from the true data, we hope to learn G φ ( z ) such that p gen ( x ) approaches p real ( x )
These two opposing goals for the generator and discriminator are usually formulated as the following min-max objective:
[Equation]
G φ ( z )))] (1) At each iteration t , we sample from p gen ( x ) , yielding generated data D gen t .
These generated samples, along with samples from D real , are then passed to the discriminator.
A gradient descent optimizer nudges θ so that the discriminator takes a step towards maximizing L GAN ( θ , φ ) .
Parameters φ are updated similarly, but to minimize L GAN ( θ , φ ) .
These updates to θ and φ take place in an alternating fashion.
The expectations are approximated using samples from the respective distributions, and therefore learning only requires observed samples D real and samples from p gen ( x ) .
The updates to G φ ( z ) mean that p gen ( x ) changes as a function of t , perhaps substantially.
Consequently, samples {D gen1 , ..., D gen t } come from a sequence of different distributions.
At iteration t , only samples from D gen t are available, as G φ ( z ) has changed, and saving previous instantiations of the generator or samples {D gen1 , ..., D gen t − 1 } can be prohibitive.
Thus, D θ ( x ) is typically only provided D gen t , so it only learns the most recent distribution, with complete disregard for previous p gen ( x ) .
Because of the catastrophic forgetting effect of neural networks, the ability of D θ ( x ) to recognize these previous distributions is eventually lost in the pursuit of maximizing L GAN ( θ , φ ) with respect to only D gen t .
This opens the possibility that the generator goes back to generating samples the discriminator had previously learned (and then forgot) to recognize, leading to unstable mode-collapsed oscillations that hamper GAN training (as in Figure 1).
Recognizing this problem, we propose that the discriminator should be trained with the temporal component of p gen ( x ) in mind.
M ETHOD 3. C LASSIC C ONTINUAL LEARNING
Catastrophic forgetting has long been known to be a problem with neural networks trained on a series of tasks (McCloskey & Cohen, 1989; Ratcliff, 1990).
While there are many approaches to addressing catastrophic forgetting, here we primarily focus on elastic weight consolidation (EWC) and intelligent synapses (IS).
These are meant to illustrate the potential of catastrophic forgetting mitigation to improve GAN learning, with the expectation that this opens up the possibility of other such methods to signiﬁcantly improve GAN training, at low additional computational cost.
3.1. E LASTIC WEIGHT CONSOLIDATION (EWC)
To derive the EWC loss, Kirkpatrick et al.
(2017) frames training a model as ﬁnding the most probable values of the parameters θ given the data D .
For two tasks, the data are assumed partitioned into independent sets according to the task, and the posterior for Task 1 is approximated as a Gaussian with mean centered on the optimal parameters for Task 1 θ ∗ 1 and diagonal precision given by the diagonal of the Fisher information matrix F 1 at θ ∗ 1 .
This gives the EWC loss the following form:
[Equation]
where L 2 ( θ ) = log p ( D 2 | θ ) is the loss for Task 2 individually, λ is a hyperparameter representing the importance of Task 1 relative to Task 2 , F 1 ,i = (cid:0)
∂
L 1 ( θ ) ∂θ i (cid:12) (cid:12) θ
= θ ∗ 1 ) 2 , i is the parameter index, and
L ( θ ) is the new loss to optimize while learning Task 2 .
Intuitively, the EWC loss prevents the model from straying too far away from the parameters important for Task 1 while leaving less crucial parameters free to model Task 2 .
Subsequent tasks result in additional L EWC ( θ ) terms added to the loss for each previous task.
By protecting the parameters deemed important for prior tasks, EWC as a regularization term allows a single neural network (assuming sufﬁcient parameters and capacity) to learn new tasks in a sequential fashion, without forgetting how to perform previous tasks.
3.1. I NTELLIGENT SYNAPSES (IS)
While EWC makes a point estimate of how essential each parameter is at the conclusion of a task,
IS (Zenke et al., 2017) protects the parameters according to their importance along the task’s entire training trajectory.
Termed synapses, each parameter θ i of the neural network is awarded an importance measure ω 1 ,i based on how much it reduced the loss while learning Task 1 .
Given a loss gradient g ( t ) = ∇ θ L ( θ ) | θ = θ t at time t , the total change in loss during the training of Taskthen is the sum of differential changes in loss over the training trajectory.
With the assumption that parameters θ are independent, we have:
[Equation]
where θ (cid:48)
=
d θ dt and ( t 0 , t 1 ) are the start and ﬁnish of Task 1, respectively.
Note the added negative sign, as importance is associated with parameters that decrease the loss.
The importance measure ω 1 ,i can now be used to introduce a regularization term that protects parameters important for Task 1 from large parameter updates, just as the Fisher information matrix diagonal terms F 1 ,i were used in EWC.
This results in an IS loss very reminiscent in form 1 :
[Equation]
3. GAN C ONTINUAL LEARNING
The traditional continual learning methods are designed for certain canonical benchmarks, commonly consisting of a small number of clearly deﬁned tasks (e.g., classiﬁcation datasets in sequence).
In GANs, the discriminator is trained on dataset D t =
{D real , D gen t } at each iteration t .
However, because of the evolution of the generator, the distribution p gen ( x ) from which D gen t comes changes over time.
This violates the i.i.d.
assumption of the order in which we present the discriminator data.
As such, we argue that different instances in time of the generator should be viewed as separate tasks.
Speciﬁcally, in the parlance of continual learning, the training data are to be regarded as
D = { ( D real , D gen1 ) , ( D real , D gen2 ) , ... } .
Thus motivated, we would like to apply continual learning methods to the discriminator, but doing so is not straightforward for the following reasons:
• Deﬁnition of a task : EWC and IS
were originally proposed for discrete, well-deﬁned tasks.
For example, Kirkpatrick et al.
(2017) applied EWC to a DQN (Mnih et al., 2015) learning to play ten Atari games sequentially, with each game being a clear, independent task.
For GAN, there is no such precise deﬁnition as to what constitutes a “task,” and as discriminators are not typically trained to convergence at every iteration, it is also unclear how long a task should be.
• Computational memory : While Equations 2 and 4 are for two tasks, they can be extended to K tasks by adding a term L EWC or L IS for each of the K − 1 prior tasks.
As each term L EWC or L IS requires saving both a historical reference term θ ∗ k and either F k or ω k
(all of which are the same size as the model parameters θ ) for each task k , employing these techniques naively quickly becomes impractical for bigger models when K gets large, especially if K is set to the number of training iterations T .
• Continual not learning : Early iterations of the discriminator are likely to be non-optimal, and without a forgetting mechanism, EWC and IS may forever lock the discriminator to a poor initialization.
Additionally, the unconstrained addition of a large number of terms L EWC or L IS will cause the continual learning regularization term to grow unbounded, which can disincentivize any further changes in θ .
To address these issues, we build upon the aforementioned continual learning techniques, and propose several changes.
Number of tasks as a rate : We choose the total number of tasks K as a function of a constant rate α , which denotes the number of iterations before the conclusion of a task, as opposed to arbitrarily dividing the GAN training iterations into some set number of segments.
Given T training iterations, this means a rate α yields K =
Tα tasks.
Online Memory :
Seeking a way to avoid storing extra θ ∗ k , F k , or ω k , we observe that the sum of two or more quadratic forms is another quadratic, which gives the classiﬁer loss with continual learning the following form for the ( k + 1) th task:
[Equation]
where ¯ θ ∗ k,i =
P k,i S k,i , S k,i = (cid:80)
k κ =1 Q κ,i , P k,i =
(cid:80) k κ =1 Q κ,i θ ∗ κ,i , and Q κ,i is either F κ,i or ω κ,i , depending on the method.
We name models with EWC and IS augmentations EWC-GAN and ISGAN, respectively.
Controlled forgetting : To provide a mechanism for forgetting earlier non-optimal versions of the discriminator and to keep L CL bounded, we add a discount factor γ : S k,i = (cid:80) kκ
=1 γ k − κ Q κ,i and
P k,i =
(cid:80) kκ
=1 γ k − κ Q κ,i θ ∗ κ,i .
Together, α and γ determine how far into the past the discriminator remembers previous generator distributions, and λ controls how important memory is relative to the discriminator loss.
Note, the terms S k and P k can be updated every α steps in an online fashion:
[Equation]
This allows the EWC or IS loss to be applied without necessitating storing either Q k or θ ∗ k for every task k , which would quickly become too costly to be practical.
Only a single variable to store a running average is required for each of S k and P k , making this method space efﬁcient.
Augmenting the discriminator with the continual learning loss, the GAN objective becomes:
[Equation]
Note that the training of the generator remains the same; full algorithms are in Appendix A.
Here we have shown two methods to mitigate catastrophic forgetting for the original GAN; however, the proposed framework is applicable to almost all of the wide range of GAN setups.
R ELATED WORK
Continual learning in GANs There has been previous work investigating continual learning within the context of GANs.
Improved GAN (Salimans et al., 2016) introduced historical averaging, which regularizes the model with a running average of parameters of the most recent iterations.
Simulated+Unsupervised training (Shrivastava et al., 2017) proposed replacing half of each minibatch with previous generator samples during training of the discriminator, as a generated sample at any point in time should always be considered fake.
However, such an approach necessitates a historical buffer of samples and halves the number of current samples that can be considered.
Continual
Learning GAN (Seff et al., 2018) applied EWC to GAN, as we have, but used it in the context of the class-conditioned generator that learns classes sequentially, as opposed to all at once, as we propose. Thanh-Tung et al.
(2018) independently reached a similar conclusion on catastrophic forgetting in
GANs, but focused on gradient penalties and momentum on toy problems.
Multiple network GANs The heart of continual learning is distilling a network’s knowledge through time into a single network, a temporal version of the ensemble described in Hinton et al.
There have been several proposed models utilizing multiple generators (Hoang et al., 2018;
Ghosh et al., 2018) or multiple discriminators (Durugkar et al., 2017; Neyshabur et al., 2017), while
Bayesian GAN (Saatchi & Wilson, 2017) considered distributions on the parameters of both networks, but these all do not consider time as the source of the ensemble.
Unrolled GAN (Metz et al., 2017) considered multiple discriminators “unrolled” through time, which is similar to our method, as the continual learning losses also utilize historical instances of discriminators.
However, both
EWC-GAN and IS-GAN preserve the important parameters for prior discriminator performance, as opposed to requiring backpropagation of generator samples through multiple networks, making them easier to implement and train.
GAN convergence While GAN convergence is not the focus of this paper, convergence does similarly avoid mode collapse, and there are a number of works on the topic (Heusel et al., 2017;
Unterthiner et al., 2018; Nagarajan & Kolter, 2017; Mescheder et al., 2017).
From the perspective of Heusel et al.
(2017), EWC or IS regularization in GAN can be viewed as achieving convergence by slowing the discriminator, but per parameter, as opposed to a slower global learning rate.
E XPERIMENTS 5. D ISCRIMINATOR C ATASTROPHIC F ORGETTING
While Figure 1 implies catastrophic forgetting in a GAN discriminator, we can show this concretely.
To do so, we ﬁrst train a DCGAN (Radford et al., 2016) on the MNIST dataset.
Since the generator is capable of generating an arbitrary number of samples at any point, we can randomly drawsamples to comprise a new, “fake MNIST” dataset at any time.
By doing this at regular intervals, we create datasets {D gen 1 , ..., D gen T } from p gen ( x ) at times 1 , ..., T .
Samples are shown in Appendix B.
Having previously generated a series of datasets during the training of a DCGAN, we now reinitialize the discriminator and train to convergence on each D gen t in sequence.
Importantly, we do not include samples from D gen <t while ﬁne-tuning on D gen t .
After ﬁne-tuning on the train split of dataset D gen t , the percentage of generated examples correctly identiﬁed as fake by the discriminator is evaluated on the test splits of D gen ≤ t , with and without EWC (Figure 2).
The catastrophic forgetting effect of the discriminator trained with SGD is clear, with a steep drop-off in discriminating ability on D gen t −after ﬁne-tuning on D gen t ; this is unsurprising, as p gen ( x ) has evolved speciﬁcally to deteriorate discriminator performance.
While there is still a dropoff with EWC, forgetting is less severe.
While the training outlined above is not what is typical for GAN, we choose this set-up as it closely mirrors the continual learning literature.
With recent criticisms of some common continual learning benchmarks as either being too easy or missing the point of continual learning (Farquhar & Gal, 2018), we propose GAN as a new benchmark providing a more realistic setting.
From Figure 2, it is clear that while EWC certainly helps, there is still much room to improve with new continual learning methods.
However, the merits of GAN as a continual learning benchmark go beyond difﬁculty.
While it is unclear why one would ever use a single model to classify successive random permutations of MNIST (Goodfellow et al., 2013), many real-world settings exist where the data distribution is slowly evolving.
For such models, we would like to be able to update the deployed model without forgetting previously learned performance, especially when data collection is expensive and thus done in bulk sometime before deployment.
For example, autonomous vehicles (Huval et al., 2015) will eventually encounter unseen car models or obstacles, and automated screening systems at airport checkpoints (Liang et al., 2018) will have to deal with evolving bags, passenger belongings, and threats.
In both cases, sustained effectiveness requires a way to appropriately and efﬁciently update the models for new data, or risk obsolescence leading to dangerous blindspots.
Many machine learning datasets represent singe-time snapshots of the data distribution, and current continual learning benchmarks fail to capture the slow drift of the real-world data.
The evolution of
GAN synthesized samples represents an opportunity to generate an unlimited number of smoothly evolving datasets for such experiments.
We note that while the setup used here is for binary real/fake classiﬁcation, one could also conceivably use a conditional GAN (Mirza & Osindero, 2014) to generate an evolving multi-class classiﬁcation dataset.
We leave this exploration for future work.
5. M IXTURE OF EIGHT G AUSSIANS
We show results on a toy dataset consisting of a mixture of eight Gaussians, as in the example in
Figure 1.
Following the setup of (Metz et al., 2017), the real data are evenly distributed among eight 2-dimensional Gaussian distributions arranged in a circle of radius 2, each with covariance 0 .
02 I (see Figure 4).
We evaluate our model with Inception Score (ICP)
(Salimans et al., 2016), which gives a rough measure of diversity and quality of samples; higher scores imply better performance, with the true data resulting in a score of around 7.870.
For this simple dataset, since we know the true data distribution, we also calculate the symmetric Kullback–Leibler divergence (Sym-KL); lower scores mean the generated samples are closer to the true data.
We show computation time, measured in numbers of training iterations per second (Iter/s), averaged over the full training of a model on a single Nvidia Titan X (Pascal) GPU.
Each model was run 10 times, with the mean and standard deviation of each performance metric at the end of 25K iterations reported in Table 1.
[Table]
The performance of EWC-GAN and IS-GAN were evaluated for a number of hyperparameter settings.
We compare our results against a vanilla GAN (Goodfellow et al., 2014), as well as a state-ofthe-art GAN with spectral normalization (SN) (Miyato et al., 2018) applied to the discriminator.
As spectral normalization augments the discriminator loss in a way different from continual learning, we can combine the two methods; this variant is also shown.
Note that a discounted version of discriminator historical averaging (Salimans et al., 2016) can be recovered from the EWC and IS losses if the task rate α = 1 and Q k,i = 1 for all i and k , a poor approximation to both the Fisher information matrix diagonal and importance measure.
If we also set the historical reference term ¯ θ ∗ k and the discount factor γ to zero, then the EWC and IS losses become (cid:96) 2 weight regularization.
These two special cases are also included for comparison.
We observe that augmenting GAN models with EWC and IS consistently results in generators that better match the true distribution, both qualitatively and quantitatively, for a wide range of hyperparameter settings.
EWC-GAN and IS-GAN result in a better ICP and FID than (cid:96) 2 weight regularization and discounted historical averaging, showing the value of prioritizing protecting important parameters, rather than all parameters equally.
EWC-GAN and IS-GAN also outperform a stateof-the-art method in SN-GAN.
In terms of training time, updating the EWC loss requires forward propagating a new minibatch through the discriminator and updating S and P , but even if this is done at every step ( α = 1 ), the resulting algorithm is only slightly slower than SN-GAN.
Moreover, doing so is unnecessary, as higher values of α also provide strong performance for a much smaller time penalty.
Combining EWC with SN-GAN leads to even better results, showing that the two methods can complement each other.
IS-GAN can also be successfully combined with SN-GAN, but it is slower than EWC-GAN as it requires tracking the trajectory of parameters at each step.
Sample generation evolution over time is shown in Figure 4 of Appendix C.
5. I MAGE GENERATION OF C ELEB A AND CIFAR-
Since EWC-GAN achieves similar performance to IS-GAN but at less computational expense, we focus on the former for experiments on two image datasets, CelebA and CIFAR-10.
Our EWCGAN implementation is straightforward to add to any GAN model, so we augment various popular implementations.
Comparisons are made with the TTUR (Heusel et al., 2017) variants 2 of DCGAN (Radford et al., 2016) and WGAN-GP (Gulrajani et al., 2017), as well as an implementation 3 of a spectral normalized (Miyato et al., 2018) DCGAN (SN-DCGAN).
Without modifying the learning rate or model architecture, we show results with and without the EWC loss term added to the discriminator for each.
Performance is quantiﬁed with the Fr ´ echet Inception Distance (FID) (Heusel et al., 2017) for both datasets.
Since labels are available for CIFAR-10, we also report ICP for that dataset.
Best values are reported in Table 2, with samples in Appendix C. In each model, we see improvement in both FID and ICP from the addition of EWC to the discriminator.
[Table] [Table]
[Table]
5. T EXT GENERATION OF COCO C APTIONS
We also consider the text generation on the MS COCO Captions dataset (Chen et al., 2015), with the pre-processing in Guo et al.
Quality of generated sentences is evaluated by BLEU score (Papineni et al., 2002).
Since BLEU- b measures the overlap of b consecutive words between the generated sentences and ground-truth references, higher BLEU scores indicate better ﬂuency.
Self
BLEU uses the generated sentences themselves as references; lower values indicate higher diversity.
We apply EWC and IS to textGAN (Zhang et al., 2017), a recently proposed model for text generation in which the discriminator uses feature matching to stabilize training.
This model’s results (labeled “EWC” and “IS”) are compared to a Maximum Likelihood Estimation (MLE) baseline, as well as several state-of-the-art methods: SeqGAN (Yu et al., 2017), RankGAN (Lin et al., 2017),
GSGAN (Jang et al., 2016) and LeakGAN (Guo et al., 2018).
Our variants of textGAN outperforms the vanilla textGAN for all BLEU scores (see Table 3), indicating the effectiveness of addressing the forgetting issue for GAN training in text generation.
EWC/IS + textGAN also demonstrate a signiﬁcant improvement compared with other methods, especially on BLEU-2 and 3.
Though our variants lag slightly behind LeakGAN on BLEU-4 and 5, their self BLEU scores (Table 4) indicate it generates more diverse sentences.
Sample sentence generations can be found in Appendix C.
C ONCLUSION
We observe that the alternating training procedure of GAN models results in a continual learning problem for the discriminator, and training on only the most recent generations leads to consequences unaccounted for by most models.
As such, we propose augmenting the GAN training objective with a continual learning regularization term for the discriminator to prevent its parameters from moving too far away from values that were important for recognizing synthesized samples from previous training iterations.
Since the original EWC and IS losses were proposed for discrete tasks, we adapt them to the GAN setting.
Our implementation is simple to add to almost any variation of GAN learning, and we do so for a number of popular models, showing a gain in ICP and
FID for CelebA and CIFAR-10, as well as BLEU scores for COCO Captions.
More importantly, we demonstrate that GAN and continual learning, two popular ﬁelds studied independently of each other, have the potential to beneﬁt each other, as new continual learning methods stand to beneﬁt
GAN training, and GAN generated datasets provide new testing grounds for continual learning.
A A LGORITHM
We summarize the continual learning GAN implementations in Algorithm 1 and
[Table]
[Table] [Table] [Table] [Table]
[Table]
[Table]
[Table]
[Table]
[Table]
{++ 1 m (cid:80) m j =
+}
[log(1 − D θ
{+( G φ ( z j )))] 9: % Update history buffer for previous tasks 10: if mod ( t, α ) = 
+}
then 11: % At the end of a task 12: for parameters θ i in θ : 13:
Q i = (cid:0) ∂
L θ
∂θ i (cid:1) 2 % Q is the Fisher for EWC 14:
S i = γS
i + Q i 15:
P i = γP i + Q
i θ ∗ i 16: ¯ θ ∗ i
= P
i S
i 17: end if 18: % Update discriminator parameter θ , adding EWC 19: ¯ L θ =
L θ − λ 2 (cid:80) i S k,i
( θ i − ¯ θ ∗ k,i ) 20: θ t +1 ← θ t + (cid:15) t ∂ ¯ L θ ∂ θ t 21: % Update generator parameter φ 22:
L φ = 1 m (cid:80) mi =1 [log(1 − D θ ( G φ ( z i )))] 23: φ t +1 ← φ t − (cid:15) t
∂ L φ ∂ φ t 24: end for
1: Input : Training data D real , latent distribution p ( z ) , hyperparameters of continual learning α , γ , λ , step size (cid:15) 2:
Output : θ , φ , and generated samples
D gen = { x j } Nj =1 3: for t = 1 , ..., T do 4: % Sample minibatch of size m 5:
Noise sample: { z j } mj =1 ∼ p ( z ) 6:
Data sample: { x j } mj =1 ∼ D real 7: % Calculate current discriminator loss 8:
L θ = 1 m (cid:80) mj
=1 [log D θ ( x j )]
+ 1 m (cid:80) mj
=1 [log(1 − D θ ( G φ ( z j )))] 9: % Update discriminator parameter θ , adding IS 10: ¯ L θ =
L θ − λ 2 (cid:80) i S k,i
( θ i − ¯ θ ∗ k,i ) 11: g
= ∂
¯ L θ ∂ θ t 12: δ = (cid:15) ∂ ¯ L θ ∂ θ t 13: for θ i in θ do 14: ω i =
ω
i + g i δ i 15: end for 16: θ t +1 ← θ t + (cid:15) t
∂ ¯ L θ ∂ θ t 17: % Update history buffer for previous tasks 18: if mod ( t, α ) =
then 19: % At the end of a task 20: for parameters θ i in θ : 21:
Q i = ω i
% Q is the Importance measure for IS 22:
S i = γS
i + Q i 23:
P i = γP i + Q
i θ ∗ i 24: ¯ θ ∗ i
= P
i S
i 25: ω =26: end if 27: % Update generator parameter φ 28:
L φ = 1 m (cid:80) mi =1 [log(1 − D θ ( G φ ( z i )))] 29: φ t +1 ← φ t − (cid:15)
[Table] [Table]
[Table]
B G ENERATED MNIST D ATASETS FOR C ONTINUAL L EARNING B ENCHMARKING
To produce a smoothly evolving series of datasets for continual learning, we train a DCGAN on
MNIST and generate an entire “fake” dataset of 70K samples every 50 training iterations of the DCGAN generator.
We propose learning each of these generated datasets as individual tasks for continual learning.
Selected samples are shown in Figure 3 from the datasets D gent for t ∈ { 5 , 10 , 15 , 20 } , each generated from the same 100 samples of z for all t .
Note that we actually trained a conditional DCGAN, meaning we also have the labels for each generated image.
For experiments in
Figure 2, we focused on the real versus fake task to demonstrate catastrophic forgetting in a GAN discriminator and thus ignored the labels, but future experiments can incorporate such information.
[Figure]
C E XAMPLES OF G ENERATED S AMPLES
Sample generations are plotted during training at 5000 step intervals in Figure 4.
While vanilla GAN occasionally recovers the true distribution, more often than not, the generator collapses and then bounces around.
Spectral Normalized GAN converges to the true distribution quickly in most runs, but it mode collapses and exhibits the same behavior as GAN in others.
EWC-GAN consistently diffuses to all modes, tending to ﬁnd the true distribution sooner with lower α .
We omit IS-GAN, as it performs similarly to EWC-GAN.
[Figure]
We also show the generated image samples for CIFAR 10 and CelebA in Figure 5, and generated text samples for MS COCO Captions in Table 5.
[Figure]
a couple of people are standing by some zebras in the background the view of some benches near a gas station a brown motorcycle standing next to a red fence a bath room with a broken tank on the ﬂoor red passenger train parked under a bridge near a river some snow on the beach that is surrounded by a truck a cake that has been perform in the background for takeoff a view of a city street surrounded by trees two giraffes walking around a ﬁeld during the day crowd of people lined up on motorcycles two yellow sheep with a baby dog in front of other sheep an intersection sits in front of a crowd of people a red double decker bus driving down the street corner an automobile driver stands in the middle of a snowy park ﬁve people at a kitchen setting with a woman there are some planes at the takeoff station a passenger airplane ﬂying in the sky over a cloudy sky three aircraft loaded into an airport with a stop light there is an animal walking in the water an older boy with wine glasses in an ofﬁce two old jets are in the middle of london three motorcycles parked in the shade of a crowd group of yellow school buses parked on an intersection a person laying on a sidewalk next to a sidewalk talking on a cell phone a chef is preparing food with a sink and stainless steel appliances