Mathematical analysis of singularities in the diffusion model under the submanifold assumption
Yubin Lu, Zhongjian Wang, Guillaume Bal
TL;DR
The paper analyzes diffusion-based generative modeling under a submanifold assumption, proving that the conventional score target blows up as $t\to0$ for data on low-dimensional manifolds. It introduces a conditional-expectation-based target (CEM) with a bounded loss, reframing the backward drift as $S(X,t)=\frac{X}{1-e^{-t}}-\frac{e^{-t/2}}{1-e^{-t}}f(X_t,t)$ where $f(X_t,t)=E_{X_0|X_t}[X_0|X_t]$, and tunes the training with a time-weighting $\lambda(t)=(e^t-1)^{-1}$ and an exponential sampling schedule. Theoretical results show a pointwise singularity $S(X,t)=\frac{X-y_X}{t}(1+o(1))$ for $t\to0$, while CEM yields a bounded target and improved stability; experiments on 2D manifolds and MNIST corroborate reduced pollution and better performance, with ablations highlighting the importance of schedule and weighting. The approach offers a principled way to handle manifold-structured data in diffusion-based generative modeling, potentially improving robustness and sample quality in high-dimensional settings.
Abstract
This paper concerns the mathematical analyses of the diffusion model in machine learning. The drift term of the backward sampling process is represented as a conditional expectation involving the data distribution and the forward diffusion. The training process aims to find such a drift function by minimizing the mean-squared residue related to the conditional expectation. Using small-time approximations of the Green's function of the forward diffusion, we show that the analytical mean drift function in DDPM and the score function in SGM asymptotically blow up in the final stages of the sampling process for singular data distributions such as those concentrated on lower-dimensional manifolds, and are therefore difficult to approximate by a network. To overcome this difficulty, we derive a new target function and associated loss, which remains bounded even for singular data distributions. We validate the theoretical findings with several numerical examples.
