Approximation and Generalization Abilities of Score-based Neural Network Generative Models for Sub-Gaussian Distributions
Guoji Fu, Wee Sun Lee

TL;DR
This paper analyzes the approximation and generalization capabilities of score-based neural network generative models for sub-Gaussian distributions, establishing nearly optimal convergence rates under mild assumptions.
Contribution
It provides a universal framework for convergence analysis of SGMs with neural networks, removing strict assumptions and achieving near minimax rates for broad classes of distributions.
Findings
Neural networks can approximate scores with mean square error $ ilde{O}(n^{-1})$.
SGMs can attain nearly minimax convergence rates under mild conditions.
The framework applies to distributions in Sobolev or Besov classes with early stopping.
Abstract
This paper studies the approximation and generalization abilities of score-based neural network generative models (SGMs) in estimating an unknown distribution from i.i.d. observations in dimensions. Assuming merely that is -sub-Gaussian, we prove that for any time step , where , there exists a deep ReLU neural network with width and depth that can approximate the scores with mean square error and achieve a nearly optimal rate of for score estimation, as measured by the score matching loss. Our framework is universal and can be used to establish convergence rates for SGMs under milder assumptions than previous work. For example, assuming further…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Generative Adversarial Networks and Image Synthesis · Gaussian Processes and Bayesian Inference
Methods*Communicated@Fast*How Do I Communicate to Expedia? · Early Stopping
