Using Ornstein-Uhlenbeck Process to understand Denoising Diffusion Probabilistic Model and its Noise Schedules
Javier E. Santos, Yen Ting Lin

TL;DR
This paper reveals that Denoising Diffusion Probabilistic Models can be understood as Ornstein-Uhlenbeck processes, providing a new theoretical foundation and connecting noise scheduling to classical stochastic process design.
Contribution
It establishes a formal equivalence between DDPM and the OU process, offering a new perspective and principled methods for designing noise schedules.
Findings
Fisher-information-based schedule matches the cosine schedule.
DDPM can be modeled as a time-homogeneous OU process.
New insights into noise schedule design for diffusion models.
Abstract
The aim of this short note is to show that Denoising Diffusion Probabilistic Model DDPM, a non-homogeneous discrete-time Markov process, can be represented by a time-homogeneous continuous-time Markov process observed at non-uniformly sampled discrete times. Surprisingly, this continuous-time Markov process is the well-known and well-studied Ornstein-Ohlenbeck (OU) process, which was developed in 1930's for studying Brownian particles in Harmonic potentials. We establish the formal equivalence between DDPM and the OU process using its analytical solution. We further demonstrate that the design problem of the noise scheduler for non-homogeneous DDPM is equivalent to designing observation times for the OU process. We present several heuristic designs for observation times based on principled quantities such as auto-variance and Fisher Information and connect them to ad hoc noise schedules…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSimulation Techniques and Applications
MethodsDiffusion · High-Order Consensuses
