Improving Generative Adversarial Networks With Local Coordinate Coding

Generative adversarial networks (GANs) have shown remarkable success in generating realistic data from some predefined prior distributions. However, such prior distributions are often independent of real data and thus may lose semantic information of data. In practice, the semantic information might be represented by some latent distribution learned from data. However, such latent distribution may incur difficulties in data sampling for GAN methods. In this paper, rather than sampling from the predefined prior distribution, we propose a local coordinate coding GAN (LCCGAN-v1) to improve the performance of GANs. First, we propose a local coordinate coding (LCC)-based sampling method to sample points from the latent manifold. With the LCC sampling method, we can exploit the local information on the latent manifold and thus produce new data with promising quality. Second, we propose an advanced LCCGAN-v2 by introducing a higher-order term in the generator approximation. This term is able to achieve better approximation and thus further improve the performance. More critically, we derive the generalization bound for both LCCGAN-v1 and LCCGAN-v2 and prove that a small-dimensional input is sufficient to achieve good generalization performance. Extensive experiments on four benchmark datasets demonstrate the superiority of the proposed method over existing GAN methods.