Adversarial score matching and improved sampling for image generation

By Alexia Jolicoeur-Martineau, Remi Piche-Taillefer, Rémi Tachet des Combes, Ioannis Mitliagkas. 2020

138 citations recorded by the source corpus.

Denoising Score Matching with Annealed Langevin Sampling (DSM-ALS) has recently found success in generative modeling. The approach works by first training a neural network to estimate the score of a distribution, and then using Langevin dynamics to sample from the data distribution assumed by the score network. Despite the convincing visual quality of samples, this method appears to perform worse than Generative Adversarial Networks (GANs) under the Frechet Inception Distance, a standard metric for generative models. We show that this apparent gap vanishes when denoising the final Langevin samples using the score network. In addition, we propose two improvements to DSM-ALS: 1) Consistent Annealed Sampling as a more stable alternative to Annealed Langevin Sampling, and 2) a hybrid training formulation, composed of both Denoising Score Matching and adversarial objectives. By combining these two techniques and exploring different network architectures, we elevate score matching methods and obtain results competitive with state-of-the-art image generation on CIFAR-10.

Subfields: Computer Vision and Pattern Recognition, Generative Models

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Ming-Hsuan Yang
  3. Dacheng Tao
  4. Trevor Darrell
  5. Jitendra Malik
  6. Andrea Vedaldi
  7. Xiaogang Wang
  8. Chen Change Loy

In Generative Models

  1. Arash Vahdat
  2. Karsten Kreis
  3. Stefano Ermon
  4. Jonathan Ho
  5. Prafulla Dhariwal
  6. Jiaming Song
  7. David J. Fleet
  8. Andreas Blattmann

Citations in the corpus