mlsanityData to 14 Oct 2026

Finite-Sample Guarantees for Fully Discrete Conditional Diffusion Models

arXiv 2610.13851 ↗First posted 9 Oct 2026stat.ML cs.LGcited by 0

On the map: Diffusion models → Diffusion foundations and sampling

Abstract (arXiv)

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 widetilde 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 widetilde 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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Diffusion foundations and sampling, one of 14 directions in Diffusion models. Builds on 16 of its 21 references that are in the map. First posted on arXiv 9 Oct 2026.

Builds on

16 of 21 references.

Closest ancestors · 14

Same direction, newest first

  1. 2026From Score Learning to Discretized Sampling: An End-to-End Generalization Analysis of Diffusion Models25 Jul
  2. 2026High-accuracy sampling for diffusion models and log-concave distributions1 Feb
  3. 2024O(d/T) Convergence Theory for Diffusion Probabilistic Models under Minimal Assumptions27 Sep
  4. 2024Unveil Conditional Diffusion Models with Classifier-free Guidance: A Sharp Statistical Theory18 Mar
  5. 2024Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions23 Feb
  6. 2024Neural Network-Based Score Estimation in Diffusion Models: Optimization and Generalization28 Jan
  7. 2023Improved Sample Complexity Bounds for Diffusion Model Training23 Nov
  8. 2023Nearly d-Linear Convergence Bounds for Diffusion Models via Stochastic Localization7 Aug
  9. 2023Diffusion Models are Minimax Optimal Distribution Estimators3 Mar
  10. 2022Improved Analysis of Score-based Generative Modeling: User-Friendly Bounds under Minimal Smoothness Assumptions3 Nov
  11. 2022Convergence of score-based generative modeling for general data distributions26 Sep
  12. 2022Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions22 Sep
2 more
  1. 2020Score-Based Generative Modeling through Stochastic Differential Equations26 Nov
  2. 2020Denoising Diffusion Probabilistic Models19 Jun

Other references · 2

  1. 2024Optimal score estimation via empirical Bayes smoothingcited by 61
  2. 2024Enhancing Accuracy in Generative Models via Knowledge Transfercited by 7

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2024Theory on Score-Mismatched Diffusion Models and Zero-Shot Conditional Samplers
  2. 2025Low-dimensional adaptation of diffusion models: Convergence in total variation
  3. 2023Restoration-Degradation Beyond Linear Diffusions: A Non-Asymptotic Analysis For DDIM-Type Samplers
  4. 2026Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
  5. 2023Consistent Diffusion Models: Mitigating Sampling Drift by Learning to be Consistent
  6. 2024Conditioning diffusion models by explicit forward-backward bridging
  7. 2025Minimax Optimality of the Probability Flow ODE for Diffusion Models
  8. 2024Non-asymptotic bounds for forward processes in denoising diffusions: Ornstein-Uhlenbeck is hard to beat