MMD GAN: Towards Deeper Understanding of Moment Matching Network

by   Chun-Liang Li, et al.

Generative moment matching network (GMMN) is a deep generative model that differs from Generative Adversarial Network (GAN) by replacing the discriminator in GAN with a two-sample test based on kernel maximum mean discrepancy (MMD). Although some theoretical guarantees of MMD have been studied, the empirical performance of GMMN is still not as competitive as that of GAN on challenging and large benchmark datasets. The computational efficiency of GMMN is also less desirable in comparison with GAN, partially due to its requirement for a rather large batch size during the training. In this paper, we propose to improve both the model expressiveness of GMMN and its computational efficiency by introducing adversarial kernel learning techniques, as the replacement of a fixed Gaussian kernel in the original GMMN. The new approach combines the key ideas in both GMMN and GAN, hence we name it MMD GAN. The new distance measure in MMD GAN is a meaningful loss that enjoys the advantage of weak topology and can be optimized via gradient descent with relatively small batch sizes. In our evaluation on multiple benchmark datasets, including MNIST, CIFAR- 10, CelebA and LSUN, the performance of MMD-GAN significantly outperforms GMMN, and is competitive with other representative GAN works.


page 6

page 7

page 13


Online Kernel based Generative Adversarial Networks

One of the major breakthroughs in deep learning over the past five years...

A Characteristic Function Approach to Deep Implicit Generative Modeling

In this paper, we formulate the problem of learning an Implicit Generati...

A Mean-Field Theory for Kernel Alignment with Random Features in Generative Adversarial Networks

We propose a novel supervised learning method to optimize the kernel in ...

Restricting Greed in Training of Generative Adversarial Network

Generative adversarial network (GAN) has gotten wide re-search interest ...

Model-Informed Generative Adversarial Network (MI-GAN) for Learning Optimal Power Flow

The optimal power flow (OPF) problem, as a critical component of power s...

Generative Adversarial Learning via Kernel Density Discrimination

We introduce Kernel Density Discrimination GAN (KDD GAN), a novel method...

Learning Kernel for Conditional Moment-Matching Discrepancy-based Image Classification

Conditional Maximum Mean Discrepancy (CMMD) can capture the discrepancy ...

Please sign up or login with your details

Forgot password? Click here to reset