Mode Penalty Generative Adversarial Network with adapted Auto-encoder

TL;DR

This paper introduces a mode penalty GAN with a pre-trained auto-encoder to improve the stability and convergence of GAN training by explicitly representing data modes and encouraging the generator to cover the entire data distribution.

Contribution

The paper proposes a novel mode penalty GAN that uses a pre-trained auto-encoder to explicitly model data modes, enhancing stability and convergence in GAN training.

Findings

Improved stability in GAN training.

Faster convergence observed in experiments.

Better coverage of data distribution modes.

Abstract

Generative Adversarial Networks (GAN) are trained to generate sample images of interest distribution. To this end, generator network of GAN learns implicit distribution of real data set from the classification with candidate generated samples. Recently, various GANs have suggested novel ideas for stable optimizing of its networks. However, in real implementation, sometimes they still represent a only narrow part of true distribution or fail to converge. We assume this ill posed problem comes from poor gradient from objective function of discriminator, which easily trap the generator in a bad situation. To address this problem, we propose a mode penalty GAN combined with pre-trained auto encoder for explicit representation of generated and real data samples in the encoded space. In this space, we make a generator manifold to follow a real manifold by finding entire modes of target distribution. In addition, penalty for uncovered modes of target distribution is given to the generator which encourages it to find overall target distribution. We demonstrate that applying the proposed method to GANs helps generator's optimization becoming more stable and having faster convergence through experimental evaluations.