mlsanityData to 7 Oct 2026

Face Super-Resolution Through Wasserstein GANs

arXiv 1705.02438 ↗First posted 6 May 2017cs.LG stat.MLcited by 9

Not on the map. Why?

Abstract (arXiv)

Generative adversarial networks (GANs) have received a tremendous amount of attention in the past few years, and have inspired applications addressing a wide range of problems. Despite its great potential, GANs are difficult to train. Recently, a series of papers (Arjovsky & Bottou, 2017a; Arjovsky et al. 2017b; and Gulrajani et al. 2017) proposed using Wasserstein distance as the training objective and promised easy, stable GAN training across architectures with minimal hyperparameter tuning. In this paper, we compare the performance of Wasserstein distance with other training objectives on a variety of GAN architectures in the context of single image super-resolution. Our results agree that Wasserstein GAN with gradient penalty (WGAN-GP) provides stable and converging GAN training and that Wasserstein distance is an effective metric to gauge training progress.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 May 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 2; 2023: 2; 2024: 0; 2025: 1.

9 papers.