pith. sign in

arxiv: 1611.04488 · v6 · pith:ZX7KIJ5Fnew · submitted 2016-11-14 · 📊 stat.ML · cs.AI· cs.LG· cs.NE· stat.ME

Generative Models and Model Criticism via Optimized Maximum Mean Discrepancy

classification 📊 stat.ML cs.AIcs.LGcs.NEstat.ME
keywords samplesmodeldatagenerativeoptimizedattemptsdiscrepancydiscriminator
0
0 comments X
read the original abstract

We propose a method to optimize the representation and distinguishability of samples from two probability distributions, by maximizing the estimated power of a statistical test based on the maximum mean discrepancy (MMD). This optimized MMD is applied to the setting of unsupervised learning by generative adversarial networks (GAN), in which a model attempts to generate realistic samples, and a discriminator attempts to tell these apart from data samples. In this context, the MMD may be used in two roles: first, as a discriminator, either directly on the samples, or on features of the samples. Second, the MMD can be used to evaluate the performance of a generative model, by testing the model's samples against a reference data set. In the latter role, the optimized MMD is particularly helpful, as it gives an interpretable indication of how the model and data distributions differ, even in cases where individual model samples are not easily distinguished either by eye or by classifier.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Multivariate Time Series Data Imputation via Distributionally Robust Regularization

    stat.ML 2026-01 unverdicted novelty 6.0

    DRIO adds worst-case Wasserstein regularization to time series imputation, yielding a tractable adversarial surrogate and alternating algorithm that improves robustness under missingness.

  2. Demystifying MMD GANs

    stat.ML 2018-01 accept novelty 6.0

    MMD GANs have unbiased critic gradients but biased generator gradients from sample-based learning, and the Kernel Inception Distance provides a practical new measure for GAN convergence and dynamic learning rate adaptation.