Generative Adversarial Nets (Ian J. Goodfellow et al., 2014 NIPS)
Motivation Deep learning experienced most striking success in discriminative models. However, Deep generative models have had less of an impact because it is hard to approximate intractable probabilistic computations and leverage the benefits of piecewise linear units. The proposed new generative model sidesteps these difficulties by using minimax two-player game. The good analogous of two players are the team of counterfeiters and the police. Solution Minimax two-player game: $\displaystyle \min_{G}\max_{D} V(D, G) = \mathbb{E}_{x \sim p_{data}} \left [ \log D(x) \right ] + \mathbb{E}_{x \sim p_z(z)} \left [ \log (1 - D(G(z)) \right ]$. - Discriminative model $D$: Estimates the probability $D(x)$ that a sample came from the training data rather than $G$. - Generative model $G$: Transforms probability distribution $p_z(z)$ to the generated data distribution $p_g$. Unique solution is $\displaystyle \frac{1}{2}$. This means discriminator can't discriminate sample came from $G...