On tuning consistent annealed sampling for denoising score matching

04/08/2021
by   Joan Serrà, et al.
0

Score-based generative models provide state-of-the-art quality for image and audio synthesis. Sampling from these models is performed iteratively, typically employing a discretized series of noise levels and a predefined scheme. In this note, we first overview three common sampling schemes for models trained with denoising score matching. Next, we focus on one of them, consistent annealed sampling, and study its hyper-parameter boundaries. We then highlight a possible formulation of such hyper-parameter that explicitly considers those boundaries and facilitates tuning when using few or a variable number of steps. Finally, we highlight some connections of the formulation with other sampling schemes.

READ FULL TEXT

page 1

page 2

page 3

research
09/11/2020

Adversarial score matching and improved sampling for image generation

Denoising score matching with Annealed Langevin Sampling (DSM-ALS) is a ...
research
05/25/2023

Parallel Sampling of Diffusion Models

Diffusion models are powerful generative models but suffer from slow sam...
research
10/08/2022

STaSy: Score-based Tabular data Synthesis

Tabular data synthesis is a long-standing research topic in machine lear...
research
01/31/2020

Generative Modeling with Denoising Auto-Encoders and Langevin Sampling

We study convergence of a generative modeling method that first estimate...
research
12/17/2021

Heavy-tailed denoising score matching

Score-based model research in the last few years has produced state of t...
research
05/29/2021

Representation Learning in Continuous-Time Score-Based Generative Models

Score-based methods represented as stochastic differential equations on ...
research
06/22/2021

Choice of Damping Coefficient in Langevin Dynamics

This article considers the application of Langevin dynamics to sampling ...

Please sign up or login with your details

Forgot password? Click here to reset