arXiv Machine Learning By Qiuyun Zhu

Finite-Sample Guarantees for Fully Discrete Conditional Diffusion Models

Read the original on arXiv Machine Learning →

The paper establishes finite‑sample guarantees for fully discrete conditional diffusion models trained from data and run with a finite number of denoising steps. By aligning the score‑training objective with the sampling grid, the authors jointly analyze statistical estimation and numerical discretization errors. For any smoothness index β>0, they prove that an appropriately chosen grid yields an averaged conditional Kullback–Leibler divergence of ˗O_p(n^{-2β/(d_x+d_y+2β)}) and a total‑variation error of ˗O_p(n^{-β/(d_x+d_y+2β)}), matching known rates up to logarithmic factors.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Statistics ML
Oct 5

KL Convergence Guarantees for Score diffusion models under minimal data assumptions

The paper presents new Kullback–Leibler convergence guarantees for score diffusion models that avoid restrictive Lipschitz assumptions on the score function. By analyzing models with fixed step size derived from the Ornstein–Uhlenbeck semigroup and its kinetic counterpart, the authors derive simple, sharp KL bounds that hold for any data distribution with finite Fisher information relative to the standard Gaussian. This extends theoretical guarantees to a broader class of data distributions without requiring early stopping or compact support.

By Giovanni Conforti, Alain Durmus, Marta Gentiloni Silveri
arXiv Statistics ML
Aug 25

Provably adaptive sampling with uniform and remasking discrete diffusion models

The paper proves that for discrete diffusion models using uniform or remasking forward processes, an adaptive sampler based on a leave‑one‑out denoiser can achieve sampling error proportional to the score‑estimation error plus a small tolerance. The required number of discretization steps scales with the dual total correlation of the target distribution, not directly with the ambient dimension. This result shows that sampling complexity is governed by the intrinsic dependence structure of the distribution, and the authors provide an information‑theoretic analysis linking discretization error to mutual information between coordinates.

By Daniil Dmitriev, Zhihan Huang, Yuting Wei
arXiv Machine Learning
Jul 7

Non-Asymptotic Error Bounds for SMC with Biased Proposals: Application to Conditional Diffusion Sampling

arXiv:2607. 04780v1 Announce Type: cross Abstract: Sequential Monte Carlo (SMC) methods are a natural tool for post-hoc conditioning of pretrained generative models, but in many applications the mutation kernels used by the particle system are biased approximations of an ideal Feynman--Kac flow.

By Stanislas Strasman (SU, LPSM), Gabriel Victorino Cardoso (LPSM), Sylvain Le Corff (LPSM), Vincent Lemaire (LPSM), Antonio Ocello