Pith. sign in

An empirical study on evaluation metrics of generative adversarial networks

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

Evaluating generative adversarial networks (GANs) is inherently challenging. In this paper, we revisit several representative sample-based evaluation metrics for GANs, and address the problem of how to evaluate the evaluation metrics. We start with a few necessary conditions for metrics to produce meaningful scores, such as distinguishing real from generated samples, identifying mode dropping and mode collapsing, and detecting overfitting. With a series of carefully designed experiments, we comprehensively investigate existing sample-based metrics and identify their strengths and limitations in practical settings. Based on these results, we observe that kernel Maximum Mean Discrepancy (MMD) and the 1-Nearest-Neighbor (1-NN) two-sample test seem to satisfy most of the desirable properties, provided that the distances between samples are computed in a suitable feature space. Our experiments also unveil interesting properties about the behavior of several popular GAN models, such as whether they are memorizing training samples, and how far they are from learning the target distribution.

years

2026 1 2024 1

representative citing papers

Hard-Label Black-Box Attacks on 3D Point Clouds

cs.CV · 2024-11-30 · unverdicted · novelty 7.0

A spectrum-aware decision boundary algorithm enables effective hard-label black-box adversarial attacks on 3D point cloud models by fusing spectral information across classes and performing curvature-aware iterative optimization.

citing papers explorer

Showing 2 of 2 citing papers.

  • Hard-Label Black-Box Attacks on 3D Point Clouds cs.CV · 2024-11-30 · unverdicted · none · ref 95 · internal anchor

    A spectrum-aware decision boundary algorithm enables effective hard-label black-box adversarial attacks on 3D point cloud models by fusing spectral information across classes and performing curvature-aware iterative optimization.

  • Spectral Born machines: classically trainable quantum generative models for discrete data quant-ph · 2026-07-07 · conditional · none · ref 45 · internal anchor

    Spectral Born machines are Fourier-phase quantum generative models over Z_d^n that train classically via graph-spectral MMD and show reduced parameters plus apparent overfitting resistance on integer data.