Generalization Bound for Diffusion Models using Random Features

Esha Saha, Giang Tran
10/6/2023
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

Diffusion probabilistic models have been successfully used to generate data from noise. However, most diffusion models are computationally expensive and difficult to interpret with a lack of theoretical justification. Random feature models on the other hand have gained popularity due to their interpretability but their application to complex machine learning tasks remains limited. In this work, we present a diffusion model-inspired deep random feature model that is interpretable and gives comparable numerical results to a fully connected neural network having the same number of trainable parameters. Specifically, we extend existing results for random features and derive generalization bounds between the distribution of sampled data and the true distribution using properties of score matching. We validate our findings by generating samples on the fashion MNIST dataset and instrumental audio data.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{saha2023generalization,
  title  = {Generalization Bound for Diffusion Models using Random Features},
  author = {Esha Saha and Giang Tran},
  year   = {2023},
  eprint = {2310.04417},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.04417v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.04417.svg)](https://codeofpaper.com/paper/2310.04417)

Discussion