去噪扩散隐式模型

Denoising Diffusion Implicit Models

斯特凡诺·埃尔蒙 Stefano Ermon · Stanford · 2020-10-06 · arXiv:2010.02502 ↗ · 被引 12613

打开互动全文版(逐段中英对照 + 图/公式 + 论文问答)→

摘要 · Abstract

去噪扩散概率模型(DDPMs)无需对抗训练即可生成高质量图像,但需要模拟许多步的马尔可夫链才能产生样本。为了加速采样,我们提出了去噪扩散隐式模型(DDIMs),这是一类更高效的迭代隐式概率模型,其训练过程与 DDPMs 相同。在 DDPMs 中,生成过程被定义为马尔可夫扩散过程的逆过程。我们构建了一类非马尔可夫扩散过程,它们具有相同的训练目标,但其逆过程的采样速度可以快得多。实验表明,DDIMs 在生成高质量样本方面,相比 DDPMs 在墙钟时间上可以快 10 到 50 倍,允许我们在计算和样本质量之间进行权衡,并且可以直接在潜在空间中进行有语义意义的图像插值。

Denoising diffusion probabilistic models (DDPMs) have achieved high quality image generation without adversarial training, yet they require simulating a Markov chain for many steps to produce a sample. To accelerate sampling, we present denoising diffusion implicit models (DDIMs), a more efficient class of iterative implicit probabilistic models with the same training procedure as DDPMs. In DDPMs, the generative process is defined as the reverse of a Markovian diffusion process. We construct a class of non-Markovian diffusion processes that lead to the same training objective, but whose reverse process can be much faster to sample from. We empirically demonstrate that DDIMs can produce high quality samples $10 \times$ to $50 \times$ faster in terms of wall-clock time compared to DDPMs, allow us to trade off computation for sample quality, and can perform semantically meaningful image interpolation directly in the latent space.

核心贡献 · Key contributions

局限 · Limitations

论文章节 · Sections(共 18)

阅读逐段中英对照全文 →