Wasserstein Generative Adversarial Network with Gradient Penalty for Handwritten Digit Generation

Authors:

Abstract
The Wasserstein Generative Adversarial Network with Gradient Penalty (WGAN-GP) offers a powerful solution for generating high-quality synthetic data, addressing instability and mode collapse issues common in traditional GANs. This article explores the application of WGAN-GP in generating realistic handwritten digits using the MNIST dataset. WGAN-GP utilizes the Wasserstein distance metric rather than Jensen-Shannon divergence and introduces a gradient penalty to maintain the Lipschitz continuity constraint, which significantly improves training stability and image fidelity. We examine the effectiveness of WGAN-GP’s gradient penalty in preventing issues such as vanishing and exploding gradients, optimizing key hyperparameters, and enhancing the architecture for diverse and high-quality digit generation. Experimental results demonstrate WGAN-GP’s success in producing varied, lifelike handwritten digits and highlight the impact of key design choices, including latent space dimensionality and critic iterations, on image quality. Our findings suggest that WGAN-GP is a viable approach for applications requiring high-quality, synthetic digit datasets, potentially benefiting downstream supervised tasks in handwritten digit recognition and augmentation.

This publication has 17 references indexed in Scilit: