McGan: Mean and Covariance Feature Matching GAN

02/27/2017
by   Youssef Mroueh, et al.
0

We introduce new families of Integral Probability Metrics (IPM) for training Generative Adversarial Networks (GAN). Our IPMs are based on matching statistics of distributions embedded in a finite dimensional feature space. Mean and covariance feature matching IPMs allow for stable training of GANs, which we will call McGan. McGan minimizes a meaningful loss between distributions.

READ FULL TEXT

page 3

page 7

page 8

page 11

page 12

page 13

page 14

page 15

research
04/16/2019

IAN: Combining Generative Adversarial Networks for Imaginative Face Generation

Generative Adversarial Networks (GANs) have gained momentum for their ab...
research
02/02/2022

Robust Estimation for Nonparametric Families via Generative Adversarial Networks

We provide a general framework for designing Generative Adversarial Netw...
research
07/13/2021

Generative Adversarial Learning via Kernel Density Discrimination

We introduce Kernel Density Discrimination GAN (KDD GAN), a novel method...
research
11/11/2020

(f,Γ)-Divergences: Interpolating between f-Divergences and Integral Probability Metrics

We develop a general framework for constructing new information-theoreti...
research
05/26/2017

Fisher GAN

Generative Adversarial Networks (GANs) are powerful models for learning ...
research
06/15/2020

Reciprocal Adversarial Learning via Characteristic Functions

Generative adversarial nets (GANs) have become a preferred tool for acco...
research
01/26/2017

Wasserstein GAN

We introduce a new algorithm named WGAN, an alternative to traditional G...

Please sign up or login with your details

Forgot password? Click here to reset