English

Discrete vs. Continuous Trade-offs for Generative Models

Machine Learning 2024-12-30 v1 Artificial Intelligence Information Theory Numerical Analysis math.IT Numerical Analysis

Abstract

This work explores the theoretical and practical foundations of denoising diffusion probabilistic models (DDPMs) and score-based generative models, which leverage stochastic processes and Brownian motion to model complex data distributions. These models employ forward and reverse diffusion processes defined through stochastic differential equations (SDEs) to iteratively add and remove noise, enabling high-quality data generation. By analyzing the performance bounds of these models, we demonstrate how score estimation errors propagate through the reverse process and bound the total variation distance using discrete Girsanov transformations, Pinsker's inequality, and the data processing inequality (DPI) for an information theoretic lens.

Keywords

Cite

@article{arxiv.2412.19114,
  title  = {Discrete vs. Continuous Trade-offs for Generative Models},
  author = {Jathin Korrapati and Tanish Baranwal and Rahul Shah},
  journal= {arXiv preprint arXiv:2412.19114},
  year   = {2024}
}

Comments

16 pages, 6 figures, includes theoretical analysis, experimental results, and proofs of key results

R2 v1 2026-06-28T20:49:03.684Z