Score-based diffusion models, which generate new data by learning to reverse a diffusion process that perturbs data from the target distribution into noise, have achieved remarkable success across various generative tasks. Despite their superior empirical performance, existing theoretical guarantees are often constrained by stringent assumptions or suboptimal convergence rates. In this paper, we establish a fast convergence theory for a popular SDE-based sampler under minimal assumptions. Our analysis shows that, provided $\ell_{2}$-accurate estimates of the score functions, the total variation distance between the target and generated distributions is upper bounded by $O(d/T)$ (ignoring logarithmic factors), where $d$ is the data dimensionality and $T$ is the number of steps. This result holds for any target distribution with finite first-order moment. To our knowledge, this improves upon existing convergence theory for both the SDE-based sampler and another ODE-based sampler, while imposing minimal assumptions on the target data distribution and score estimates. This is achieved through a novel set of analytical tools that provides a fine-grained characterization of how the error propagates at each step of the reverse process.

本研究针对现有扩散模型收敛理论中严格假设和次优收敛速度的问题，提出了一种新的快速收敛理论。通过确保$\ell_{2}$-准确的评分函数估计，该理论表明目标分布与生成分布之间的总变差距离上界为$O(d/T)$，对任何具有有限一阶矩的目标分布均适用，显著改进了现有的SDE和ODE模型收敛理论。

在最小假设下扩散概率模型的$O(d/T)$收敛理论