Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2310.12395 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918009894862848 |
|---|---|
| author | Scarvelis, Christopher Borde, Haitz Sáez de Ocáriz Solomon, Justin |
| author_facet | Scarvelis, Christopher Borde, Haitz Sáez de Ocáriz Solomon, Justin |
| contents | Score-based generative models (SGMs) sample from a target distribution by iteratively transforming noise using the score function of the perturbed target. For any finite training set, this score function can be evaluated in closed form, but the resulting SGM memorizes its training data and does not generate novel samples. In practice, one approximates the score by training a neural network via score-matching. The error in this approximation promotes generalization, but neural SGMs are costly to train and sample, and the effective regularization this error provides is not well-understood theoretically. In this work, we instead explicitly smooth the closed-form score to obtain an SGM that generates novel samples without training. We analyze our model and propose an efficient nearest-neighbor-based estimator of its score function. Using this estimator, our method achieves competitive sampling times while running on consumer-grade CPUs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_12395 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Closed-Form Diffusion Models Scarvelis, Christopher Borde, Haitz Sáez de Ocáriz Solomon, Justin Machine Learning Score-based generative models (SGMs) sample from a target distribution by iteratively transforming noise using the score function of the perturbed target. For any finite training set, this score function can be evaluated in closed form, but the resulting SGM memorizes its training data and does not generate novel samples. In practice, one approximates the score by training a neural network via score-matching. The error in this approximation promotes generalization, but neural SGMs are costly to train and sample, and the effective regularization this error provides is not well-understood theoretically. In this work, we instead explicitly smooth the closed-form score to obtain an SGM that generates novel samples without training. We analyze our model and propose an efficient nearest-neighbor-based estimator of its score function. Using this estimator, our method achieves competitive sampling times while running on consumer-grade CPUs. |
| title | Closed-Form Diffusion Models |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2310.12395 |