user: text: Write a concise one-sentence TLDR summary of the scientific paper content below.

Title: Generative Adversarial Network Training is a Continual Learning Problem

Paper content:
Generative Adversarial Networks (GANs) have proven to be a powerful framework for learning to draw samples from complex distributions.
However, GANs are also notoriously difficult 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.
Generative Adversarial Networks BID6 (GANs) are a popular framework for modeling draws from complex distributions, demonstrating success in a wide variety of settings, for example image synthesis BID14 and language modeling .
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 significantly sharper and more realistic than those of other classes of models BID16 .
On the other hand, GAN training can be notoriously finicky.
One particularly well-known and common failure mode is mode collapse BID0 BID35 : instead of producing samples sufficiently 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 FIG0 ), it appears that the generator can revisit previously collapsed modes.
At first, 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 BID20 BID30 : 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 classifier, with the two classes being the real data and the generator's outputs. Implicit
to the training of a standard classifier 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 class (and thus the discriminator's training data) evolves over time. Moreover,
these changes in the generator's distribution are adversarial, designed specifically 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 indefinitely 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 BID3 . 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 BID15 and intelligent synapses BID39 . 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.
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 fields studied independently of each other, have the potential to benefit each other, as new continual learning methods stand to benefit GAN training, and GAN generated datasets provide new testing grounds for continual learning.

assistant: text: Generative Adversarial Network Training is a Continual Learning Problem.