Introduction
Denoising Diffusion Probabilistic Models (DDPMs) have revolutionized generative AI, yet their performance often hinges on the "noise schedule"—the sequence of noise levels added during training. While the "cosine schedule" has become a standard empirical choice, its theoretical justification has remained elusive. This research provides a rigorous foundation by mapping DDPMs to the continuous-time Ornstein–Uhlenbeck (OU) process.
Theoretical Framework: DDPM as an OU Process
The authors demonstrate that the discrete-time Markov chain of a DDPM is mathematically equivalent to a time-homogeneous OU process sampled at non-uniform intervals. By setting the relaxation rate $\gamma=1$ and fluctuation strength $\sigma=\sqrt{2}$, the DDPM equations emerge as a discretized version of the OU process. This perspective shifts the focus from designing step-wise noise ($\beta_k$) to determining the optimal observation times ($t_k$) of a continuous process.
Deriving Noise Schedules from First Principles
Using the OU framework, the researchers derived four noise schedules based on distinct physical and information-theoretic principles:
- EquiVariance (EqV): Maintains constant auto-variance, resulting in a linear schedule.
- Coefficient of Variation (CV): Leads to a quadratic schedule.
- EquiEntropy (EqE): Produces an exponential-style schedule.
- Fisher Information (FI): Optimizing for sampling density proportional to the square root of Fisher Information leads exactly to the popular cosine schedule.
Empirical Results
The theoretical derivations were validated on the CIFAR-10 dataset. Models were trained for 500,000 iterations using 1,000 and 4,000 diffusion steps. The results confirm that the Fisher Information (FI) schedule, which yields the cosine schedule, is not just an engineering trick but a theoretically optimal approach.
As shown in the performance metrics, the FI-based schedule consistently achieved the lowest Fréchet Inception Distance (FID), indicating superior image quality. Furthermore, this schedule demonstrated high robustness across different step counts, validating the stability of the OU-based derivation.
Conclusion and Future Work
This work demystifies the success of the cosine schedule by linking it to Fisher Information within an OU process framework. While the current model assumes independent pixel channels, it provides a "rational" starting point for future schedules that might incorporate data-dependent correlations or more complex stochastic processes.
Summary updated