.png){kind=icon}
.png){kind=icon}
Return
Score mismatching for generative modeling
.png){kind=icon}
OA
AI
DOI：10.1016/j.neunet.2024.106311.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a new score -based model with one-step sampling. Previously, score -based models were burdened with heavy computations due to iterative sampling. For substituting the iterative process, we train a standalone generator to compress all the time steps with the gradient backpropagated from the score network. In order to produce meaningful gradients for the generator, the score network is trained to simultaneously match the real data distribution and mismatch the fake data distribution. This model has the following advantages: (1) For sampling, it generates a fake image with only one step forward. (2) For training, it only needs 10 diffusion steps. (3) Compared with consistency model, it is free of the ill -posed problem caused by consistency loss. On the popular CIFAR-10 dataset, our model outperforms Consistency Model and Denoising Score Matching, which demonstrates the potential of the framework. We further provide more examples on the MINIST and LSUN datasets. The code is available on GitHub.
Keywords:
Generative model
Score-based models
Diffusion
Generative adversarial network
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.3
Papers:
7.8K
Citations:
3.0W