Sign inGet started
Paper · arXiv

From Score Learning to Discretized Sampling: An End-to-End Generalization Analysis of Diffusion Models

Despite the empirical success of score-based diffusion models, a complete theoretical understanding of how finite-sample learning, network parameterization, and numerical discretization jointly dictate generative quality remains underdeveloped. Existing sampling analyses often evaluate the generative performance conditional on an oracle score or a pre-specified error threshold. In this work, we establish a unified convergence and generalization framework for score-based diffusion models parameterized by practical ResNet-type architectures. We analyze the generalization and convergence properties from the practical finite-sample, discrete-time learning problem of the score function to the ...

AuthorsJinshu Huang, Yiming Jiang, Chunlin Wu
Primary categorycs.LG
Published25 July 2026
Last updated at source25 July 2026
cs.LGmath.ST
Embed this entry
<iframe src="https://silytics.si/embed/item/d61ef775-e44c-41b7-8ca3-e566a42fdec1" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.