Improving Probabilistic Diffusion Models With Optimal Diagonal Covariance Matching
Zijing Ou, Mingtian Zhang, Andi Zhang, Tim Z. Xiao, Yingzhen Li, David Barber
TL;DR
Diffusion models rely on the covariance of the denoising distribution, and fixed or heuristic covariances limit sampling efficiency and density estimation. The paper introduces Optimal Covariance Matching (OCM), an unbiased objective that learns the diagonal of the optimal state-dependent diagonal covariance from the score function, enabling efficient covariance estimation with minimal overhead. The approach applies to DDPM, DDIM, and latent diffusion, yielding improved FID and NLL with fewer denoising steps across CIFAR-10, CelebA, LSUN, and ImageNet experiments, and scales to large latent-space models like DiT. By linking covariance learning to the score-based framework and maintaining tractable computation, OCM offers a practical route to faster, more accurate diffusion-based density estimation and generation in vision tasks.
Abstract
The probabilistic diffusion model has become highly effective across various domains. Typically, sampling from a diffusion model involves using a denoising distribution characterized by a Gaussian with a learned mean and either fixed or learned covariances. In this paper, we leverage the recently proposed covariance moment matching technique and introduce a novel method for learning the diagonal covariance. Unlike traditional data-driven diagonal covariance approximation approaches, our method involves directly regressing the optimal diagonal analytic covariance using a new, unbiased objective named Optimal Covariance Matching (OCM). This approach can significantly reduce the approximation error in covariance prediction. We demonstrate how our method can substantially enhance the sampling efficiency, recall rate and likelihood of commonly used diffusion models.
