about
Subspace Diffusion Generative Models (arxiv.org)
4 points by lnyan on May 4, 2022 | hide | past | pdf | discuss on HN

In plain words: Instead of adding noise across every pixel at once, this method shrinks the process into smaller slices of the image as it turns to noise. It made CIFAR-10 images cleaner (quality score 2.17) and cost less to run than the usual full-size approach.

Abstract

Score-based models generate samples by mapping noise to data (and vice versa) via a high-dimensional diffusion process. We question whether it is necessary to run this entire process at high dimensionality and incur all the inconveniences thereof. Instead, we restrict the diffusion via projections onto subspaces as the data distribution evolves toward noise. When applied to state-of-the-art models, our framework simultaneously improves sample quality -- reaching an FID of 2.17 on unconditional CIFAR-10 -- and reduces the computational cost of inference for the same number of denoising steps. Our framework is fully compatible with continuous-time diffusion and retains its flexible capabilities, including exact log-likelihoods and controllable generation. Code is available at https://github.com/bjing2016/subspace-diffusion.

Bowen Jing, Gabriele Corso, Renato Berlinghieri, Tommi Jaakkola
arXiv:2205.01490 · cs.LG, cs.CV · submitted May 3, 2022 · updated Feb 27, 2023
abstract · pdf · html · ECCV 2022

add comment on HN