A Review of GAN Architecture
The core mechanism of GAN is a min-max game between generator G and discriminator D; theoretically, alternating training converges to Nash equilibrium where generated distribution equals real data distribution.
入选理由:GAN 目标函数为 min-max 博弈:G 最小化被识破概率,D 最大化识破率。
