Pith. sign in

REVIEW 3 major objections 5 minor 253 references

Provable diffusion-based posterior sampling for linear inverse problems via DDIM

T0 review · 3 major / 5 minor · reviewed 2026-08-01 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A coordinate-wise SNR-guided modification of the DDIM sampler provably converges to the true Bayesian posterior for noisy linear inverse problems, with no likelihood gradients or particle filters.

desk verdict A promising DDIM-based posterior sampler with a real, likely repairable, gap in the central proof; worth a serious referee but not publication as-is. read the letter →

arxiv 2607.19333 v1 pith:O245SBWX submitted 2026-07-21 cs.LG cs.AIstat.ML

Yuchen Jiao , Na Li , Changxiao Cai , Yuxin Chen , Gen Li This is my paper
classification cs.LGcs.AIstat.ML MSC 62F1568T07
keywords diffusionmodelsDDIMlinearinverseproblemsposteriorsamplingconsistencysingularvaluedecompositionsignal-to-noiseratioimagerestoration
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper claims that posterior sampling for noisy linear inverse problems reduces to a simple, coordinate-wise SNR-guided modification of the standard DDIM sampler. Along each singular direction of the measurement operator, the algorithm follows the learned diffusion prior while the measurement SNR is low, and switches to a calibrated measurement-based predictor once the measurement SNR dominates the diffusion SNR. Under an exact diffusion predictor and bounded signal support, the paper proves that the output distribution of this Posterior-DDIM sampler converges in total variation to the true posterior p_{X0|Y} as the discretization grid refines and the terminal diffusion time approaches zero. A second theorem extends the guarantee to arbitrary nonzero singular values with a correction term. If correct, this converts Bayesian posterior sampling into a lightweight DDIM-style procedure.

What carries the argument

The central mechanism is the SNR-guided partition of singular directions S_meas^t = {s : α_t σ < Σ_ss σ_t} versus S_prior^t, equivalently encoded by the threshold time τ_s at which diffusion SNR matches observation SNR. The load-bearing identity is that the auxiliary forward process ξ_{t,s} = α_t Σ_{ss}^{-1} u_s^T Y + sqrt(σ_t^2 − α_t^2 σ^2 Σ_{ss}^{-2}) Z_s has the same marginal distribution as v_s^T X_t, which licenses replacing the DDIM update by the measurement-injected update in measurement-dominated coordinates. Prior-dominated and unobserved coordinates evolve by standard DDIM dynamics, with a correction term in the general-singular-value case to account for conditioning on the measure

What would settle it

Simulate Posterior-DDIM with an exactly known prior (e.g., a Gaussian mixture) and a measurement matrix whose singular value Σ_ss satisfies α_{τ_s}<1 at the matching time, then compare the empirical marginal of v_s^T X̂_{t_M} to the true posterior marginal along v_s. If the total-variation distance fails to vanish as the grid refines, the threshold identification is the culprit.

Watch

Extended reading notes

Core claim

Posterior-DDIM works in the singular-value basis of the measurement matrix A. For each direction s, the algorithm computes the threshold time τ_s at which the diffusion SNR α_t/σ_t equals the observation SNR Σ_ss/σ. In the measurement-dominated regime (t ≥ τ_s), the sampler replaces the DDIM update with a measurement-injected auxiliary process that has the same marginal law as the forward diffusion projected onto v_s. In the prior-dominated regime (t < τ_s), it keeps the standard DDIM update for observed directions, and uses a larger stochasticity parameter for unobserved directions. Theorems 1 and 2 assert that, with exact data predictors, bounded support, and suitable scaling of the stocha

Load-bearing premise

In the proof of Theorem 1 (Appendix A), the load-bearing premise is that the auxiliary measurement-injected coordinate at the switching time τ_s equals the raw observation Σ_{ss}^{-1}u_s^T Y; the construction yields α_{τ_s}Σ_{ss}^{-1}u_s^T Y, so identifying the auxiliary process with conditioning on Y holds only when α_{τ_s}=1.

Editorial extensions

If this is right

  • Posterior sampling for noisy linear inverse problems reduces to coordinate-wise DDIM updates, avoiding likelihood-gradient computations and particle filtering.
  • Along low-SNR and unobserved directions, following the learned prior is provably the correct update; measurements are only imposed where observation SNR exceeds diffusion SNR.
  • The guarantees cover arbitrary, possibly rank-deficient measurement operators (Theorem 2), so tasks such as inpainting, super-resolution, deblurring, and compressed sensing fall under one proof.
  • The asymptotic TV convergence requires the terminal time to tend to 0 and the log-SNR grid to refine; with 100 DDIM steps the empirical metrics saturate, consistent with the theorem's regime.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A testable diagnostic is whether the proof's identification at the switching time requires α_{τ_s}=1: the update (23) gives v_s^T X̂_{τ_s} = α_{τ_s} Σ_{ss}^{-1} u_s^T Y with zero residual noise, which equals the raw observation Σ_{ss}^{-1}u_s^T Y only if α_{τ_s}=1.
  • The per-direction switching rule suggests a sharp phase transition: coordinates with Σ_ss/σ above a time-dependent threshold are effectively pinned by the measurement, which could yield per-direction posterior contraction rates under exact predictors.
  • A natural extension is to replace the exact data predictor with a learned score in a controlled Gaussian-mixture setting and measure the TV gap empirically, isolating the error contributed by the switching boundary.
  • The double-limit statement supplies no convergence rate; a non-asymptotic bound would require quantitative control of the KL terms in Lemmas 1–6, which the argument leaves as an open constant.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proposes Posterior-DDIM, a DDIM-type sampler for linear inverse problems with diffusion priors. The method partitions singular directions of the measurement operator according to whether the observation SNR exceeds the diffusion SNR, applies a calibrated measurement-based update in measurement-dominated directions, and a standard DDIM update in prior-dominated or unobserved directions. The main theoretical claims (Theorems 1 and 2) assert asymptotic posterior correctness in total variation under exact diffusion predictors, bounded support, and suitable choices of the stochasticity parameters. The paper also reports image-restoration experiments (inpainting, super-resolution, deblurring, compressed sensing) comparing favorably with several existing diffusion-based solvers.

Significance. If the theorems are correct, the contribution is significant: it provides a simple, coordinate-wise modification of DDIM with a proof of posterior consistency for noisy linear inverse problems, at lower computational overhead than many alternatives. The algorithm is easy to implement, and the experimental results are broadly competitive. The paper also ships a detailed proof structure with auxiliary processes and DDIM convergence machinery. However, the central proof currently contains a load-bearing identification error that invalidates the stated theorems as written. The result is plausible and likely repairable, but the manuscript cannot be accepted until the proof is corrected.

major comments (3)
  1. [Appendix A, final paragraph; Eqs. (23), (27), (33)] At the threshold time τ_s, Eq. (23) gives v_s^T \hat X_{τ_s} = α_{τ_s} Σ_{ss}^{-1} u_s^T Y, because the residual variance vanishes when α_{τ_s}/σ_{τ_s}=Σ_{ss}/σ. The text instead asserts v_s^T \hat X_{τ_s}=Σ_{ss}^{-1}u_s^T Y, and that (X_{t_M}, v_s^T X_{τ_s}) has the same joint law as (X_{t_M}, Σ_{ss}^{-1}u_s^T Y). This is false unless α_{τ_s}=1. Since the proof conditions on this quantity to identify the posterior, Theorems 1 and 2 are not established as written. The gap is probably repairable: v_s^T X_{τ_s}/α_{τ_s} equals Σ_{ss}^{-1}u_s^T Y in distribution, and in the scalar Gaussian model the conditioning event is equivalent up to an invertible transformation. This normalization and the resulting conditional equivalence must be stated and proved explicitly.
  2. [Section 2, Eq. (9); Eq. (11); Appendix B, Eqs. (28)-(29)] The discretization parameter is defined as δ_{i+1}=λ_{t_i}-λ_{t_{i+1}}. But the SNR α_t/σ_t is assumed decreasing in t, and the sampler runs from t_0 (large, α→0, σ→1) to t_M→0, so for t_i>t_{i+1} we have λ_{t_i}<λ_{t_{i+1}} and hence δ_{i+1}<0. Many subsequent bounds in Appendix B explicitly require δ>0 (e.g., 1-e^{-2δ_{i+1}}≍δ_{i+1} in Eq. (29), and the estimates in Lemma 6). This is either a sign error in Eq. (9) or a fundamental inconsistency in the time indexing. The definition must be corrected to δ_{i+1}=λ_{t_{i+1}}-λ_{t_i} (or the time order reversed) and the proof checked with the corrected convention.
  3. [Appendix C, proof of Theorem 2] The proof of Theorem 2 is substantially terser than that of Theorem 1. In particular, Eq. (106) is asserted 'by a similar argument with Lemma 1' without providing the general-A analogue of the error-term analysis in Lemma 6, and the conditioning argument for the auxiliary sequence in Eq. (105) is only sketched. Since Theorem 2 is a central advertised contribution, the general-case proof needs to be either written out in full or reduced explicitly to Theorem 1 with verifiable assumptions. As it stands, the reader cannot verify that the correction term in Eq. (25) preserves the claimed convergence.
minor comments (5)
  1. [Appendix B.1, Lemma 5] The definition of \hat bσ_{t_i}^2 contains a typographical inconsistency: Eq. (50) writes σ_{t_i}^2-α_{t_i}^2σ^2Σ_{ss}^{-1}, while Eq. (23) and the surrounding text use σ^2Σ_{ss}^{-2}. Please correct the notation.
  2. [Section 4.1] The empirical evaluation finds the best performance at η0=0, whereas the theory requires η0=1 in Theorem 1 and η0=δ^{-p}→∞ in Theorem 2. The experimental configuration is therefore outside the proven regime. This mismatch should be acknowledged and discussed.
  3. [Section 3.1, Eqs. (19)-(20)] The partition S_meas^t and S_prior^t uses strict inequalities, but the threshold time τ_s is defined by equality. At the exact boundary, Algorithm 1 and the proof need a consistent convention; the current presentation leaves this ambiguous.
  4. [Theorem 1, Eq. (26)] The double limit lim_{t_M→0} lim_{δ→0} and the definition of δ, which includes α_{t_0} and |1-σ_{t_0}|, should be accompanied by a concrete example of a valid schedule, so the order of limits and the meaning of δ→0 are unambiguous.
  5. [Tables 1 and 2] The table formatting around the rows beginning '0 32' and '2 16' is corrupted; the hyperparameter values are not clearly aligned with columns.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Appendix A issue is a proof gap, not a reduction by construction.

full rationale

The paper's central claim is an asymptotic TV-convergence theorem for a concrete coordinate-wise DDIM algorithm. The proof in Appendices A and C proceeds by constructing auxiliary sequences, bounding KL/TV errors, and invoking analytical lemmas; no parameter is fitted to data and then renamed as a prediction, and no 'uniqueness theorem' from the authors' prior work is used to force the conclusion. The self-citations in Section 1.3 (Li et al. 2024, Jiao et al. 2025, Cai et al. 2026, etc.) are background references on unconditional DDPM/DDIM convergence and are not load-bearing in the proof of Theorems 1 and 2. The one suspicious passage is Appendix A's final paragraph, which states v_s^T \hat X_{τ_s} = Σ_{ss}^{-1} u_s^T Y and asserts a joint-law equivalence; by the paper's own Eq. (23) the value is α_{τ_s} Σ_{ss}^{-1} u_s^T Y, so the displayed equality is false as written. This is a genuine mathematical error in the proof, apparently repairable because the threshold condition gives σ_{τ_s}/α_{τ_s} = σ/Σ_{ss}, making the scaled event equivalent to the observation equation. But it is a correctness gap, not a circular derivation: the posterior conclusion is not assumed as an input, the algorithm's measurement branch is not just a relabeling of the target, and the proof does not reduce to a self-citation or to a fitted quantity. I therefore find no circular step that can be exhibited under the stated criteria.

Assumptions & free parameters 1 free parameters · 5 assumptions · 0 invented entities

The main fragility is the auxiliary-process identification, which carries the posterior correctness claim. The free parameters η0 and η1 are tuned empirically and the optimal choices are outside the theoretical regime. No new physical or mathematical entities are introduced.

free parameters (1)
  • η0, η1 = η0=0, η1=16 in experiments; theory uses η0=1 or η0=η1=δ^{-p}
    DDIM stochasticity parameters are tuned empirically in Section 4.1. The theoretical choices required by Theorems 1-2 are not used in the experiments, so the empirical performance is not covered by the proven guarantee.
assumptions (5)
  • domain assumption Exact diffusion score / data predictor access
    The theorems assume access to the true conditional expectations µ_t and ϵ_t, not learned approximations. Section 2 and Theorem 1 state this implicitly through the use of exact score functions.
  • domain assumption Bounded support of X0
    Theorem 1 states 'Assume that the support of X0 is bounded'; used throughout Appendix B to bound moments and score derivatives.
  • domain assumption Monotone continuous SNR schedule with α0/σ0=∞ and α∞/σ∞=0
    Section 2 assumes a strictly decreasing continuous α_t/σ_t, which guarantees well-defined threshold times τ_s.
  • domain assumption Known Gaussian measurement noise with variance σ²I
    The model (2) assumes ε∼N(0,σ²I) with known σ; Algorithm 1 uses σ explicitly.
  • ad hoc to paper Posterior identification equality v_s^T \hat X_{τ_s}=Σ^{-1}u_s^TY and the joint-law identity with X_{t_M}
    In Appendix A, the proof identifies the auxiliary process at the threshold time with the raw observation. This equality is not implied by Eq. (23) unless α_{τ_s}=1, and it is load-bearing for the claimed posterior convergence.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Provable diffusion-based posterior sampling for linear inverse problems via DDIM." pith.science (2026). https://pith.science/paper/O245SBWX

@misc{pith2026260719333,
  author       = {Pith},
  title        = {Pith review of: Provable diffusion-based posterior sampling for linear inverse problems via DDIM},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/O245SBWX}},
  note         = {Machine review of arXiv:2607.19333}
}
read the original abstract

Diffusion-based methods have achieved remarkable empirical success in solving inverse problems. However, many existing posterior samplers either lack rigorous theoretical guarantees or incur substantial computational overhead. We propose a simple and efficient algorithm, called \pddim, for solving linear inverse problems with diffusion priors via a DDIM-type sampler. Our method requires only lightweight, coordinate-wise modifications to the standard DDIM update, while explicitly incorporating the measurement model. The key idea is to perform posterior sampling separately along each singular direction of the measurement operator: for each direction, the sampler follows the learned diffusion prior when the observation signal-to-noise ratio (SNR) is below the corresponding diffusion SNR, and switches to a calibrated measurement-based predictor otherwise. We prove that the proposed sampler converges to the Bayesian posterior conditioned on the measurements. Empirical results show that the proposed sampler performs favorably against existing diffusion-based posterior samplers across a range of image restoration tasks, achieving the best performance on the majority of evaluation metrics considered. Overall, our results convert posterior sampling for noisy linear inverse problems to simple coordinate-wise DDIM updates, yielding an efficient, easy-to-implement algorithm with provable posterior consistency.

Figures

Figures reproduced from arXiv: 2607.19333 by the authors.

Figure 1
Figure 1. FID versus PSNR, SSIM, and LPIPS for different inpainting algorithms on the CelebA dataset. [PITH_FULL_IMAGE:figures/full_fig_p013_1.png] view at source ↗
Figure 2
Figure 2. Effect of the NFE on the ImageNet super-resolution task. [PITH_FULL_IMAGE:figures/full_fig_p013_2.png] view at source ↗

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

253 extracted references · 39 linked inside Pith

  1. [1]

    arXiv preprint arXiv:2303.05754 , year=

    Fast Diffusion Sampler for Inverse Problems by Geometric Decomposition , author=. arXiv preprint arXiv:2303.05754 , year=

    arXiv

  2. [2]

    arXiv preprint arXiv:2410.13738 , year=

    Instance-dependent Convergence Theory for Diffusion Models , author=. arXiv preprint arXiv:2410.13738 , year=

    arXiv

  3. [3]

    arXiv preprint arXiv:2503.10103 , year=

    Improving Diffusion-based Inverse Algorithms under Few-Step Constraint via Learnable Linear Extrapolation , author=. arXiv preprint arXiv:2503.10103 , year=

    arXiv

  4. [4]

    arXiv preprint arXiv:2510.27562 , year=

    Optimal Convergence Analysis of DDPM for General Distributions , author=. arXiv preprint arXiv:2510.27562 , year=

    arXiv

  5. [5]

    arXiv preprint arXiv:2606.23627 , year=

    Diffusion Models Adapt to Low-Dimensional Structure Under Flexible Coefficient Choices , author=. arXiv preprint arXiv:2606.23627 , year=

    arXiv

  6. [6]

    arXiv preprint arXiv:2206.09012 , year=

    Diffusion models as plug-and-play priors , author=. arXiv preprint arXiv:2206.09012 , year=

    arXiv

  7. [7]

    arXiv preprint arXiv:2512.08022 , year=

    Provable diffusion posterior sampling for Bayesian inversion , author=. arXiv preprint arXiv:2512.08022 , year=

    arXiv

  8. [8]

    Conference on Computer Vision and Pattern Recognition (CVPR) , pages=

    Come-Closer-Diffuse-Faster: Accelerating Conditional Diffusion Models for Inverse Problems through Stochastic Contraction , author=. Conference on Computer Vision and Pattern Recognition (CVPR) , pages=

Show all 253 references
  1. [9]

    Advances in Neural Information Processing Systems , volume=

    Solving linear inverse problems provably via posterior sampling with latent diffusion models , author=. Advances in Neural Information Processing Systems , volume=

  2. [10]

    International conference on learning representations , year=

    Pseudoinverse-guided diffusion models for inverse problems , author=. International conference on learning representations , year=

  3. [11]

    International Conference on Learning Representations , year=

    Diffusion Posterior Sampling for General Noisy Inverse Problems , author=. International Conference on Learning Representations , year=

  4. [12]

    Advances in Neural Information Processing Systems , volume=

    Denoising Diffusion Restoration Models , author=. Advances in Neural Information Processing Systems , volume=

  5. [13]

    arXiv preprint arXiv:2410.00083 , year=

    A survey on diffusion models for inverse problems , author=. arXiv preprint arXiv:2410.00083 , year=

    arXiv

  6. [14]

    Park, Trevor and Casella, George , journal=. The. 2008 , publisher=

    2008

  7. [15]

    IEEE Transactions on signal processing , volume=

    Bayesian compressive sensing , author=. IEEE Transactions on signal processing , volume=. 2008 , publisher=

    2008

  8. [16]

    Communications of the ACM , volume=

    Exact matrix completion via convex optimization , author=. Communications of the ACM , volume=. 2012 , publisher=

    2012

  9. [17]

    Journal of the American Statistical Association , volume=

    The spike-and-slab lasso , author=. Journal of the American Statistical Association , volume=. 2018 , publisher=

    2018

  10. [18]

    Journal of the American statistical Association , volume=

    Variable selection via nonconcave penalized likelihood and its oracle properties , author=. Journal of the American statistical Association , volume=. 2001 , publisher=

    2001

  11. [19]

    Proceedings of the National Academy of Sciences , volume=

    Message-passing algorithms for compressed sensing , author=. Proceedings of the National Academy of Sciences , volume=. 2009 , publisher=

    2009

  12. [20]

    IEEE Transactions on image processing , volume=

    Bayesian compressive sensing using Laplace priors , author=. IEEE Transactions on image processing , volume=. 2009 , publisher=

    2009

  13. [21]

    International Conference on Learning Representations , year=

    Solving inverse problems in medical imaging with score-based generative models , author=. International Conference on Learning Representations , year=

  14. [22]

    arXiv preprint arXiv:2510.21890 , year=

    The principles of diffusion models , author=. arXiv preprint arXiv:2510.21890 , year=

    arXiv

  15. [23]

    IEEE Transactions on Signal Processing , volume=

    Nonconvex optimization meets low-rank matrix factorization: An overview , author=. IEEE Transactions on Signal Processing , volume=. 2019 , publisher=

    2019

  16. [24]

    Proceedings of the International Congress of Mathematicians, Seoul, South Korea , volume=

    Mathematics of sparsity (and a few other things) , author=. Proceedings of the International Congress of Mathematicians, Seoul, South Korea , volume=. 2014 , organization=

    2014

  17. [25]

    arXiv preprint arXiv:2506.03979 , year=

    Solving inverse problems via diffusion-based priors: An approximation-free ensemble sampling approach , author=. arXiv preprint arXiv:2506.03979 , year=

    arXiv

  18. [26]

    IEEE Transactions on Computational Imaging , volume=

    Provable probabilistic imaging using score-based generative priors , author=. IEEE Transactions on Computational Imaging , volume=. 2024 , publisher=

    2024

  19. [27]

    arXiv preprint arXiv:2405.15643 , year=

    An unconditional representation of the conditional score in infinite-dimensional linear inverse problems , author=. arXiv preprint arXiv:2405.15643 , year=

    arXiv

  20. [28]

    Proceedings of the IEEE conference on computer vision and pattern recognition , pages=

    The unreasonable effectiveness of deep features as a perceptual metric , author=. Proceedings of the IEEE conference on computer vision and pattern recognition , pages=

  21. [29]

    IEEE transactions on image processing , volume=

    Image quality assessment: from error visibility to structural similarity , author=. IEEE transactions on image processing , volume=. 2004 , publisher=

    2004

  22. [30]

    arXiv preprint arXiv:2406.06959 , year=

    Unleashing the denoising capability of diffusion prior for solving inverse problems , author=. arXiv preprint arXiv:2406.06959 , year=

    arXiv

  23. [31]

    Proceedings of the IEEE international conference on computer vision , pages=

    Deep learning face attributes in the wild , author=. Proceedings of the IEEE international conference on computer vision , pages=

  24. [32]

    Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

    A style-based generator architecture for generative adversarial networks , author=. Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

  25. [33]

    International journal of computer vision , volume=

    Imagenet large scale visual recognition challenge , author=. International journal of computer vision , volume=. 2015 , publisher=

    2015

  26. [34]

    Advances in Neural Information Processing Systems , volume=

    Snips: Solving noisy inverse problems stochastically , author=. Advances in Neural Information Processing Systems , volume=

  27. [35]

    Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

    Repaint: Inpainting using denoising diffusion probabilistic models , author=. Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

  28. [36]

    2019 , publisher=

    High-dimensional statistics: A non-asymptotic viewpoint , author=. 2019 , publisher=

    2019

  29. [37]

    arXiv preprint arXiv:2403.07902 , year=

    DecompDiff: diffusion models with decomposed priors for structure-based drug design , author=. arXiv preprint arXiv:2403.07902 , year=

    arXiv

  30. [38]

    arXiv preprint arXiv:1506.03365 , Year =

    Yu, Fisher and Zhang, Yinda and Song, Shuran and Seff, Ari and Xiao, Jianxiong , Title =. arXiv preprint arXiv:1506.03365 , Year =

    arXiv

  31. [39]

    arXiv preprint arXiv:2506.24042 , year=

    Faster Diffusion Models via Higher-Order Approximation , author=. arXiv preprint arXiv:2506.24042 , year=

    arXiv

  32. [40]

    arXiv preprint arXiv:2405.16876 , year=

    Transfer learning for diffusion models , author=. arXiv preprint arXiv:2405.16876 , year=

    arXiv

  33. [41]

    Journal of Chemical Information and Modeling , volume=

    Diffusion models in de novo drug design , author=. Journal of Chemical Information and Modeling , volume=. 2024 , publisher=

    2024

  34. [42]

    Journal of Materials Chemistry A , volume=

    Inverse design of porous materials: a diffusion model approach , author=. Journal of Materials Chemistry A , volume=. 2024 , publisher=

    2024

  35. [43]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

    Matfuse: controllable material generation with diffusion models , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

  36. [44]

    arXiv preprint arXiv:2503.09583 , year=

    Minimax optimality of the probability flow ode for diffusion models , author=. arXiv preprint arXiv:2503.09583 , year=

    arXiv

  37. [45]

    arXiv preprint arXiv:1707.08819 , year=

    A downsampled variant of imagenet as an alternative to the cifar datasets , author=. arXiv preprint arXiv:1707.08819 , year=

    arXiv

  38. [46]

    Nature , volume=

    De novo design of protein structure and function with RFdiffusion , author =. Nature , volume=. 2023 , publisher=

    2023

  39. [47]

    arXiv preprint arXiv:2206.04119 , year=

    Diffusion probabilistic modeling of protein backbones in 3d for the motif-scaffolding problem , author=. arXiv preprint arXiv:2206.04119 , year=

    arXiv

  40. [48]

    arXiv preprint arXiv:2402.04997 , year=

    Generative flows on discrete state-spaces: Enabling multimodal flows with applications to protein co-design , author=. arXiv preprint arXiv:2402.04997 , year=

    arXiv

  41. [49]

    arXiv preprint arXiv:2009.09761 , year=

    Diffwave: A versatile diffusion model for audio synthesis , author=. arXiv preprint arXiv:2009.09761 , year=

    2009 arXiv

  42. [50]

    Probability Theory and Related Fields , volume=

    Measure estimation on manifolds: an optimal transport approach , author=. Probability Theory and Related Fields , volume=. 2022 , publisher=

    2022

  43. [51]

    Learning multiple layers of features from tiny images , year =

    Krizhevsky, Alex and Hinton, Geoffrey , address =. Learning multiple layers of features from tiny images , year =

  44. [52]

    Advances in neural information processing systems , volume=

    Gans trained by a two time-scale update rule converge to a local nash equilibrium , author=. Advances in neural information processing systems , volume=

  45. [53]

    arXiv preprint arXiv:2112.10741 , year=

    Glide: Towards photorealistic image generation and editing with text-guided diffusion models , author=. arXiv preprint arXiv:2112.10741 , year=

    arXiv

  46. [54]

    arXiv preprint arXiv:2307.08123 , year=

    Solving inverse problems with latent diffusion models via hard data consistency , author=. arXiv preprint arXiv:2307.08123 , year=

    arXiv

  47. [55]

    Medical physics , volume=

    The lung image database consortium (LIDC) and image database resource initiative (IDRI): a completed reference database of lung nodules on CT scans , author =. Medical physics , volume=. 2011 , publisher=

    2011

  48. [56]

    Medical physics , volume=

    Low-dose CT image and projection dataset , author=. Medical physics , volume=. 2021 , publisher=

    2021

  49. [57]

    IEEE transactions on medical imaging , volume=

    The multimodal brain tumor image segmentation benchmark (BRATS) , author=. IEEE transactions on medical imaging , volume=. 2014 , publisher=

    2014

  50. [58]

    arXiv preprint arXiv:2403.17042 , year=

    Provably robust score-based diffusion posterior sampling for plug-and-play image reconstruction , author=. arXiv preprint arXiv:2403.17042 , year=

    arXiv

  51. [59]

    International Conference on Machine Learning , pages=

    Loss-guided diffusion models for plug-and-play controllable generation , author=. International Conference on Machine Learning , pages=. 2023 , organization=

    2023

  52. [60]

    Advances in Neural Information Processing Systems , volume=

    Practical and asymptotically exact conditional sampling in diffusion models , author=. Advances in Neural Information Processing Systems , volume=

  53. [61]

    arXiv preprint arXiv:2308.07983 , year=

    Monte Carlo guided diffusion for Bayesian linear inverse problems , author=. arXiv preprint arXiv:2308.07983 , year=

    arXiv

  54. [62]

    arXiv preprint arXiv:2305.04391 , year=

    A variational perspective on solving inverse problems with diffusion models , author=. arXiv preprint arXiv:2305.04391 , year=

    arXiv

  55. [63]

    arXiv preprint arXiv:2212.00490 , year=

    Zero-shot image restoration using denoising diffusion null-space model , author=. arXiv preprint arXiv:2212.00490 , year=

    arXiv

  56. [64]

    The Twelfth International Conference on Learning Representations , year=

    Diffusion posterior sampling for linear inverse problem solving: A filtering perspective , author=. The Twelfth International Conference on Learning Representations , year=

  57. [65]

    2013 IEEE global conference on signal and information processing , pages=

    Plug-and-play priors for model based reconstruction , author=. 2013 IEEE global conference on signal and information processing , pages=. 2013 , organization=

    2013

  58. [66]

    Advances in Neural Information Processing Systems , volume=

    Diffusion models as plug-and-play priors , author=. Advances in Neural Information Processing Systems , volume=

  59. [67]

    IEEE Transactions on Computational Imaging , volume=

    Plug-and-play priors for bright field electron tomography and sparse interpolation , author=. IEEE Transactions on Computational Imaging , volume=. 2016 , publisher=

    2016

  60. [68]

    IEEE Transactions on Computational Imaging , volume=

    Plug-and-play ADMM for image restoration: Fixed-point convergence and applications , author=. IEEE Transactions on Computational Imaging , volume=. 2016 , publisher=

    2016

  61. [69]

    Advances in Neural Information Processing Systems , volume=

    Robust compressed sensing mri with deep generative priors , author=. Advances in Neural Information Processing Systems , volume=

  62. [70]

    Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

    Score-based diffusion models as principled priors for inverse imaging , author=. Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

  63. [71]

    IEEE Transactions on Computational Imaging , volume=

    Plug-and-Play ADMM for Image Restoration: Fixed-Point Convergence and Applications , author=. IEEE Transactions on Computational Imaging , volume=. 2017 , publisher=

    2017

  64. [72]

    International Conference on Learning Representations , year=

    Denoising Diffusion Implicit Models , author=. International Conference on Learning Representations , year=

  65. [73]

    Advances in Neural Information Processing Systems , volume=

    Dmplug: A plug-in method for solving inverse problems with diffusion models , author=. Advances in Neural Information Processing Systems , volume=

  66. [74]

    Information and Inference: A Journal of the IMA , volume=

    Adaptivity and convergence of probability flow ODEs in diffusion generative models , author=. Information and Inference: A Journal of the IMA , volume=. 2026 , publisher=

    2026

  67. [75]

    Journal of Machine Learning Research , volume=

    O (d/T) convergence theory for diffusion probabilistic models under minimal assumptions , author=. Journal of Machine Learning Research , volume=

  68. [76]

    2005 , publisher=

    Inverse problem theory and methods for model parameter estimation , author=. 2005 , publisher=

    2005

  69. [77]

    Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences , volume=

    An iterative thresholding algorithm for linear inverse problems with a sparsity constraint , author=. Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences , volume=. 2004 , publisher=

    2004

  70. [78]

    IEEE Transactions on information theory , volume=

    Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information , author=. IEEE Transactions on information theory , volume=. 2006 , publisher=

    2006

  71. [79]

    IEEE Transactions on information theory , volume=

    Compressed sensing , author=. IEEE Transactions on information theory , volume=. 2006 , publisher=

    2006

  72. [80]

    arXiv preprint arXiv:2207.12598 , year=

    Classifier-free diffusion guidance , author=. arXiv preprint arXiv:2207.12598 , year=

    arXiv

  73. [81]

    arXiv preprint arXiv:2403.13219 , year=

    Diffusion model for data-driven black-box optimization , author=. arXiv preprint arXiv:2403.13219 , year=

    arXiv

  74. [82]

    arXiv preprint arXiv:2403.11968 , year=

    Unveil conditional diffusion models with classifier-free guidance: A sharp statistical theory , author=. arXiv preprint arXiv:2403.11968 , year=

    arXiv

  75. [83]

    2009 IEEE conference on computer vision and pattern recognition , pages=

    Imagenet: A large-scale hierarchical image database , author=. 2009 IEEE conference on computer vision and pattern recognition , pages=. 2009 , organization=

    2009

  76. [84]

    arXiv preprint arXiv:2104.08894 , year=

    The intrinsic dimension of images and its impact on learning , author=. arXiv preprint arXiv:2104.08894 , year=

    arXiv

  77. [85]

    International Conference on Machine Learning , pages=

    Reflected diffusion models , author=. International Conference on Machine Learning , pages=. 2023 , organization=

    2023

  78. [86]

    working paper , year=

    Approximate message passing algorithms for inverse problems with diffusion priors , author=. working paper , year=

  79. [87]

    The Annals of Statistics , volume=

    Consistent inference for diffusions from low frequency measurements , author=. The Annals of Statistics , volume=. 2024 , publisher=

    2024

  80. [88]

    arXiv preprint arXiv:2211.12267 , year=

    Nonparametric Bayesian estimation in a multidimensional diffusion model with high frequency data , author=. arXiv preprint arXiv:2211.12267 , year=

    arXiv

  81. [89]

    arXiv preprint arXiv:2504.05300 , year=

    Dimension-free convergence of diffusion models for approximate Gaussian mixtures , author=. arXiv preprint arXiv:2504.05300 , year=

    arXiv

  82. [90]

    Supplement to ``Minimax Optimality of the Probability Flow ODE for Diffusion Models" , author =

  83. [91]

    International conference on machine learning , pages=

    Deep unsupervised learning using nonequilibrium thermodynamics , author=. International conference on machine learning , pages=. 2015 , organization=

    2015

  84. [92]

    Proceedings of the National Academy of Sciences , volume=

    Sampling can be faster than optimization , author=. Proceedings of the National Academy of Sciences , volume=. 2019 , publisher=

    2019

  85. [93]

    Conference on Learning Theory , pages=

    Non-convex learning via stochastic gradient langevin dynamics: a nonasymptotic analysis , author=. Conference on Learning Theory , pages=. 2017 , organization=

    2017

  86. [94]

    Conference on Learning Theory , pages=

    Further and stronger analogy between sampling and optimization: Langevin Monte Carlo and gradient descent , author=. Conference on Learning Theory , pages=. 2017 , organization=

    2017

  87. [95]

    Advances in neural information processing systems , volume=

    Rapid convergence of the unadjusted langevin algorithm: Isoperimetry suffices , author=. Advances in neural information processing systems , volume=

  88. [96]

    Bernoulli , number =

    Alain Durmus and. Bernoulli , number =

  89. [97]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Theoretical guarantees for approximate sampling from smooth and log-concave densities , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2017 , publisher=

    2017

  90. [98]

    arXiv preprint arXiv:2411.01563 , year=

    Statistical guarantees for denoising reflected diffusion models , author=. arXiv preprint arXiv:2411.01563 , year=

  91. [99]

    The annals of Statistics , pages=

    Optimal rates of convergence for nonparametric estimators , author=. The annals of Statistics , pages=. 1980 , publisher=

    1980

  92. [100]

    The annals of statistics , pages=

    Optimal global rates of convergence for nonparametric regression , author=. The annals of statistics , pages=. 1982 , publisher=

    1982

  93. [101]

    arXiv preprint arXiv:2108.01073 , year=

    Sdedit: Image synthesis and editing with stochastic differential equations , author=. arXiv preprint arXiv:2108.01073 , year=

    arXiv

  94. [102]

    Proceedings of the IEEE/CVF international conference on computer vision , pages=

    Masactrl: Tuning-free mutual self-attention control for consistent image synthesis and editing , author=. Proceedings of the IEEE/CVF international conference on computer vision , pages=

  95. [103]

    arXiv preprint arXiv:2402.17525 , year=

    Diffusion model-based image editing: A survey , author=. arXiv preprint arXiv:2402.17525 , year=

    arXiv

  96. [104]

    arXiv preprint arXiv:2310.12395 , year=

    Closed-form diffusion models , author=. arXiv preprint arXiv:2310.12395 , year=

    arXiv

  97. [105]

    arXiv preprint arXiv:2502.09151 , year=

    Regularization can make diffusion models more efficient , author=. arXiv preprint arXiv:2502.09151 , year=

  98. [106]

    arXiv preprint arXiv:2501.01783 , year=

    Nonparametric estimation of a factorizable density using diffusion models , author=. arXiv preprint arXiv:2501.01783 , year=

  99. [107]

    arXiv preprint arXiv:2403.16688 , year=

    Optimal convex M -estimation via score matching , author=. arXiv preprint arXiv:2403.16688 , year=

    arXiv

  100. [108]

    A good score does not lead to a good generative model , year =

    Li, Sixu and Chen, Shi and Li, Qin , journal =. A good score does not lead to a good generative model , year =

  101. [109]

    Convergence of the inexact langevin algorithm and score-based generative models in kl divergence , year =

    Yang, Kaylee Yingxi and Wibisono, Andre , journal =. Convergence of the inexact langevin algorithm and score-based generative models in kl divergence , year =

  102. [110]

    Sanjeev Arora and Ravi Kannan , journal =

  103. [111]

    Score-based Diffusion Models via Stochastic Differential Equations--a Technical Tutorial , year =

    Tang, Wenpin and Zhao, Hanyang , journal =. Score-based Diffusion Models via Stochastic Differential Equations--a Technical Tutorial , year =

  104. [112]

    Contributions to the mathematical theory of evolution , volume =

    Pearson, Karl , journal =. Contributions to the mathematical theory of evolution , volume =

  105. [113]

    The probability flow ode is provably fast , volume =

    Chen, Sitan and Chewi, Sinho and Lee, Holden and Li, Yuanzhi and Lu, Jianfeng and Salim, Adil , journal =. The probability flow ode is provably fast , volume =

  106. [114]

    Low-dimensional adaptation of diffusion models: Convergence in total variation , year =

    Liang, Jiadong and Huang, Zhihan and Chen, Yuxin , journal =. Low-dimensional adaptation of diffusion models: Convergence in total variation , year =

  107. [115]

    Minimax bounds for estimating multivariate Gaussian location mixtures , volume =

    Kim, Arlene KH and Guntuboyina, Adityanand , journal =. Minimax bounds for estimating multivariate Gaussian location mixtures , volume =

  108. [116]

    Nearly tight sample complexity bounds for learning mixtures of gaussians via sample compression schemes , volume =

    Ashtiani, Hassan and Ben-David, Shai and Harvey, Nicholas and Liaw, Christopher and Mehrabian, Abbas and Plan, Yaniv , journal =. Nearly tight sample complexity bounds for learning mixtures of gaussians via sample compression schemes , volume =

  109. [117]

    List-decodable robust mean estimation and learning mixtures of spherical gaussians , year =

    Diakonikolas, Ilias and Kane, Daniel M and Stewart, Alistair , booktitle =. List-decodable robust mean estimation and learning mixtures of spherical gaussians , year =

  110. [118]

    Mixture models, robustness, and sum of squares proofs , year =

    Hopkins, Samuel B and Li, Jerry , booktitle =. Mixture models, robustness, and sum of squares proofs , year =

  111. [119]

    Robust moment estimation and improved clustering via sum of squares , year =

    Kothari, Pravesh K and Steinhardt, Jacob and Steurer, David , booktitle =. Robust moment estimation and improved clustering via sum of squares , year =

  112. [120]

    Nhat Ho and XuanLong Nguyen , journal =

  113. [121]

    Clustering mixtures with almost optimal separation in polynomial time , year =

    Liu, Allen and Li, Jerry , booktitle =. Clustering mixtures with almost optimal separation in polynomial time , year =

  114. [122]

    Robust and proper learning for mixtures of gaussians via systems of polynomial inequalities , year =

    Li, Jerry and Schmidt, Ludwig , booktitle =. Robust and proper learning for mixtures of gaussians via systems of polynomial inequalities , year =

  115. [123]

    Near-optimal-sample estimators for spherical gaussian mixtures , volume =

    Suresh, Ananda Theertha and Orlitsky, Alon and Acharya, Jayadev and Jafarpour, Ashkan , journal =. Near-optimal-sample estimators for spherical gaussian mixtures , volume =

  116. [124]

    Optimal rate of convergence for finite mixture models , year =

    Chen, Jiahua , journal =. Optimal rate of convergence for finite mixture models , year =

  117. [125]

    Score-based generative models break the curse of dimensionality in learning a family of sub-Gaussian distributions , year =

    Cole, Frank and Lu, Yulong , booktitle =. Score-based generative models break the curse of dimensionality in learning a family of sub-Gaussian distributions , year =

  118. [126]

    Learning mixtures of gaussians using the DDPM objective , volume =

    Shah, Kulin and Chen, Sitan and Klivans, Adam , journal =. Learning mixtures of gaussians using the DDPM objective , volume =

  119. [127]

    Gaussian mixture solvers for diffusion models , volume =

    Guo, Hanzhong and Lu, Cheng and Bao, Fan and Pang, Tianyu and Yan, Shuicheng and Du, Chao and Li, Chongxuan , journal =. Gaussian mixture solvers for diffusion models , volume =

  120. [128]

    Critical windows: non-asymptotic theory for feature emergence in diffusion models , year =

    Li, Marvin and Chen, Sitan , journal =. Critical windows: non-asymptotic theory for feature emergence in diffusion models , year =

  121. [129]

    What does guidance do? a fine-grained analysis in a simple setting , year =

    Chidambaram, Muthu and Gatmiry, Khashayar and Chen, Sitan and Lee, Holden and Lu, Jianfeng , journal =. What does guidance do? a fine-grained analysis in a simple setting , year =

  122. [130]

    Learning mixtures of Gaussians , year =

    Dasgupta, Sanjoy , booktitle =. Learning mixtures of Gaussians , year =

  123. [131]

    Learning mixtures of spherical gaussians: moment methods and spectral decompositions , year =

    Hsu, Daniel and Kakade, Sham M , booktitle =. Learning mixtures of spherical gaussians: moment methods and spectral decompositions , year =

  124. [132]

    Strong identifiability and optimal minimax rates for finite mixture estimation , volume =

    Philippe Heinrich and Jonas Kahn , journal =. Strong identifiability and optimal minimax rates for finite mixture estimation , volume =

  125. [133]

    Optimal estimation of high-dimensional Gaussian location mixtures , volume =

    Doss, Natalie and Wu, Yihong and Yang, Pengkun and Zhou, Harrison H , journal =. Optimal estimation of high-dimensional Gaussian location mixtures , volume =

  126. [134]

    Optimal estimation of Gaussian mixtures via denoised method of moments , volume =

    Wu, Yihong and Yang, Pengkun , journal =. Optimal estimation of Gaussian mixtures via denoised method of moments , volume =

  127. [135]

    Settling the polynomial learnability of mixtures of gaussians , year =

    Moitra, Ankur and Valiant, Gregory , booktitle =. Settling the polynomial learnability of mixtures of gaussians , year =

  128. [136]

    Efficiently learning mixtures of two Gaussians , year =

    Kalai, Adam Tauman and Moitra, Ankur and Valiant, Gregory , booktitle =. Efficiently learning mixtures of two Gaussians , year =

  129. [137]

    A spectral algorithm for learning mixture models , volume =

    Vempala, Santosh and Wang, Grant , journal =. A spectral algorithm for learning mixture models , volume =

  130. [138]

    Learning mixtures of gaussians using diffusion models , year =

    Gatmiry, Khashayar and Kelner, Jonathan and Lee, Holden , journal =. Learning mixtures of gaussians using diffusion models , year =

  131. [139]

    Learning general gaussian mixtures with efficient score matching , year =

    Chen, Sitan and Kontonis, Vasilis and Shah, Kulin , journal =. Learning general gaussian mixtures with efficient score matching , year =

  132. [140]

    Provable acceleration for diffusion models under minimal assumptions , year =

    Li, Gen and Cai, Changxiao , journal =. Provable acceleration for diffusion models under minimal assumptions , year =

  133. [141]

    Unraveling the smoothness properties of diffusion models: A gaussian mixture perspective , year =

    Liang, Yingyu and Shi, Zhenmei and Song, Zhao and Zhou, Yufa , journal =. Unraveling the smoothness properties of diffusion models: A gaussian mixture perspective , year =

  134. [142]

    How much is a noisy image worth? Data Scaling Laws for Ambient Diffusion , year =

    Daras, Giannis and Cherapanamjeri, Yeshwanth and Daskalakis, Constantinos , journal =. How much is a noisy image worth? Data Scaling Laws for Ambient Diffusion , year =

  135. [143]

    Tweedie's formula and selection bias , volume =

    Efron, Bradley , journal =. Tweedie's formula and selection bias , volume =

  136. [144]

    Wenhua Jiang and Cun-Hui Zhang , journal =

  137. [145]

    Adaptive estimation of a quadratic functional by model selection , year =

    Laurent, Beatrice and Massart, Pascal , journal =. Adaptive estimation of a quadratic functional by model selection , year =

  138. [146]

    On the nonparametric maximum likelihood estimator for Gaussian location mixture densities with application to Gaussian denoising , volume =

    Saha, Sujayam and Guntuboyina, Adityanand , journal =. On the nonparametric maximum likelihood estimator for Gaussian location mixture densities with application to Gaussian denoising , volume =

  139. [147]

    High-dimensional probability: An introduction with applications in data science , volume =

    Vershynin, Roman , publisher =. High-dimensional probability: An introduction with applications in data science , volume =

  140. [148]

    Tsybakov, A. B. , publisher =. Introduction to nonparametric estimation , volume =

  141. [149]

    Li, Gen and Cai, Changxiao , title =

  142. [150]

    Generative adversarial nets , volume =

    Goodfellow, Ian and Pouget-Abadie, Jean and Mirza, Mehdi and Xu, Bing and Warde-Farley, David and Ozair, Sherjil and Courville, Aaron and Bengio, Yoshua , journal =. Generative adversarial nets , volume =

  143. [151]

    Auto-encoding variational bayes , year =

    Kingma, Diederik P , journal =. Auto-encoding variational bayes , year =

  144. [152]

    Reverse Transition Kernel: A Flexible Framework to Accelerate Diffusion Inference , year =

    Huang, Xunpeng and Zou, Difan and Dong, Hanze and Zhang, Yi and Ma, Yi-An and Zhang, Tong , journal =. Reverse Transition Kernel: A Flexible Framework to Accelerate Diffusion Inference , year =

  145. [153]

    A sharp convergence theory for the probability flow odes of diffusion models , year =

    Li, Gen and Wei, Yuting and Chi, Yuejie and Chen, Yuxin , journal =. A sharp convergence theory for the probability flow odes of diffusion models , year =

  146. [154]

    Li, Gen and Yan, Yuling , journal =

  147. [155]

    Improved analysis of score-based generative modeling: User-friendly bounds under minimal smoothness assumptions , year =

    Chen, Hongrui and Lee, Holden and Lu, Jianfeng , booktitle =. Improved analysis of score-based generative modeling: User-friendly bounds under minimal smoothness assumptions , year =

  148. [156]

    Convergence analysis of probability flow

    Huang, Daniel Zhengyu and Huang, Jiaoyang and Lin, Zhengjiang , journal =. Convergence analysis of probability flow

  149. [157]

    Linear convergence bounds for diffusion models via stochastic localization , year =

    Benton, Joe and De Bortoli, Valentin and Doucet, Arnaud and Deligiannidis, George , journal =. Linear convergence bounds for diffusion models via stochastic localization , year =

  150. [158]

    Improved Convergence Rate for Diffusion Probabilistic Models , year =

    Li, Gen and Jiao, Yuchen , journal =. Improved Convergence Rate for Diffusion Probabilistic Models , year =

  151. [159]

    Accelerating convergence of score-based diffusion models, provably , year =

    Li, Gen and Huang, Yu and Efimov, Timofey and Wei, Yuting and Chi, Yuejie and Chen, Yuxin , journal =. Accelerating convergence of score-based diffusion models, provably , year =

  152. [160]

    Towards faster non-asymptotic convergence for diffusion-based generative models , year =

    Li, Gen and Wei, Yuting and Chen, Yuxin and Chi, Yuejie , journal =. Towards faster non-asymptotic convergence for diffusion-based generative models , year =

  153. [161]

    Progressive distillation for fast sampling of diffusion models , year =

    Salimans, Tim and Ho, Jonathan , journal =. Progressive distillation for fast sampling of diffusion models , year =

  154. [162]

    Consistency models , year =

    Song, Yang and Dhariwal, Prafulla and Chen, Mark and Sutskever, Ilya , journal =. Consistency models , year =

  155. [163]

    Denoising diffusion probabilistic models , volume =

    Ho, Jonathan and Jain, Ajay and Abbeel, Pieter , journal =. Denoising diffusion probabilistic models , volume =

  156. [164]

    Estimation of non-normalized statistical models by score matching

    Hyv. Estimation of non-normalized statistical models by score matching. , volume =. Journal of Machine Learning Research , number =

  157. [165]

    Convergence for score-based generative modeling with polynomial complexity , volume =

    Lee, Holden and Lu, Jianfeng and Tan, Yixin , journal =. Convergence for score-based generative modeling with polynomial complexity , volume =

  158. [166]

    Convergence of score-based generative modeling for general data distributions , year =

    Lee, Holden and Lu, Jianfeng and Tan, Yixin , booktitle =. Convergence of score-based generative modeling for general data distributions , year =

  159. [167]

    Generative modeling by estimating gradients of the data distribution , volume =

    Song, Yang and Ermon, Stefano , journal =. Generative modeling by estimating gradients of the data distribution , volume =

  160. [168]

    Score-based generative modeling through stochastic differential equations , year =

    Song, Yang and Sohl-Dickstein, Jascha and Kingma, Diederik P and Kumar, Abhishek and Ermon, Stefano and Poole, Ben , journal =. Score-based generative modeling through stochastic differential equations , year =

  161. [169]

    Denoising diffusion implicit models , year =

    Song, Jiaming and Meng, Chenlin and Ermon, Stefano , journal =. Denoising diffusion implicit models , year =

  162. [170]

    Reverse-time diffusion equation models , volume =

    Anderson, Brian DO , journal =. Reverse-time diffusion equation models , volume =

  163. [171]

    Dpm-solver: A fast ode solver for diffusion probabilistic model sampling in around 10 steps , volume =

    Lu, Cheng and Zhou, Yuhao and Bao, Fan and Chen, Jianfei and Li, Chongxuan and Zhu, Jun , journal =. Dpm-solver: A fast ode solver for diffusion probabilistic model sampling in around 10 steps , volume =

  164. [172]

    Dpm-solver++: Fast solver for guided sampling of diffusion probabilistic models , year =

    Lu, Cheng and Zhou, Yuhao and Bao, Fan and Chen, Jianfei and Li, Chongxuan and Zhu, Jun , journal =. Dpm-solver++: Fast solver for guided sampling of diffusion probabilistic models , year =

  165. [173]

    A connection between score matching and denoising autoencoders , volume =

    Vincent, Pascal , journal =. A connection between score matching and denoising autoencoders , volume =

  166. [174]

    Sliced score matching: A scalable approach to density and score estimation , year =

    Song, Yang and Garg, Sahaj and Shi, Jiaxin and Ermon, Stefano , booktitle =. Sliced score matching: A scalable approach to density and score estimation , year =

  167. [175]

    Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions , year =

    Chen, Sitan and Chewi, Sinho and Li, Jerry and Li, Yuanzhi and Salim, Adil and Zhang, Anru R , journal =. Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions , year =

  168. [176]

    Restoration-degradation beyond linear diffusions: A non-asymptotic analysis for ddim-type samplers , year =

    Chen, Sitan and Daras, Giannis and Dimakis, Alex , booktitle =. Restoration-degradation beyond linear diffusions: A non-asymptotic analysis for ddim-type samplers , year =

  169. [177]

    Non-asymptotic convergence of discrete-time diffusion models: New approach and improved rate , year =

    Liang, Yuchen and Ju, Peizhong and Liang, Yingbin and Shroff, Ness , journal =. Non-asymptotic convergence of discrete-time diffusion models: New approach and improved rate , year =

  170. [178]

    Wasserstein convergence guarantees for a general class of score-based generative models , year =

    Gao, Xuefeng and Nguyen, Hoang M and Zhu, Lingjiong , journal =. Wasserstein convergence guarantees for a general class of score-based generative models , year =

  171. [179]

    Convergence analysis for general probability flow ODEs of diffusion models in Wasserstein distances , year =

    Gao, Xuefeng and Zhu, Lingjiong , journal =. Convergence analysis for general probability flow ODEs of diffusion models in Wasserstein distances , year =

  172. [180]

    Convergence analysis of discrete diffusion model: Exact implementation through uniformization , year =

    Chen, Hongrui and Ying, Lexing , journal =. Convergence analysis of discrete diffusion model: Exact implementation through uniformization , year =

  173. [181]

    Error bounds for flow matching methods , year =

    Benton, Joe and Deligiannidis, George and Doucet, Arnaud , journal =. Error bounds for flow matching methods , year =

  174. [182]

    Faster Diffusion-based Sampling with Randomized Midpoints: Sequential and Parallel , year =

    Gupta, Shivam and Cai, Linda and Chen, Sitan , journal =. Faster Diffusion-based Sampling with Randomized Midpoints: Sequential and Parallel , year =

  175. [183]

    Fast sampling of diffusion models with exponential integrator , year =

    Zhang, Qinsheng and Chen, Yongxin , journal =. Fast sampling of diffusion models with exponential integrator , year =

  176. [184]

    Unipc: A unified predictor-corrector framework for fast sampling of diffusion models , volume =

    Zhao, Wenliang and Bai, Lujia and Rao, Yongming and Zhou, Jie and Lu, Jiwen , journal =. Unipc: A unified predictor-corrector framework for fast sampling of diffusion models , volume =

  177. [185]

    arXiv preprint arXiv:2105.14080 , title =

    Jolicoeur-Martineau, Alexia and Li, Ke and Pich. arXiv preprint arXiv:2105.14080 , title =

    arXiv

  178. [186]

    Elucidating the design space of diffusion-based generative models , volume =

    Karras, Tero and Aittala, Miika and Aila, Timo and Laine, Samuli , journal =. Elucidating the design space of diffusion-based generative models , volume =

  179. [187]

    SA-Solver: Stochastic Adams solver for fast sampling of diffusion models , volume =

    Xue, Shuchen and Yi, Mingyang and Luo, Weijian and Zhang, Shifeng and Sun, Jiacheng and Li, Zhenguo and Ma, Zhi-Ming , journal =. SA-Solver: Stochastic Adams solver for fast sampling of diffusion models , volume =

  180. [188]

    Neural network-based score estimation in diffusion models: Optimization and generalization , year =

    Han, Yinbin and Razaviyayn, Meisam and Xu, Renyuan , journal =. Neural network-based score estimation in diffusion models: Optimization and generalization , year =

  181. [189]

    Diffusion models beat gans on image synthesis , volume =

    Dhariwal, Prafulla and Nichol, Alexander , journal =. Diffusion models beat gans on image synthesis , volume =

  182. [190]

    Grad-tts: A diffusion probabilistic model for text-to-speech , year =

    Popov, Vadim and Vovk, Ivan and Gogoryan, Vladimir and Sadekova, Tasnima and Kudinov, Mikhail , booktitle =. Grad-tts: A diffusion probabilistic model for text-to-speech , year =

  183. [191]

    High-resolution image synthesis with latent diffusion models , year =

    Rombach, Robin and Blattmann, Andreas and Lorenz, Dominik and Esser, Patrick and Ommer, Bj. High-resolution image synthesis with latent diffusion models , year =. Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages =

  184. [192]

    Diffusion-lm improves controllable text generation , volume =

    Li, Xiang and Thickstun, John and Gulrajani, Ishaan and Liang, Percy S and Hashimoto, Tatsunori B , journal =. Diffusion-lm improves controllable text generation , volume =

  185. [193]

    Hierarchical text-conditional image generation with clip latents , volume =

    Ramesh, Aditya and Dhariwal, Prafulla and Nichol, Alex and Chu, Casey and Chen, Mark , journal =. Hierarchical text-conditional image generation with clip latents , volume =

  186. [194]

    Convergence of denoising diffusion models under the manifold hypothesis , year =

    De Bortoli, Valentin , journal =. Convergence of denoising diffusion models under the manifold hypothesis , year =

  187. [195]

    Diffusion models learn low-dimensional distributions via subspace clustering , year =

    Wang, Peng and Zhang, Huijie and Zhang, Zekai and Chen, Siyi and Ma, Yi and Qu, Qing , journal =. Diffusion models learn low-dimensional distributions via subspace clustering , year =

  188. [196]

    The emergence of reproducibility and consistency in diffusion models , year =

    Zhang, Huijie and Zhou, Jinfan and Lu, Yifu and Guo, Minzhe and Wang, Peng and Shen, Liyue and Qu, Qing , booktitle =. The emergence of reproducibility and consistency in diffusion models , year =

  189. [197]

    Stochastic Runge-Kutta Methods: Provable Acceleration of Diffusion Models , year =

    Wu, Yuchen and Chen, Yuxin and Wei, Yuting , journal =. Stochastic Runge-Kutta Methods: Provable Acceleration of Diffusion Models , year =

  190. [198]

    Theoretical insights for diffusion guidance: A case study for gaussian mixture models , year =

    Wu, Yuchen and Chen, Minshuo and Li, Zihao and Wang, Mengdi and Wei, Yuting , journal =. Theoretical insights for diffusion guidance: A case study for gaussian mixture models , year =

  191. [199]

    Diffusion models: A comprehensive survey of methods and applications , volume =

    Yang, Ling and Zhang, Zhilong and Song, Yang and Hong, Shenda and Xu, Runsheng and Zhao, Yue and Zhang, Wentao and Cui, Bin and Yang, Ming-Hsuan , journal =. Diffusion models: A comprehensive survey of methods and applications , volume =

  192. [200]

    An overview of diffusion models: Applications, guided generation, statistical rates and optimization , year =

    Chen, Minshuo and Mei, Song and Fan, Jianqing and Wang, Mengdi , journal =. An overview of diffusion models: Applications, guided generation, statistical rates and optimization , year =

  193. [201]

    Protein design with guided discrete diffusion , volume =

    Gruver, Nate and Stanton, Samuel and Frey, Nathan and Rudner, Tim GJ and Hotzel, Isidro and Lafrance-Vanasse, Julien and Rajpal, Arvind and Cho, Kyunghyun and Wilson, Andrew G , journal =. Protein design with guided discrete diffusion , volume =

  194. [202]

    Score-based diffusion models for accelerated MRI , volume =

    Chung, Hyungjin and Ye, Jong Chul , journal =. Score-based diffusion models for accelerated MRI , volume =

  195. [203]

    Planning with diffusion for flexible behavior synthesis , year =

    Janner, Michael and Du, Yilun and Tenenbaum, Joshua B and Levine, Sergey , journal =. Planning with diffusion for flexible behavior synthesis , year =

  196. [204]

    Contrastive energy prediction for exact energy-guided diffusion sampling in offline reinforcement learning , year =

    Lu, Cheng and Chen, Huayu and Chen, Jianfei and Su, Hang and Li, Chongxuan and Zhu, Jun , booktitle =. Contrastive energy prediction for exact energy-guided diffusion sampling in offline reinforcement learning , year =

  197. [205]

    Diffusion policies as an expressive policy class for offline reinforcement learning , year =

    Wang, Zhendong and Hunt, Jonathan J and Zhou, Mingyuan , journal =. Diffusion policies as an expressive policy class for offline reinforcement learning , year =

  198. [206]

    Diffusion policy: Visuomotor policy learning via action diffusion , year =

    Chi, Cheng and Xu, Zhenjia and Feng, Siyuan and Cousineau, Eric and Du, Yilun and Burchfiel, Benjamin and Tedrake, Russ and Song, Shuran , journal =. Diffusion policy: Visuomotor policy learning via action diffusion , year =

  199. [207]

    Offline reinforcement learning via high-fidelity generative behavior modeling , year =

    Chen, Huayu and Lu, Cheng and Ying, Chengyang and Su, Hang and Zhu, Jun , journal =. Offline reinforcement learning via high-fidelity generative behavior modeling , year =

  200. [208]

    Is conditional generative modeling all you need for decision-making? , year =

    Ajay, Anurag and Du, Yilun and Gupta, Abhi and Tenenbaum, Joshua and Jaakkola, Tommi and Agrawal, Pulkit , journal =. Is conditional generative modeling all you need for decision-making? , year =

  201. [209]

    Imitating human behaviour with diffusion models , year =

    Pearce, Tim and Rashid, Tabish and Kanervisto, Anssi and Bignell, Dave and Sun, Mingfei and Georgescu, Raluca and Valcarcel Macua, Sergio and Tan, Shan Zheng and Momennejad, Ida and Hofmann, Katja and Devlin, Sam , journal =. Imitating human behaviour with diffusion models , year =

  202. [210]

    Idql: Implicit q-learning as an actor-critic method with diffusion policies , year =

    Hansen-Estruch, Philippe and Kostrikov, Ilya and Janner, Michael and Kuba, Jakub Grudzien and Levine, Sergey , journal =. Idql: Implicit q-learning as an actor-critic method with diffusion policies , year =

  203. [211]

    Structured denoising diffusion models in discrete state-spaces , volume =

    Austin, Jacob and Johnson, Daniel D and Ho, Jonathan and Tarlow, Daniel and Van Den Berg, Rianne , journal =. Structured denoising diffusion models in discrete state-spaces , volume =

  204. [212]

    Time reversal of diffusions , year =

    Haussmann, Ulrich G and Pardoux, Etienne , journal =. Time reversal of diffusions , year =

  205. [213]

    Rapid convergence of the unadjusted langevin algorithm: Isoperimetry suffices , volume =

    Vempala, Santosh and Wibisono, Andre , journal =. Rapid convergence of the unadjusted langevin algorithm: Isoperimetry suffices , volume =

  206. [214]

    2013 , publisher=

    Analysis and geometry of Markov diffusion operators , author=. 2013 , publisher=

    2013

  207. [215]

    Sara and Gontijo-Lopes, Raphael and Salimans, Tim and Ho, Jonathan and Fleet, David J and Norouzi, Mohammad , journal =

    Saharia, Chitwan and Chan, William and Saxena, Saurabh and Lit, Lala and Whang, Jay and Denton, Emily and Ghasemipour, Seyed Kamyar Seyed and Ayan, Burcu Karagol and Mahdavi, S. Sara and Gontijo-Lopes, Raphael and Salimans, Tim and Ho, Jonathan and Fleet, David J and Norouzi, ...

  208. [216]

    Optimal score estimation via empirical bayes smoothing , year =

    Wibisono, Andre and Wu, Yihong and Yang, Kaylee Yingxi , journal =. Optimal score estimation via empirical bayes smoothing , year =

  209. [217]

    Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions , year =

    Zhang, Kaihong and Yin, Heqi and Liang, Feng and Liu, Jingbo , journal =. Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions , year =

  210. [218]

    Generative modeling with denoising auto-encoders and Langevin sampling , year =

    Block, Adam and Mroueh, Youssef and Rakhlin, Alexander , journal =. Generative modeling with denoising auto-encoders and Langevin sampling , year =

  211. [219]

    Diffusion schr

    De Bortoli, Valentin and Thornton, James and Heng, Jeremy and Doucet, Arnaud , journal =. Diffusion schr

  212. [220]

    Diffusion models are minimax optimal distribution estimators , year =

    Oko, Kazusato and Akiyama, Shunta and Suzuki, Taiji , booktitle =. Diffusion models are minimax optimal distribution estimators , year =

  213. [221]

    Linear Convergence of Diffusion Models Under the Manifold Hypothesis , year =

    Potaptchik, Peter and Azangulov, Iskander and Deligiannidis, George , journal =. Linear Convergence of Diffusion Models Under the Manifold Hypothesis , year =

  214. [222]

    Denoising diffusion probabilistic models are optimally adaptive to unknown low dimensionality , year =

    Huang, Zhihan and Wei, Yuting and Chen, Yuxin , journal =. Denoising diffusion probabilistic models are optimally adaptive to unknown low dimensionality , year =

  215. [223]

    Contractive diffusion probabilistic models , year =

    Tang, Wenpin and Zhao, Hanyang , journal =. Contractive diffusion probabilistic models , year =

  216. [224]

    Accelerating Diffusion Models with Parallel Sampling: Inference at Sub-Linear Time Complexity , year =

    Chen, Haoxuan and Ren, Yinuo and Ying, Lexing and Rotskoff, Grant M , journal =. Accelerating Diffusion Models with Parallel Sampling: Inference at Sub-Linear Time Complexity , year =

  217. [225]

    Let us build bridges: Understanding and extending diffusion generative models , year =

    Liu, Xingchao and Wu, Lemeng and Ye, Mao and Liu, Qiang , journal =. Let us build bridges: Understanding and extending diffusion generative models , year =

  218. [226]

    Score-based generative models detect manifolds , volume =

    Pidstrigach, Jakiw , journal =. Score-based generative models detect manifolds , volume =

  219. [227]

    Adapting to Unknown Low-Dimensional Structures in Score-Based Diffusion Models , year =

    Li, Gen and Yan, Yuling , journal =. Adapting to Unknown Low-Dimensional Structures in Score-Based Diffusion Models , year =

  220. [228]

    An information-theoretic view of stochastic localization , volume =

    El Alaoui, Ahmed and Montanari, Andrea , journal =. An information-theoretic view of stochastic localization , volume =

  221. [229]

    Sampling, diffusions, and stochastic localization , year =

    Montanari, Andrea , journal =. Sampling, diffusions, and stochastic localization , year =

  222. [230]

    Convergence of Diffusion Models Under the Manifold Hypothesis in High-Dimensions , year =

    Azangulov, Iskander and Deligiannidis, George and Rousseau, Judith , journal =. Convergence of Diffusion Models Under the Manifold Hypothesis in High-Dimensions , year =

  223. [231]

    From optimal score matching to optimal sampling , year =

    Dou, Zehao and Kotekal, Subhodh and Xu, Zhehao and Zhou, Harrison H , journal =. From optimal score matching to optimal sampling , year =

  224. [232]

    Score approximation, estimation and distribution recovery of diffusion models on low-dimensional data , year =

    Chen, Minshuo and Huang, Kaixuan and Zhao, Tuo and Wang, Mengdi , booktitle =. Score approximation, estimation and distribution recovery of diffusion models on low-dimensional data , year =

  225. [233]

    arXiv preprint arXiv:2310.03575 , title =

    Cui, Hugo and Krzakala, Florent and Vanden-Eijnden, Eric and Zdeborov. arXiv preprint arXiv:2310.03575 , title =

    arXiv

  226. [234]

    Adaptivity of diffusion models to manifold structures , year =

    Tang, Rong and Yang, Yun , booktitle =. Adaptivity of diffusion models to manifold structures , year =

  227. [235]

    Deep networks as denoising algorithms: Sample-efficient learning of diffusion models in high-dimensional graphical models , year =

    Mei, Song and Wu, Yuchen , journal =. Deep networks as denoising algorithms: Sample-efficient learning of diffusion models in high-dimensional graphical models , year =

  228. [236]

    Sampling from mean-field gibbs measures via diffusion processes , year =

    Alaoui, Ahmed El and Montanari, Andrea and Sellke, Mark , journal =. Sampling from mean-field gibbs measures via diffusion processes , year =

  229. [237]

    Posterior sampling from the spiked models via diffusion processes , year =

    Montanari, Andrea and Wu, Yuchen , journal =. Posterior sampling from the spiked models via diffusion processes , year =

  230. [238]

    Stochastic interpolants: A unifying framework for flows and diffusions , year =

    Albergo, Michael S and Boffi, Nicholas M and Vanden-Eijnden, Eric , journal =. Stochastic interpolants: A unifying framework for flows and diffusions , year =

  231. [239]

    Taming correlations through entropy-efficient measure decompositions with applications to mean-field approximation , volume =

    Eldan, Ronen , journal =. Taming correlations through entropy-efficient measure decompositions with applications to mean-field approximation , volume =

  232. [240]

    Convergence of flow-based generative models via proximal gradient descent in wasserstein space , year =

    Cheng, Xiuyuan and Lu, Jianfeng and Tan, Yixin and Xie, Yao , journal =. Convergence of flow-based generative models via proximal gradient descent in wasserstein space , year =

  233. [241]

    Normalizing flow neural networks by JKO scheme , volume =

    Xu, Chen and Cheng, Xiuyuan and Xie, Yao , journal =. Normalizing flow neural networks by JKO scheme , volume =

  234. [242]

    Posterior sampling via Langevin dynamics based on generative priors , year =

    Purohit, Vishal and Repasky, Matthew and Lu, Jianfeng and Qiu, Qiang and Xie, Yao and Cheng, Xiuyuan , journal =. Posterior sampling via Langevin dynamics based on generative priors , year =

  235. [243]

    2015 , publisher=

    Multivariate density estimation: theory, practice, and visualization , author=. 2015 , publisher=

    2015

  236. [244]

    Advances in neural information processing systems , volume=

    Masked autoregressive flow for density estimation , author=. Advances in neural information processing systems , volume=

  237. [245]

    Simple and effective masked diffusion language models , volume =

    Sahoo, Subham and Arriola, Marianne and Schiff, Yair and Gokaslan, Aaron and Marroquin, Edgar and Chiu, Justin and Rush, Alexander and Kuleshov, Volodymyr , journal =. Simple and effective masked diffusion language models , volume =

  238. [246]

    Discrete diffusion modeling by estimating the ratios of the data distribution , year =

    Lou, Aaron and Meng, Chenlin and Ermon, Stefano , journal =. Discrete diffusion modeling by estimating the ratios of the data distribution , year =

  239. [247]

    arXiv preprint arXiv:2502.09992 , year=

    Large language diffusion models , author=. arXiv preprint arXiv:2502.09992 , year=

    arXiv

  240. [248]

    arXiv preprint arXiv:2406.03736 , year=

    Your absorbing discrete diffusion secretly models the conditional distributions of clean data , author=. arXiv preprint arXiv:2406.03736 , year=

    arXiv

  241. [249]

    Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

    Blended diffusion for text-driven editing of natural images , author=. Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages=

  242. [250]

    Machine Learning: Science and Technology , volume=

    Spectroscopy-guided discovery of three-dimensional structures of disordered materials with diffusion models , author =. Machine Learning: Science and Technology , volume=. 2024 , publisher=

    2024

  243. [251]

    Sequential Monte Carlo methods in practice , pages=

    An introduction to sequential Monte Carlo methods , author=. Sequential Monte Carlo methods in practice , pages=. 2001 , publisher=

    2001

  244. [252]

    arXiv preprint arXiv:2402.12727 , year=

    Diffusion posterior sampling is computationally intractable , author=. arXiv preprint arXiv:2402.12727 , year=

  245. [253]

    arXiv preprint arXiv:2108.02938 , year=

    Ilvr: Conditioning method for denoising diffusion probabilistic models , author=. arXiv preprint arXiv:2108.02938 , year=

    arXiv

Pith tools

Reviewed August 1, 2026 · model on record in the stance chip above.