Improved Techniques for Training Score-Based Generative Models

Yang Song, Stefano Ermon
6/16/2020
cs.LGcs.CVstat.ML

Official code: ermongroup/ncsnv2 (330 stars, MIT, last commit 2021-06-12).

Abstract

Score-based generative models can produce high quality image samples comparable to GANs, without requiring adversarial optimization. However, existing training procedures are limited to images of low resolution (typically below 32x32), and can be unstable under some settings. We provide a new theoretical analysis of learning and sampling from score models in high dimensional spaces, explaining existing failure modes and motivating new solutions that generalize across datasets. To enhance stability, we also propose to maintain an exponential moving average of model weights. With these improvements, we can effortlessly scale score-based generative models to images with unprecedented resolutions ranging from 64x64 to 256x256. Our score-based models can generate high-fidelity samples that rival best-in-class GANs on various image datasets, including CelebA, FFHQ, and multiple LSUN categories.

View on arXivView PDF

Code Implementations(1)

ermongroup/ncsnv2Official100%
MIT

The official PyTorch implementation for NCSNv2 (NeurIPS 2020)

33059PythonJun 17, 20205 years agoMIT
diffusion-modelsgenerative-modelsneurips-2020score-based-generative-modelingscore-matching

Cite this paper

@article{song2020improved,
  title  = {Improved Techniques for Training Score-Based Generative Models},
  author = {Yang Song and Stefano Ermon},
  year   = {2020},
  eprint = {2006.09011},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2006.09011}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2006.09011.svg)](https://codeofpaper.com/paper/2006.09011)

Discussion