arXiv AI
Query Lower Bounds for Diffusion Sampling
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Machine Learning
Jul 2
Fast Score-Based Sampling via Log-Concave Reductions
arXiv:2512. 24152v2 Announce Type: replace-cross Abstract: Sampling based on score diffusions has led to striking empirical results, and has attracted considerable attention from various research communities.
arXiv Machine Learning
Jul 1
Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
arXiv:2602. 15008v2 Announce Type: replace Abstract: Diffusion models over discrete spaces have recently shown striking empirical success, yet their theoretical foundations remain incomplete.
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.
arXiv Machine Learning
Sep 14
Fast Convergence for High-Order ODE Solvers in Diffusion Probabilistic Models
arXiv:2506. 13061v4 Announce Type: replace Abstract: Diffusion probabilistic models generate samples by learning to reverse a noise-injection process that transforms data into noise.
arXiv Machine Learning
Jul 14
Low-dimensional adaptation of diffusion models: Convergence in total variation
arXiv:2501. 12982v3 Announce Type: replace-cross Abstract: This paper investigates how diffusion generative models leverage (unknown) low-dimensional structure to accelerate sampling.
arXiv Machine Learning
Jun 16
Sharp analysis of linear ensemble sampling
arXiv:2602. 08026v2 Announce Type: replace Abstract: We analyse linear ensemble sampling (ES) with standard Gaussian perturbations in stochastic linear bandits.