Continual Learning in Generative Adversarial Nets
Ari Seff, Alex Beatson, Daniel Suo, Han Liu
TL;DR
This work tackles continual learning for generative adversarial networks when data distributions evolve over time and old data are inaccessible. It adapts elastic weight consolidation to the GAN setting, applying a Fisher-information-based penalty to protect generator parameters critical for previously learned distributions, especially within conditional GANs. Empirical results on MNIST (MLP-GAN) and SVHN (DCGAN) show reduced forgetting of earlier classes while learning new ones, with robustness to the regularization strength and benefits from higher-capacity models. The approach enables scalable, sequential generative modeling without storing or re-synthesizing past data, advancing practical continual learning for generative models.
Abstract
Developments in deep generative models have allowed for tractable learning of high-dimensional data distributions. While the employed learning procedures typically assume that training data is drawn i.i.d. from the distribution of interest, it may be desirable to model distinct distributions which are observed sequentially, such as when different classes are encountered over time. Although conditional variations of deep generative models permit multiple distributions to be modeled by a single network in a disentangled fashion, they are susceptible to catastrophic forgetting when the distributions are encountered sequentially. In this paper, we adapt recent work in reducing catastrophic forgetting to the task of training generative adversarial networks on a sequence of distinct distributions, enabling continual generative modeling.
