Skip to content

GAN(Generative Adversarial Nets)

Journal of Japan Society for Fuzzy Theory and Intelligent Informatics · 2017 · 20,513 citationsOpen access

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

淳司 柴田. (2017). GAN(Generative adversarial nets). Journal of Japan Society for Fuzzy Theory and Intelligent Informatics, 29(5), 177. https://doi.org/10.3156/jsoft.29.5_177_2

In text: (淳司, 2017)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

We propose a new framework for estimating generative models via an adversarial process, in which we simultaneously train two models: a generative model G that captures the data distribution, and a discriminative model D that estimates the probability that a sample came from the training data rather than G. The training procedure for G is to maximize the probability of D making a mistake. This framework corresponds to a minimax two-player game. In the space of arbitrary functions G and D, a unique solution exists, with G recovering the training data distribution and D equal to ½ everywhere. In the case where G and D are defined by multilayer perceptrons, the entire system can be trained with backpropagation. There is no need for any Markov chains or unrolled approximate inference networks during either training or generation of samples. Experiments demonstrate the potential of the framework through qualitative and quantitative evaluation of the generated samples.

  1. Long Short-Term Memory1997
  2. Gradient-based learning applied to document recognition1998
  3. Particle swarm optimization2002
  4. Greedy function approximation: A gradient boosting machine.2001
  5. Statistical Learning Theory1999

Metadata from OpenAlex (CC0). Citations are generated from the published record.