vix.ing · top · new · best · stats

Are GANs Created Equal? A Large-Scale Study

2017/11/28 by Mario Lucic, Mario Lučić, Karol Kurach +8 · 2 voices · 36 citations
Computer Science · Mathematics · #FOS: Computer and information sciences #Generative Adversarial Networks and Image Synthesis #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Music and Audio Processing #Video Analysis and Summarization #cs.LG #stat.ML

paper · pdf · doi:10.48550/arxiv.1711.10337

NIPS'18: Added a section on the limitations of the study and additional empirical results

openalex publication_date 2017/11/28 · arxiv published 2017/11/28 · arxiv created 2018/10/29 · arxiv updated 2018/10/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Generative adversarial networks (GAN) are a powerful subclass of generative models. Despite a very rich research activity leading to numerous interesting GAN algorithms, it is still very hard to assess which algorithm(s) perform better than others. We conduct a neutral, multi-faceted large-scale empirical study on state-of-the art models and evaluation measures. We find that most models can reach similar scores with enough hyperparameter optimization and random restarts. This suggests that improvements can arise from a higher computational budget and tuning more than fundamental algorithmic changes. To overcome some limitations of the current metrics, we also propose several data sets on which precision and recall can be computed. Our experimental results suggest that future GAN research should be based on more systematic and objective evaluation procedures. Finally, we did not find evidence that any of the tested algorithms consistently outperforms the non-saturating GAN introduced in \citegoodfellow2014generative.

Cited by

Discussions

Related