← 研踪 PaperTrailarXiv:2605.20235 · v2
Provably Learning Diffusion Models under the Manifold Hypothesis: Collapse and Refine
首次提交 2026-05-17 00:51
版本更新 2026-11-06 15:42
雷达观测 2026-11-09 11:19
摘要
Diffusion models generate high-dimensional data with remarkable quality, yet how training discovers and exploits low-dimensional manifold structure remains incompletely understood. We analyze a two-stage collapse-and-refine procedure motivated by the small-noise score: its singular normal component identifies manifold projection as the leading denoising target, while the remaining correction encodes density and geometry. Under suitable assumptions, we prove that annealed mean-field training asymptotically recovers the population denoiser and quantify the resulting geometric alignment error. With the learned representation fixed, residual score learning reduces to convex random-feature regression. We establish generalization bounds that separate residual learning error, propagated projection error, and geometric approximation bias, with statistical exponents governed by the intrinsic dimension. Under additional structural assumptions, we further derive an end-to-end sampling guarantee. Motivated by this analysis, we develop Score-induced Latent Diffusion (SiLD), a practical two-stage framework combining low-noise denoising representation learning with latent diffusion, without requiring KL regularization of the latent representation. Experiments on Stacked MNIST and molecular generation benchmarks demonstrate competitive generation quality relative to architecture-matched VAE-based latent diffusion baselines.
作者备注：44 pages, 2 figures, 10 tables
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-06 15:42 · 最新观测版本
Provably Learning Diffusion Models under the Manifold Hypothesis: Collapse and Refine
Diffusion models generate high-dimensional data with remarkable quality, yet how training discovers and exploits low-dimensional manifold structure remains incompletely understood. We analyze a two-stage collapse-and-refine procedure motivated by the small-noise score: its singular normal component identifies manifold projection as the leading denoising target, while the remaining correction encodes density and geometry. Under suitable assumptions, we prove that annealed mean-field training asymptotically recovers the population denoiser and quantify the resulting geometric alignment error. With the learned representation fixed, residual score learning reduces to convex random-feature regression. We establish generalization bounds that separate residual learning error, propagated projection error, and geometric approximation bias, with statistical exponents governed by the intrinsic dimension. Under additional structural assumptions, we further derive an end-to-end sampling guarantee. Motivated by this analysis, we develop Score-induced Latent Diffusion (SiLD), a practical two-stage framework combining low-noise denoising representation learning with latent diffusion, without requiring KL regularization of the latent representation. Experiments on Stacked MNIST and molecular generation benchmarks demonstrate competitive generation quality relative to architecture-matched VAE-based latent diffusion baselines.
查看此版本解读 →查看此版本原文 ↗