Score-based generative models are provably robust: an uncertainty quantification perspective
Nikiforos Mimikos-Stamatopoulos, Benjamin J. Zhang, Markos A., Katsoulakis

TL;DR
This paper demonstrates that score-based generative models are provably robust to various practical errors by analyzing how score estimation errors propagate through the model using Wasserstein uncertainty bounds.
Contribution
The paper introduces the Wasserstein uncertainty propagation theorem, providing a theoretical framework for understanding the robustness of SGMs to multiple error sources.
Findings
SGMs are robust under finite sample and early stopping errors.
The WUP theorem applies to various probability metrics.
Stochasticity in diffusion processes ensures robustness.
Abstract
Through an uncertainty quantification (UQ) perspective, we show that score-based generative models (SGMs) are provably robust to the multiple sources of error in practical implementation. Our primary tool is the Wasserstein uncertainty propagation (WUP) theorem, a model-form UQ bound that describes how the error from learning the score function propagates to a Wasserstein-1 () ball around the true data distribution under the evolution of the Fokker-Planck equation. We show how errors due to (a) finite sample approximation, (b) early stopping, (c) score-matching objective choice, (d) score function parametrization expressiveness, and (e) reference distribution choice, impact the quality of the generative model in terms of a bound of computable quantities. The WUP theorem relies on Bernstein estimates for Hamilton-Jacobi-Bellman partial differential…
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
TopicsExplainable Artificial Intelligence (XAI) · Decision-Making and Behavioral Economics · Mental Health Research Topics
MethodsDiffusion
