Finite-Sample Guarantees for Fully Discrete Conditional Diffusion Models
Qiuyun Zhu
Abstract
We establish finite-sample guarantees for conditional diffusion models learned from data and implemented with finitely many denoising steps. Our approach aligns the score-training objective with the sampling grid, allowing statistical estimation and numerical discretization errors to be analyzed together. Under a smooth conditional density model, we derive high-probability bounds on the generated distribution's error and quantify the required number of score evaluations. For every smoothness index β>0, a suitable grid yields averaged conditional Kullback--Leibler (KL) divergence Op(n-2β/(dx+dy+2β)) relative to the original target with or without early stopping. Both the full and early-stopped samplers attain average target total-variation (TV) error Op(n-β/(dx+dy+2β)). Here n is the sample size, dx,dy are the data and conditioning dimensions, and errors are averaged over the conditioning variable. The total-variation bound matches the rate established in existing conditional distribution-estimation theory, up to logarithmic factors.
Create a lesson
Related papers
Hitting-Time Bounds for Asynchronous Q-Learning
Yang Peng
Constrained Probabilistic Numerics: Gaussian Process Solvers for Linear PDEs under Linear Inequality Constraints
Boyuan Deng, Kshitiz Upadhyay, Michael Shields
From Pixels to Privacy-Sensitive Features: An Information-Theoretic Framework for Reconstruction Bounds
Henry Bourne, Robert F. Allison
How Well Do Prior-Data Fitted Networks Amortize Bayesian Inference?
Manuel Hülskamp, Julius Kobialka, Emanuel Sommer et al.
Not All Dimensions Are Equal: Outlier-Aware Attention Linearization with Grouped Quadratic Kernels
Weiqi Sun, Qianyue Wu, Wenjia Wang et al.
Scalable Sparse Autoregressive Variational Inference for Non-Gaussian Spatial Fields
Paul F. V. Wiemann, Matthias Katzfuss