Pith. sign in

REVIEW 2 major objections 4 minor 267 references

Tightening the Score Matching Gap for Diffusion Models

T0 review · 2 major / 4 minor · reviewed 2026-07-11 · grok-4.5

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

Pith's one-line read Score-matching gap for diffusion models tightens with decaying weights that put most weight on low-noise times.

desk verdict Clean continuous-time tightening of the score-matching gap with explicit decaying weights; solid math, useful qualitative message, regularity assumptions only lightly checked. read the letter →

arxiv 2607.04442 v1 pith:NVDKZ63D submitted 2026-07-05 stat.ML cs.LG

Benjamin Dupuis , Tyler Farghly , Maxime Haddouche , Alain Durmus , Umut Simsekli This is my paper · ORCID
classification stat.MLcs.LG MSC 60H1068T0562M45
keywords diffusionmodelsscorematchinggapELBOlog-SobolevinequalitiesentropyflowreflectioncouplingWassersteindistance
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

Diffusion models train by matching the score of a noising process, then reverse that process to generate samples. The usual ELBO bounds the KL between data and model by an integral of score error that is constant in time; that integral can be a loose proxy for sample quality. This paper shows that under regularity of the learned score (one-sided Lipschitz or dissipativity), the same KL can be bounded by a reweighted integral whose weight is strictly decreasing in forward time, plus a smaller initialization term. Parallel decaying bounds hold for reverse KL and Wasserstein distance. The message is that score accuracy at low noise matters more for closing the gap than accuracy at high noise, and that the contraction of the reverse diffusion is what produces the decay.

What carries the argument

Entropy-flow identity for the pair of reverse Fokker–Planck equations, combined with time-dependent log-Sobolev constants of the reverse process (and reflection couplings for Wasserstein), which convert the usual constant-weight score integral into an exponentially or polynomially decaying weight.

What would settle it

Train a score network that deliberately violates the one-sided Lipschitz condition at small noise and check whether the reweighted integral still upper-bounds the empirical KL (or W_1) of generated samples better than the classical ELBO; if the classical bound becomes tighter, the claimed decay fails.

Watch

Extended reading notes

Core claim

Under one-sided Lipschitz (or dissipativity-at-distance) assumptions on the score network, the forward KL admits the tightened bound KL(μ ∥ ←μ_θ_T) ≲ ∫ λ_T(t) E[ε_θ_t(→X_t)^{2}] dt + K_T, where the explicit weight λ_T(t) < 1 is decreasing in t; analogous decaying weights hold for reverse KL and W_1/W_f.

Load-bearing premise

The learned score must obey a one-sided Lipschitz (or dissipativity-at-distance) condition that is uniform, or at worst mildly singular, for every noise level.

Editorial extensions

If this is right

  • Evaluation and early-stopping can safely reweight the score-matching loss toward low-noise times without losing the theoretical guarantee.
  • Existing continuous-time KL and Wasserstein convergence rates for diffusion models improve by replacing the factor T with an explicit decaying integral.
  • Training schedules that already down-weight high noise receive a theoretical justification: those times contribute less to the final gap.
  • Reverse-KL and Wasserstein versions of the same gap become available for analysis even when the data measure is singular.

Reading between the lines

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

  • If modern U-Nets only satisfy the regularity assumptions at moderate noise, the practical gain of the decaying weight will be largest in the middle of the schedule rather than at the extreme low-noise end.
  • The same entropy-flow-plus-LSI argument should extend, with only notational changes, to variance-exploding and critically damped Langevin dynamics once their reverse LSI constants are controlled.
  • A discrete-time version of the decaying weights would immediately tighten many existing finite-step convergence proofs that currently carry a linear factor in the number of steps.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 4 minor

Summary. The paper analyzes the score-matching gap for continuous-time diffusion models (Ornstein–Uhlenbeck forward process). It first shows (Prop. 3.1) that the classical ELBO/Girsanov bound is essentially tight in the worst case without regularity on the score estimator. Under one-sided Lipschitz or dissipativity-at-distance assumptions on s_θ, it then derives tightened bounds on forward KL (Thms. 3.5–3.10), reverse KL (Thm. 4.3) and Wasserstein distances W_f / W_1 (Thm. 4.8, Cor. 4.9) that replace the constant weight 1/4 by explicit, time-decaying factors λ_T(t) or C_T(t) (Table 1). The technical engine is an entropy-flow identity (Lemmas 3.4, 4.2) combined with LSI estimates for the reverse process and reflection couplings. A short empirical section on a toy circle and a CIFAR-10 U-Net illustrates that low-noise score error tracks sample quality more closely and that the regularity assumptions hold at least qualitatively.

Significance. If the regularity hypotheses hold for practical score networks, the work supplies the first explicit, non-uniform weights that correctly prioritize low-noise regimes when converting score-matching loss into KL or Wasserstein guarantees. This both tightens existing continuous-time convergence analyses and offers a principled justification for the empirical practice of down-weighting small noise scales. The derivations are fully written out, the negative result via Schrödinger bridges is carefully stated, and the reflection-coupling argument for Wasserstein is new in the DM literature. The main limitation is that the load-bearing Lipschitz/dissipativity assumptions are only partially verified; if they fail for modern architectures the quantitative improvement disappears, but the qualitative message remains useful.

major comments (2)
  1. Theorems 3.7, 3.10 and 4.8 rest on a uniform (or 1+c/t) one-sided Lipschitz constant M (or the stronger (L,ρ,R)-dissipativity of Assumption 3.9) holding for every t∈[0,T]. Figure 4 only plots empirical κ(x,y) for a single CIFAR U-Net and shows that the local Lipschitz constant grows as t→0. Without a quantitative bound on M (or a proof that modern residual/attention blocks satisfy dissipativity at distance), the claimed exponential decay of λ_T(t) and C_T(t) remains conditional. A short discussion of how large M can be, or a counter-example network for which M>1, would make the scope of the theorems clearer.
  2. Section 5 experiments are purely illustrative: the toy circle uses a histogram KL estimate on 8 training points, and the CIFAR perturbation study uses a crude hand-tuned regularity constant. Neither experiment falsifies or quantitatively validates the decay rates of Table 1. At minimum the authors should report the numerical values of the estimated M (or c) used to produce the “Our weighting” curve in Figure 5, and state whether the same constant works across architectures.
minor comments (4)
  1. Table 1 lists decay rates but does not display the absolute prefactors that appear when α=1/2 is chosen; a short remark that the classical 1/4 is replaced by 1/2 would avoid confusion.
  2. Notation for the score error switches between ε_θ_t(x)^{2} and ∥s−s_θ∥^{2}; a single consistent definition early in §2 would help.
  3. The appendix proofs of the reflection-coupling argument (Prop. C.2) are long; a one-paragraph sketch in the main text of how the synchronous/reflection switch is handled would improve readability.
  4. References to concurrent Wasserstein analyses (Beyler & Bach 2025, Bruno & Sabanis 2025) are present but could be compared more explicitly on the dependence on T.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: tightened score-matching bounds are derived from entropy-flow identities plus standard LSI/reflection-coupling estimates under explicit regularity assumptions.

full rationale

The central claims (Theorems 3.5–3.10, 4.3, 4.8 and Corollaries) are conditional mathematical upper bounds. They start from the Fokker–Planck equations of the true and approximate reverse processes, obtain the entropy-flow differential inequalities (Lemmas 3.4 and 4.2), replace Fisher information by KL via LSI (or control pathwise distance via Eberle-style reflection couplings), and close with Grönwall. The decaying weights λ_T(t) and C_T(t) are the explicit integrating factors that arise once a one-sided Lipschitz or dissipativity-at-distance hypothesis is imposed on s_θ (or an LSI hypothesis on μ for reverse KL). Those hypotheses are stated as assumptions, not fitted from the target quantity; the theorems do not claim to predict sample quality without them. Self-citations (Dupuis et al. 2025; Farghly et al. 2026) appear only in the optional Section D generalization extension and are not load-bearing for the main bounds. Empirical plots that insert a crude numerical M or c are illustrations of the already-proved functional form, not inputs that force the theorems. No step reduces the claimed bound to its own definition or to a fitted parameter renamed as a prediction.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The central claims rest on standard functional inequalities (LSI, Talagrand) and on regularity of the learned score that is not guaranteed for arbitrary neural networks. No free parameters are fitted into the theorems; the only free constants are those appearing in the dissipativity / Lipschitz assumptions themselves.

assumptions (4)
  • domain assumption The reverse process densities satisfy the Fokker–Planck equation in C^{1,2} and the Fisher informations appearing in Assumptions 3.3 / 4.1 are finite and integrable.
    Standard mild regularity for diffusion models; invoked for all entropy-flow calculations (Lemma 3.4 onward).
  • ad hoc to paper Score network s_θ is one-sided Lipschitz with constant M (or M_t = 1 + c/t) or satisfies (L,ρ,R)-dissipativity at distance (Assumption 3.9).
    Needed to bound the LSI constant of ←μ_θ_t (Lemma B.4, Thm 3.7, 3.10) and the reflection-coupling rate (Thm 4.8); only partially verified empirically.
  • domain assumption Data distribution μ satisfies a logarithmic Sobolev inequality with constant ρ_0 (for reverse-KL results).
    Used in Theorem 4.3 and Corollary 4.6; can be relaxed to compact support or sub-Gaussian tails by cited convolution results.
  • standard math Standard Gaussian γ_d satisfies 1-LSI and the OU process contracts entropy at rate e^{-2t}.
    Classical Bakry–Émery / Gross theory; used throughout.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Tightening the Score Matching Gap for Diffusion Models." pith.science (2026). https://pith.science/paper/NVDKZ63D

@misc{pith2026260704442,
  author       = {Pith},
  title        = {Pith review of: Tightening the Score Matching Gap for Diffusion Models},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NVDKZ63D}},
  note         = {Machine review of arXiv:2607.04442}
}
read the original abstract

Diffusion models (DMs) are a state-of-the-art generative method to approximately sample from an unknown distribution. Their training and evaluation primarily rely on an Evidence Lower Bound (ELBO), which relates the Kullback-Leibler (KL) divergence of model samples to the score matching loss along the path, which serves as a tractable surrogate. The difference between sample quality and the score matching loss produced by this bound leads to the \emph{score matching gap}, which is known to be tight in the worst-case but not descriptive of sample quality in general. In this work, we provide a theoretical analysis of this gap, developing tighter bounds for three metrics: KL divergence, reverse KL divergence, and Wasserstein distance, effectively exploiting the regularity of the class of score estimators. Our results suggest that the quality of the score approximation has more impact on closing the score matching gap for low noise scales. To obtain these bounds, our key technical insight is to exploit the contraction properties of the backward processes. In particular, we rely on entropy flows, logarithmic Sobolev inequalities and reflection couplings, rigorously linking the ergodicity of the Langevin diffusion to the score matching gap problem.

Figures

Figures reproduced from arXiv: 2607.04442 by the authors.

Figure 1
Figure 1. Decay term λT (t) of Theorem 3.7 for Mt ≡ M (full line) and for Mt = 1 + c/t (dotted line). Here T = 5. ones. We empirically investigate this in Section 5. Most importantly, our bounds decouple the time-weighting that should be used for training (Ho et al., 2020) and evaluation. Remark 3.8 (Connection to generalization bounds). Re￾cently, Farghly et al. (2026); Dupuis et al. (2025) uncovered links between the denois… view at source ↗
Figure 2
Figure 2. Value of the decay term t 7→ λT (t) appearing in Theo￾rem 4.3 for different values of ρ0. with K¯ T := λ¯(T)KL γ d | −→µ T  , and, for t ∈ [0, T], λ¯(t) := r ρ0 ρ0 + e 2t − 1 ⩽ e −t/ max(1,ρ0) . (8) Remark 4.4. Similar to Remark 3.6 in the forward KL case, it follows from the joint convexity of the KL divergence that KL γ d | −→µ T  ⩽ 1 2 (e 2T − 1)W2(γ d , µ) 2 , when µ has finite moments of order 2. The data pro… view at source ↗
Figure 3
Figure 3. KL divergence and test score matching loss over training, with the SM loss split by forward-time interval. Earlier (low-noise) intervals track the KL divergence trajectory most closely. This is instrumental in our proofs, where it is used to control the distance between the two coupled SDEs (see Section C). To obtain Wasserstein contraction, a key insight from (Eberle, 2016) is to analyze the quantity f(rt), where r… view at source ↗
Figures from the paper (2 more)
Figure 6
Figure 6. Figure 6: CIFAR-10 samples with score perturbed at different times, tp. Small tp yields grainy, locally corrupted images and large tp alters global content. Score perturbations on CIFAR-10. Remaining in the same setting as the previous section, we consider a perturbed version of…
Figure 7
Figure 7. Figure 7: Weighted test score matching loss plotted against number of epochs during training. E.2. CIFAR-10 We also consider CIFAR-10, an implementation of the DDPM model from (Song et al., 2021b). We use the configuration titledvp.ddpm.cifar10 continuous which implements the DD…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

267 extracted references · 4 linked inside Pith

  1. [1]

    Proceedings of the 2016

    Mart. Proceedings of the 2016

    2016

  2. [2]

    2025 , booktitle=

    Algorithm- and Data-Dependent Generalization Bounds for Score-Based Generative Models , author=. 2025 , booktitle=

    2025

  3. [3]

    Bernoulli , number =

    Patrick Cattiaux and Arnaud Guillin , title =. Bernoulli , number =

  4. [4]

    Annales de l'Institut Henri Poincaré, Probabilités et Statistiques , number =

    Feng-Yu Wang and Jian Wang , title =. Annales de l'Institut Henri Poincaré, Probabilités et Statistiques , number =

  5. [5]

    Bernoulli , number =

    Jean-Baptiste Bardet and Natha. Bernoulli , number =

  6. [6]

    2013 , author =

    Logarithmic Sobolev inequalities for mollified compactly supported measures , journal =. 2013 , author =

    2013

  7. [7]

    2001 , author =

    Hypercontractivity of Hamilton–Jacobi equations , journal =. 2001 , author =

    2001

  8. [8]

    Proceedings of The 25th International Conference on Artificial Intelligence and Statistics , pages =

    Convergence of Langevin Monte Carlo in Chi-Squared and Rényi Divergence , author =. Proceedings of The 25th International Conference on Artificial Intelligence and Statistics , pages =. 2022 , editor =

    2022

Show all 267 references
  1. [9]

    Forty-second International Conference on Machine Learning , year=

    Beyond Log-Concavity and Score Regularity: Improved Convergence Bounds for Score-Based Generative Models in W2-distance , author=. Forty-second International Conference on Machine Learning , year=

  2. [10]

    Generative Modeling by Estimating Gradients of the Data Distribution , volume =

    Song, Yang and Ermon, Stefano , booktitle =. Generative Modeling by Estimating Gradients of the Data Distribution , volume =

  3. [11]

    1983 , url=

    Partial Differential Equations of Parabolic Type , author=. 1983 , url=

    1983

  4. [12]

    Transactions on Machine Learning Research , year=

    An analysis of the noise schedule for score-based generative models , author=. Transactions on Machine Learning Research , year=

  5. [13]

    Annals of Mathematics , year=

    Note on the Derivatives with Respect to a Parameter of the Solutions of a System of Differential Equations , author=. Annals of Mathematics , year=

  6. [14]

    Train Faster, Generalize Better:

    Hardt, Moritz and Recht, Benjamin and Singer, Yoram , year =. Train Faster, Generalize Better:. 1509.01240 , primaryclass =

    arXiv

  7. [15]

    Holley, Richard and Stroock, Daniel , year =

  8. [16]

    2001 , author =

    Logarithmic Sobolev inequalities for some nonlinear PDE's , journal =. 2001 , author =

    2001

  9. [17]

    2024 , HAL_ID =

    Monmarch. 2024 , HAL_ID =

    2024

  10. [18]

    2002 , journal =

    Stability and Generalization , author =. 2002 , journal =

    2002

  11. [19]

    2025 , eprint=

    Wasserstein Bounds for generative diffusion models with Gaussian tail targets , author=. 2025 , eprint=

    2025

  12. [20]

    Diffusion Schr\"

    De Bortoli, Valentin and Thornton, James and Heng, Jeremy and Doucet, Arnaud , booktitle =. Diffusion Schr\"

  13. [21]

    Transactions on Machine Learning Research , year=

    On diffusion-based generative models and their error bounds: The log-concave case with full convergence estimates , author=. Transactions on Machine Learning Research , year=

  14. [22]

    2025 , eprint=

    Rate of convergence of the smoothed empirical Wasserstein distance , author=. 2025 , eprint=

    2025

  15. [23]

    Proceedings of the 38th International Conference on Machine Learning , pages =

    Smooth p -Wasserstein Distance: Structure, Empirical Approximation, and Statistical Applications , author =. Proceedings of the 38th International Conference on Machine Learning , pages =. 2021 , editor =

    2021

  16. [24]

    Proceedings of Thirty Fifth Conference on Learning Theory , pages =

    Improved analysis for a proximal algorithm for sampling , author =. Proceedings of Thirty Fifth Conference on Learning Theory , pages =. 2022 , editor =

    2022

  17. [25]

    The Eleventh International Conference on Learning Representations , year=

    Fast Sampling of Diffusion Models with Exponential Integrator , author=. The Eleventh International Conference on Learning Representations , year=

  18. [26]

    1982 , author =

    Reverse-time diffusion equation models , journal =. 1982 , author =

    1982

  19. [27]

    Proceedings of the 41st International Conference on Machine Learning , pages =

    Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions , author =. Proceedings of the 41st International Conference on Machine Learning , pages =. 2024 , editor =

    2024

  20. [28]

    2023 , volume =

    Mbacke, Sokhna Diarra and Clerc, Florence and Germain, Pascal , booktitle =. 2023 , volume =

    2023

  21. [29]

    Advances in Neural Information Processing Systems , year=

    Maximum Likelihood Training of Score-Based Diffusion Models , author=. Advances in Neural Information Processing Systems , year=

  22. [30]

    Statistical Guarantees for Variational Autoencoders using

    Sokhna Diarra Mbacke and Florence Clerc and Pascal Germain , booktitle=. Statistical Guarantees for Variational Autoencoders using. 2023 , url=

    2023

  23. [31]

    Proceedings of Thirty Seventh Conference on Learning Theory , pages =

    Optimal score estimation via empirical Bayes smoothing , author =. Proceedings of Thirty Seventh Conference on Learning Theory , pages =. 2024 , editor =

    2024

  24. [32]

    2024 , eprint=

    From optimal score matching to optimal sampling , author=. 2024 , eprint=

    2024

  25. [33]

    Proceedings of the 40th International Conference on Machine Learning , pages =

    Improved Analysis of Score-based Generative Modeling: User-Friendly Bounds under Minimal Smoothness Assumptions , author =. Proceedings of the 40th International Conference on Machine Learning , pages =. 2023 , volume =

    2023

  26. [34]

    2023 , eprint=

    Score Approximation, Estimation and Distribution Recovery of Diffusion Models on Low-Dimensional Data , author=. 2023 , eprint=

    2023

  27. [35]

    Huang, Chin-Wei and Lim, Jae Hyun and Courville, Aaron C , year =. A. Advances in

  28. [36]

    Score-Based

    Vahdat, Arash and Kreis, Karsten and Kautz, Jan , year =. Score-Based. Advances in

  29. [37]

    Advances in Neural Information Processing Systems , year=

    Convergence for score-based generative modeling with polynomial complexity , author=. Advances in Neural Information Processing Systems , year=

  30. [38]

    2022 , eprint=

    Convergence of score-based generative modeling for general data distributions , author=. 2022 , eprint=

    2022

  31. [39]

    Bogachev, V. I. and Rockner, M. and Shaposhnikov, S. V. , year =. Global. Theory of Probability & Its Applications , volume =

  32. [40]

    Advances in Neural Information Processing Systems , editor=

    Score-Based Generative Models Detect Manifolds , author=. Advances in Neural Information Processing Systems , editor=

  33. [41]

    Transactions on Machine Learning Research , year=

    Convergence of denoising diffusion models under the manifold hypothesis , author=. Transactions on Machine Learning Research , year=

  34. [42]

    2017 , eprint=

    Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance , author=. 2017 , eprint=

    2017

  35. [43]

    Proceedings of the American Mat hematical Society , volume=

    The minimal spanning tree and the upper box dimension , author=. Proceedings of the American Mat hematical Society , volume=

  36. [44]

    2024 , eprint=

    Diffusion Models: A Comprehensive Survey of Methods and Applications , author=. 2024 , eprint=

    2024

  37. [45]

    Statistics and Computing , volume=

    Quantitative bounds of convergence for geometrically ergodic Markov chain in the Wasserstein distance with application to the Metropolis adjusted Langevin algorithm , author=. Statistics and Computing , volume=. 2015 , publisher=

    2015

  38. [46]

    2008 , journal =

    Collet, Jean-Fran. 2008 , journal =

    2008

  39. [47]

    Understanding

    Luo, Calvin , year =. Understanding. doi:10.48550/arXiv.2208.11970 , urldate =. arXiv , keywords =:2208.11970 , primaryclass =

    doi arXiv

  40. [48]

    Diffusion Models Beat GANs on Image Synthesis , volume =

    Dhariwal, Prafulla and Nichol, Alexander , booktitle =. Diffusion Models Beat GANs on Image Synthesis , volume =

  41. [49]

    2017 , eprint=

    Adam: A Method for Stochastic Optimization , author=. 2017 , eprint=

    2017

  42. [50]

    Interpretation and

    Lyu, Siwei , year =. Interpretation and. ArXiv , urldate =

  43. [51]

    Divergence measures and message passing , author=

  44. [52]

    Li, Yingzhen and Turner, Richard E , year =. R. Advances in

  45. [53]

    Understanding

    Kingma, Diederik and Gao, Ruiqi , year =. Understanding. Advances in Neural Information Processing Systems , volume =

  46. [54]

    and Juergens, David and Bennett, Nathaniel R

    Watson, Joseph L. and Juergens, David and Bennett, Nathaniel R. and Trippe, Brian L. and Yim, Jason and Eisenach, Helen E. and Ahern, Woody and Borst, Andrew J. and Ragotte, Robert J. and Milles, Lukas F. and Wicky, Basile I. M. and Hanikel, Nikita and Pellock, Samuel J. and C...

    2023 doi

  47. [55]

    2023 , eprint=

    Convergence of the Inexact Langevin Algorithm and Score-based Generative Models in KL Divergence , author=. 2023 , eprint=

    2023

  48. [56]

    The Twelfth International Conference on Learning Representations , year=

    Neural Network-Based Score Estimation in Diffusion Models: Optimization and Generalization , author=. The Twelfth International Conference on Learning Representations , year=

  49. [57]

    2024 , eprint=

    A Good Score Does not Lead to A Good Generative Model , author=. 2024 , eprint=

    2024

  50. [58]

    Proceedings of Thirty Eighth Conference on Learning Theory , pages =

    Linear Convergence of Diffusion Models Under the Manifold Hypothesis , author =. Proceedings of Thirty Eighth Conference on Learning Theory , pages =. 2025 , editor =

    2025

  51. [59]

    and Shiryaev, Albert N

    Liptser, Robert S. and Shiryaev, Albert N. , year =. Statistics of. doi:10.1007/978-3-662-13043-8 , urldate =

    doi

  52. [60]

    Transactions of the American Mathematical Society , year=

    Quantitative Harris-type theorems for diffusions and McKean–Vlasov processes , author=. Transactions of the American Mathematical Society , year=

  53. [61]

    Convergence to Equilibrium in

    Bolley, Fran. Convergence to Equilibrium in. 2012 , journal =

    2012

  54. [62]

    Donsker, M. D. and Varadhan, S. R. S. , title =. Comm. Pure Appl. Math. , fjournal =

  55. [63]

    Fokker--

    Bogachev, Vladimir and Krylov, Nicolai and R. Fokker--. 2015 , series =

    2015

  56. [64]

    and Sturm, Karl-Theodor , year =

    Von Renesse, Max-K. and Sturm, Karl-Theodor , year =. Transport Inequalities, Gradient Estimates, Entropy and. Communications on Pure and Applied Mathematics , volume =

  57. [65]

    Lindvall, Torgny and Rogers, L. C. G. , year =. Coupling of. The Annals of Probability , volume =

  58. [66]

    Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability, 1954–1955 , volume =

    Kac, Mark , title =. Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability, 1954–1955 , volume =. 1956 , publisher =

    1954

  59. [67]

    Proceedings of the 40th International Conference on Machine Learning , pages =

    Diffusion Models are Minimax Optimal Distribution Estimators , author =. Proceedings of the 40th International Conference on Machine Learning , pages =. 2023 , volume =

    2023

  60. [68]

    Bogachev, V. I. and R. Distances between Transition Probabilities of Diffusions and Applications to Nonlinear. 2016 , journal =

    2016

  61. [69]

    Logarithmic

    Gentil, Ivan and Imbert, Cyril , year =. Logarithmic. Asymptotic analysis , eprint =

  62. [70]

    Continuous

    Revuz, Daniel and Yor, Marc , year =. Continuous

  63. [71]

    2023 , eprint=

    Privacy Risk for anisotropic Langevin dynamics using relative entropy bounds , author=. 2023 , eprint=

    2023

  64. [72]

    Convergence of Smoothed Empirical Measures With Applications to Entropy Estimation , year=

    Goldfeld, Ziv and Greenewald, Kristjan and Niles-Weed, Jonathan and Polyanskiy, Yury , journal=. Convergence of Smoothed Empirical Measures With Applications to Entropy Estimation , year=

  65. [73]

    2023 , eprint=

    Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions , author=. 2023 , eprint=

    2023

  66. [74]

    The Fokker–Planck Equation: Methods of Solution and Applications , author =

  67. [75]

    2020 , MONTH = Oct, HAL_ID =

    Durmus, Alain and Eberle, Andreas and Guillin, Arnaud and Zimmer, Raphael , JOURNAL =. 2020 , MONTH = Oct, HAL_ID =

    2020

  68. [76]

    Eberle, Andreas , title =. Probab. Theory Relat. Fields , volume =

  69. [77]

    2024 , eprint=

    Convergence of Diffusion Models Under the Manifold Hypothesis in High-Dimensions , author=. 2024 , eprint=

    2024

  70. [78]

    Logarithmic Sobolev Inequalities Essentials , author =

  71. [79]

    Optimal Transport -

    Villani, C. Optimal Transport -. 2009 , publisher =

    2009

  72. [80]

    Analysis and

    Bakry, Dominique and Gentil, Ivan and Ledoux, Michel , year =. Analysis and

  73. [81]

    The Twelfth International Conference on Learning Representations , year=

    Nearly d-Linear Convergence Bounds for Diffusion Models via Stochastic Localization , author=. The Twelfth International Conference on Learning Representations , year=

  74. [82]

    and Villani, C

    Otto, F. and Villani, C. , year =. Generalization of an. Journal of Functional Analysis , volume =

  75. [83]

    The Twelfth International Conference on Learning Representations , year=

    Score-based generative models break the curse of dimensionality in learning a family of sub-Gaussian distributions , author=. The Twelfth International Conference on Learning Representations , year=

  76. [84]

    2023 , eprint=

    On the Generalization of Diffusion Model , author=. 2023 , eprint=

    2023

  77. [85]

    Journal of Machine Learning Research , year =

    Benjamin Dupuis and Paul Viallard and George Deligiannidis and Umut Simsekli , title =. Journal of Machine Learning Research , year =

  78. [86]

    Vincent, Pascal , year =. A. Neural Computation , volume =

  79. [87]

    Proceedings of The 36th International Conference on Algorithmic Learning Theory , pages =

    A PAC-Bayesian Link Between Generalisation and Flat Minima , author =. Proceedings of The 36th International Conference on Algorithmic Learning Theory , pages =. 2025 , series =

    2025

  80. [88]

    International Conference on Machine Learning,

    Shaojie Li and Yong Liu , title =. International Conference on Machine Learning,

  81. [89]

    On the Generalization Properties of Diffusion Models , volume =

    Li, Puheng and Li, Zhong and Zhang, Huishuai and Bian, Jiang , booktitle =. On the Generalization Properties of Diffusion Models , volume =

  82. [90]

    O(d/T) Convergence Theory for Diffusion Probabilistic Models under Minimal Assumptions , author=

  83. [91]

    Generalization in

    Qi CHEN and Jierui Zhu and Florian Shkurti , booktitle=. Generalization in

  84. [92]

    2025 , eprint=

    Generalisation under gradient descent via deterministic PAC-Bayes , author=. 2025 , eprint=

    2025

  85. [93]

    Understanding Generalizability of Diffusion Models Requires Rethinking the Hidden Gaussian Structure , volume =

    Li, Xiang and Dai, Yixiang and Qu, Qing , booktitle =. Understanding Generalizability of Diffusion Models Requires Rethinking the Hidden Gaussian Structure , volume =

  86. [94]

    The Twelfth International Conference on Learning Representations , year=

    Generalization in diffusion models arises from geometry-adaptive harmonic representations , author=. The Twelfth International Conference on Learning Representations , year=

  87. [95]

    JMLR , year =

    Pierre Alquier and James Ridgway and Nicolas Chopin , title =. JMLR , year =

  88. [96]

    Foundations and Trends® in Machine Learning , year =

    Pierre Alquier , title =. Foundations and Trends® in Machine Learning , year =

  89. [97]

    Advances in Neural Information Processing Systems (NIPS) , year =

    Amiran Ambroladze and Emilio Parrado. Advances in Neural Information Processing Systems (NIPS) , year =

  90. [98]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Idan Amir and Roi Livni and Nati Srebro , title =. Advances in Neural Information Processing Systems (NeurIPS) , year =

  91. [99]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Ron Amit and Baruch Epstein and Shay Moran and Ron Meir , title =. Advances in Neural Information Processing Systems (NeurIPS) , year =

  92. [100]

    ICML 2023 Workshop on Topological, Algebraic and Geometric Learning , year =

    Rayna Andreeva and Katharina Limbeck and Bastian Rieck and Rik Sarkar , title =. ICML 2023 Workshop on Topological, Algebraic and Geometric Learning , year =

    2023

  93. [101]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Rayna Andreeva and Benjamin Dupuis and Rik Sarkar and Tolga Birdal and Umut. Advances in Neural Information Processing Systems (NeurIPS) , year =

  94. [102]

    arXiv , volume =

    David Aristoff , title =. arXiv , volume =

  95. [103]

    arXiv , volume =

    Pranjal Awasthi and Natalie Frank and Mehryar Mohri , title =. arXiv , volume =

  96. [104]

    Machine Learning , year =

    Peter Bartlett and St. Machine Learning , year =

  97. [105]

    Journal of Machine Learning Research , year =

    Peter Bartlett and Shahar Mendelson , title =. Journal of Machine Learning Research , year =

  98. [106]

    Advances in Neural Information Processing Systems (NIPS) , year =

    Peter Bartlett and Dylan Foster and Matus Telgarsky , title =. Advances in Neural Information Processing Systems (NIPS) , year =

  99. [107]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Tolga Birdal and Aaron Lou and Leonidas Guibas and Umut. Advances in Neural Information Processing Systems (NeurIPS) , year =

  100. [108]

    Conference on Learning Theory (COLT) , year =

    Gilles Blanchard and Fran. Conference on Learning Theory (COLT) , year =

  101. [109]

    Vladimir Bogachev , title =

  102. [110]

    Jean-Daniel Boissonnat and Fr

  103. [111]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Alexander Camuto and George Deligiannidis and Murat Erdogdu and Mert G. Advances in Neural Information Processing Systems (NeurIPS) , year =

  104. [112]

    Olivier Catoni , title =

  105. [113]

    Journal of Machine Learning Research , year =

    Ben Chugg and Hongjian Wang and Aaditya Ramdas , title =. Journal of Machine Learning Research , year =

  106. [114]

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

    Arnak Dalalyan , title =. Journal of the Royal Statistical Society Series B: Statistical Methodology , year =

  107. [115]

    International Conference on Machine Learning (ICML) , year =

    Benjamin Dupuis and Umut Simsekli , title =. International Conference on Machine Learning (ICML) , year =

  108. [116]

    Generalization of noisy

    Leello Tadesse Dadi and Volkan Cevher , year=. Generalization of noisy

  109. [117]

    NeurIPS 2023 Workshop Heavy Tails in Machine Learning , year =

    Benjamin Dupuis and Paul Viallard , title =. NeurIPS 2023 Workshop Heavy Tails in Machine Learning , year =

    2023

  110. [118]

    Advances in Mathematics , volume=

    Fractal dimension and the persistent homology of random geometric complexes , author=. Advances in Mathematics , volume=. 2020 , publisher=

    2020

  111. [119]

    International Conference on Machine Learning (ICML) , year =

    Benjamin Dupuis and George Deligiannidis and Umut Simsekli , title =. International Conference on Machine Learning (ICML) , year =

  112. [120]

    Documenta mathematica

    Tom Leinster. Documenta mathematica. 2013

    2013

  113. [121]

    Advances in Neural Information Processing Systems (NIPS) , year =

    Cynthia Dwork and Vitaly Feldman and Moritz Hardt and Toniann Pitassi and Omer Reingold and Aaron Roth , title =. Advances in Neural Information Processing Systems (NIPS) , year =

  114. [122]

    Conference on Uncertainty in Artificial Intelligence (UAI) , year =

    Gintare Karolina Dziugaite and Daniel Roy , title =. Conference on Uncertainty in Artificial Intelligence (UAI) , year =

  115. [123]

    Roy , title =

    Gintare Karolina Dziugaite and Daniel M. Roy , title =. Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3-8, 2018, Montr

    2018

  116. [124]

    2015 , Bdsk-Url-1 =

    Dwork, Cynthia and Feldman, Vitaly and Hardt, Moritz and Pitassi, Toni and Reingold, Omer and Roth, Aaron , booktitle =. 2015 , Bdsk-Url-1 =

    2015

  117. [125]

    Kenneth Falconer , title =

  118. [126]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Tyler Farghly and Patrick Rebeschini , title =. Advances in Neural Information Processing Systems (NeurIPS) , year =

  119. [127]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Dylan Foster and Spencer Greenberg and Satyen Kale and Haipeng Luo and Mehryar Mohri and Karthik Sridharan , title =. Advances in Neural Information Processing Systems (NeurIPS) , year =

  120. [128]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Futoshi Futami and Masahiro Fujisawa , title =. Advances in Neural Information Processing Systems (NeurIPS) , year =

  121. [129]

    CoRR , year =

    Bolin Gao and Lacra Pavel , title =. CoRR , year =

  122. [130]

    International Conference on Machine Learning (ICML) , year =

    Pascal Germain and Alexandre Lacasse and Fran. International Conference on Machine Learning (ICML) , year =

  123. [131]

    Journal of Machine Learning Research , year =

    Pascal Germain and Alexandre Lacasse and Fran. Journal of Machine Learning Research , year =

  124. [132]

    Peter D. Gr. Algorithmic Learning Theory (ALT) , year =

  125. [133]

    International Conference on Machine Learning (ICML) , year =

    Mert G. International Conference on Machine Learning (ICML) , year =

  126. [134]

    Maxime Haddouche and Benjamin Guedj , journal =

  127. [135]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Mahdi Haghifam and Jeffrey Negrea and Ashish Khisti and Daniel Roy and Gintare Karolina Dziugaite , title =. Advances in Neural Information Processing Systems (NeurIPS) , year =

  128. [136]

    Advances in Neural Information Processing Systems (NIPS) , year =

    Ralf Herbrich and Thore Graepel , title =. Advances in Neural Information Processing Systems (NIPS) , year =

  129. [137]

    International Conference on Machine Learning (ICML) , year =

    Liam Hodgkinson and Umut. International Conference on Machine Learning (ICML) , year =

  130. [138]

    Advances in Neural Information Processing Systems (NIPS) , year =

    Sham Kakade and Karthik Sridharan and Ambuj Tewari , title =. Advances in Neural Information Processing Systems (NIPS) , year =

  131. [139]

    IEEE Transactions on Information Theory , year =

    Vladimir Koltchinskii , title =. IEEE Transactions on Information Theory , year =

  132. [140]

    arXiv , volume =

    Vladimir Koltchinskii and Dmitriy Panchenko , title =. arXiv , volume =

  133. [141]

    The Annals of Statistics , year =

    Vladimir Koltchinskii and Dmitry Panchenko , title =. The Annals of Statistics , year =

  134. [142]

    Advances in Neural Information Processing Systems (NIPS) , year =

    Alexandre Lacasse and Fran. Advances in Neural Information Processing Systems (NIPS) , year =

  135. [143]

    Journal of Machine Learning Research , year =

    John Langford , title =. Journal of Machine Learning Research , year =

  136. [144]

    Advances in Neural Information Processing Systems (NIPS) , year =

    John Langford and Rich Caruana , title =. Advances in Neural Information Processing Systems (NIPS) , year =

  137. [145]

    Advances in Neural Information Processing Systems (NIPS) , year =

    John Langford and John Shawe. Advances in Neural Information Processing Systems (NIPS) , year =

  138. [146]

    International Conference on Learning Representations (ICLR) , year =

    Jian Li and Xuanyuan Luo and Mingda Qiao , title =. International Conference on Learning Representations (ICLR) , year =

  139. [147]

    Advances in Neural Information Processing Systems (NIPS) , year =

    Ben London , title =. Advances in Neural Information Processing Systems (NIPS) , year =

  140. [148]

    John Mackay and Jeremy Tyson , title =

  141. [149]

    Pertti Mattila , title =

  142. [150]

    arXiv , volume =

    Andreas Maurer , title =. arXiv , volume =

  143. [151]

    Conference on Computational Learning Theory (COLT) , year =

    David McAllester , title =. Conference on Computational Learning Theory (COLT) , year =

  144. [152]

    Machine Learning , year =

    David McAllester , title =. Machine Learning , year =

  145. [153]

    Probabilistic methods for algorithmic discrete mathematics , publisher =

    Colin McDiarmid , title =. Probabilistic methods for algorithmic discrete mathematics , publisher =

  146. [154]

    2007 , organization=

    McSherry, Frank and Talwar, Kunal , booktitle=. 2007 , organization=

    2007

  147. [155]

    Mehryar Mohri and Afshin Rostamizadeh and Ameet Talwalkar , title =

  148. [156]

    Ilya Molchanov , title =

  149. [157]

    Conference On Learning Theory (COLT) , year =

    Wenlong Mou and Liwei Wang and Xiyu Zhai and Kai Zheng , title =. Conference On Learning Theory (COLT) , year =

  150. [158]

    Zico Kolter , title =

    Vaishnavh Nagarajan and J. Zico Kolter , title =. Advances in Neural Information Processing Systems (NeurIPS) , year =

  151. [159]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Jeffrey Negrea and Mahdi Haghifam and Gintare Karolina Dziugaite and Ashish Khisti and Daniel Roy , title =. Advances in Neural Information Processing Systems (NeurIPS) , year =

  152. [160]

    Conference on Learning Theory (COLT) , year =

    Gergely Neu and Gintare Karolina Dziugaite and Mahdi Haghifam and Daniel Roy , title =. Conference on Learning Theory (COLT) , year =

  153. [161]

    Conference on Learning Theory (COLT) , year =

    Behnam Neyshabur and Ryota Tomioka and Nathan Srebro , title =. Conference on Learning Theory (COLT) , year =

  154. [162]

    Journal of Machine Learning Research , year =

    Emilio Parrado. Journal of Machine Learning Research , year =

  155. [163]

    IEEE International Symposium on Information Theory (ISIT) , year =

    Ankit Pensia and Varun Jog and Po-Ling Loh , title =. IEEE International Symposium on Information Theory (ISIT) , year =

  156. [164]

    Conference on Learning Theory (COLT) , year =

    Maxim Raginsky and Alexander Rakhlin and Matus Telgarsky , title =. Conference on Learning Theory (COLT) , year =

  157. [165]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Omar Rivasplata and Ilja Kuzborskij and Csaba Szepesv. Advances in Neural Information Processing Systems (NeurIPS) , year =

  158. [166]

    Rogers, Ryan and Roth, Aaron and Smith, Adam and Thakkar, Om , title =

  159. [167]

    Conference on Learning Theory (COLT) , year =

    Sarah Sachs and Tim van Erven and Liam Hodgkinson and Rajiv Khanna and Umut. Conference on Learning Theory (COLT) , year =

  160. [168]

    Conference on Computational Learning Theory (COLT) , year =

    John Shawe. Conference on Computational Learning Theory (COLT) , year =

  161. [169]

    International Conference on Machine Learning (ICML) , year =

    Umut. International Conference on Machine Learning (ICML) , year =

  162. [170]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Umut Simsekli and Ozan Sener and George Deligiannidis and Murat Erdogdu , title =. Advances in Neural Information Processing Systems (NeurIPS) , year =

  163. [171]

    Proceedings of The 33rd International Conference on Machine Learning , pages =

    A Variational Analysis of Stochastic Gradient Algorithms , author =. Proceedings of The 33rd International Conference on Machine Learning , pages =. 2016 , editor =

    2016

  164. [172]

    , booktitle =

    Schaipp, Fabian and Ohana, Ruben and Eickenberg, Michael and Defazio, Aaron and Gower, Robert M. , booktitle =. 2024 , editor =

    2024

  165. [173]

    Conference on Learning Theory (COLT) , year =

    Thomas Steinke and Lydia Zakynthinou , title =. Conference on Learning Theory (COLT) , year =

  166. [174]

    IEEE Transactions on Information Theory , year =

    Tim. IEEE Transactions on Information Theory , year =

  167. [175]

    Doklady Akademii Nauk USSR , year =

    Vladimir Vapnik and Alexey Chervonenkis , title =. Doklady Akademii Nauk USSR , year =

  168. [176]

    Theory of Probability and its Applications , year =

    Vladimir Vapnik and Alexey Chervonenkis , title =. Theory of Probability and its Applications , year =

  169. [177]

    Roman Vershynin , title =

  170. [178]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Paul Viallard and Maxime Haddouche and Umut. Advances in Neural Information Processing Systems (NeurIPS) , year =

  171. [179]

    Machine Learning , year =

    Paul Viallard and Pascal Germain and Amaury Habrard and Emilie Morvant , title =. Machine Learning , year =

  172. [180]

    arXiv , volume =

    Paul Viallard and Maxime Haddouche and Umut. arXiv , volume =

  173. [181]

    Bayesian Learning via Stochastic Gradient Langevin Dynamics , booktitle =

    Max Welling and Yee Whye Teh , editor =. Bayesian Learning via Stochastic Gradient Langevin Dynamics , booktitle =

  174. [182]

    Advances in Neural Information Processing Systems (NIPS 2017) , year =

    Aolin Xu and Maxim Raginsky , title =. Advances in Neural Information Processing Systems (NIPS 2017) , year =

    2017

  175. [183]

    Roy , title =

    Jun Yang and Shengyang Sun and Daniel M. Roy , title =. Advances in Neural Information Processing Systems (NeurIPS) , year =

  176. [184]

    Yiming Ying , title =

  177. [185]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Valentina Zantedeschi and Paul Viallard and Emilie Morvant and R. Advances in Neural Information Processing Systems (NeurIPS) , year =

  178. [186]

    International Conference on Learning Representations (ICLR) , year =

    Chiyuan Zhang and Samy Bengio and Moritz Hardt and Benjamin Recht and Oriol Vinyals , title =. International Conference on Learning Representations (ICLR) , year =

  179. [187]

    Communications of the ACM , year =

    Chiyuan Zhang and Samy Bengio and Moritz Hardt and Benjamin Recht and Oriol Vinyals , title =. Communications of the ACM , year =

  180. [188]

    SIAM Journal on Mathematics of Data Science , volume=

    KL convergence guarantees for score diffusion models under minimal data assumptions , author=. SIAM Journal on Mathematics of Data Science , volume=. 2025 , publisher=

    2025

  181. [189]

    arXiv preprint arXiv:2310.18455 , year=

    Approximate heavy tails in offline (multi-pass) stochastic gradient descent , author=. arXiv preprint arXiv:2310.18455 , year=

    arXiv

  182. [190]

    Potential Analysis , volume=

    Magnitude, diversity, capacities, and dimensions of metric spaces , author=. Potential Analysis , volume=. 2015 , publisher=

    2015

  183. [191]

    and Bottou, L

    Lecun, Y. and Bottou, L. and Bengio, Y. and Haffner, P. , journal=. Gradient-based learning applied to document recognition , year=

  184. [192]

    Logarithmic sobolev inequalities essentials , year=

    Djalil Chafai and Joseph Lehec , url=. Logarithmic sobolev inequalities essentials , year=

  185. [193]

    Learning Models for Object Recognition from Natural Language Descriptions

    Josiah Wang and Katja Markert and Mark Everingham. Learning Models for Object Recognition from Natural Language Descriptions. Proceedings of the British Machine Vision Conference. 2009

    2009

  186. [194]

    International Conference on Learning Representations , year=

    Progressive Distillation for Fast Sampling of Diffusion Models , author=. International Conference on Learning Representations , year=

  187. [195]

    Denoising Diffusion Probabilistic Models , volume =

    Ho, Jonathan and Jain, Ajay and Abbeel, Pieter , booktitle =. Denoising Diffusion Probabilistic Models , volume =

  188. [196]

    International Conference on Learning Representations , year=

    Decoupled Weight Decay Regularization , author=. International Conference on Learning Representations , year=

  189. [197]

    Beyond the Triangle:

    Umarov, Sabir and Hahn, Marjorie and Kobayashi, Kei , year =. Beyond the Triangle:

  190. [198]

    An entropy approach to the time reversal of diffusion processes

    F \"o llmer, H. An entropy approach to the time reversal of diffusion processes. Stochastic Differential Systems Filtering and Control. 1985

    1985

  191. [199]

    Nonlinear

    Barbu, Viorel and R. Nonlinear. 2024 , series =

    2024

  192. [200]

    , year =

    Pavliotis, Grigorios A. , year =. Stochastic

  193. [201]

    Rényi Differential Privacy for Heavy-Tailed

    Benjamin Dupuis and Mert Gürbüzbalaban and Umut Simsekli and Jian Wang and Sinan Yildirim and Lingjiong Zhu , year=. Rényi Differential Privacy for Heavy-Tailed

  194. [202]

    2026 , eprint=

    Generalization Bounds for Markov Algorithms through Entropy Flow Computations , author=. 2026 , eprint=

    2026

  195. [203]

    and Li, Xue-Mei and Madiman, M

    Gozlan, N. and Li, Xue-Mei and Madiman, M. and Roberto, C. and Samson, P.-M. , year =. Log-. Potential Analysis , volume =

  196. [204]

    Differential

    Chourasia, Rishav and Ye, Jiayuan and Shokri, Reza , year =. Differential. Advances in

  197. [205]

    1959 , author =

    Some inequalities satisfied by the quantities of information of Fisher and Shannon , journal =. 1959 , author =

    1959

  198. [206]

    Logarithmic

    Gross, Leonard , year =. Logarithmic. American Journal of Mathematics , volume =. 2373688 , eprinttype =

  199. [207]

    Durmus, Alain and Moulines,

  200. [208]

    Variational Diffusion Models , volume =

    Kingma, Diederik and Salimans, Tim and Poole, Ben and Ho, Jonathan , booktitle =. Variational Diffusion Models , volume =

  201. [209]

    International Conference on Learning Representations , year=

    Score-Based Generative Modeling through Stochastic Differential Equations , author=. International Conference on Learning Representations , year=

  202. [210]

    GitHub Repository , howpublished =

    Laszuk, Dawid , title =. GitHub Repository , howpublished =. 2017 , publisher =

    2017

  203. [211]

    2017 , pages=

    Martin Heusel and Hubert Ramsauer and Thomas Unterthiner and Bernhard Nessler and Sepp Hochreiter , title=. 2017 , pages=

    2017

  204. [212]

    Forsyth , title=

    Min Jin Chong and David A. Forsyth , title=. CoRR , volume=. 2019 , cdate=

    2019

  205. [213]

    Attention is All you Need , url =

    Vaswani, Ashish and Shazeer, Noam and Parmar, Niki and Uszkoreit, Jakob and Jones, Llion and Gomez, Aidan N and Kaiser, ukasz and Polosukhin, Illia , booktitle =. Attention is All you Need , url =

  206. [214]

    Advances in Neural Information Processing Systems , year=

    Elucidating the Design Space of Diffusion-Based Generative Models , author=. Advances in Neural Information Processing Systems , year=

  207. [215]

    Forty-first International Conference on Machine Learning , year=

    Scaling Rectified Flow Transformers for High-Resolution Image Synthesis , author=. Forty-first International Conference on Machine Learning , year=

  208. [216]

    The Annals of Probability , volume=

    Time Reversal of Diffusions , author=. The Annals of Probability , volume=. 1986 , publisher=

    1986

  209. [217]

    Learning Multiple Layers of Features from Tiny Images , author=

  210. [218]

    Estimation of Non-Normalized Statistical Models by Score Matching , journal =

    Aapo Hyv. Estimation of Non-Normalized Statistical Models by Score Matching , journal =. 2005 , volume =

    2005

  211. [219]

    Tweedie's Formula and Selection Bias , urldate =

    Bradley Efron , journal =. Tweedie's Formula and Selection Bias , urldate =

  212. [220]

    Implicit Regularisation in Diffusion Models: An Algorithm-Dependent Generalisation Analysis

    Farghly, Tyler and Rebeschini, Patrick and Deligiannidis, George and Doucet, Arnaud. Implicit Regularisation in Diffusion Models: An Algorithm-Dependent Generalisation Analysis. The Fourteenth International Conference on Learning Representations

  213. [221]

    NeurIPS 2021 Workshop on Deep Generative Models and Downstream Applications , year=

    Classifier-Free Diffusion Guidance , author=. NeurIPS 2021 Workshop on Deep Generative Models and Downstream Applications , year=

    2021

  214. [222]

    2024 , cdate=

    Tero Karras and Miika Aittala and Jaakko Lehtinen and Janne Hellsten and Timo Aila and Samuli Laine , title=. 2024 , cdate=

    2024

  215. [223]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month =

    Rombach, Robin and Blattmann, Andreas and Lorenz, Dominik and Esser, Patrick and Ommer, Bj\"orn , title =. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month =. 2022 , pages =

    2022

  216. [224]

    Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , year =

    Maria-Elena Nilsback and Andrew Zisserman , title =. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , year =

  217. [225]

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

    Benton, Joe and Shi, Yuyang and De Bortoli, Valentin and Deligiannidis, George and Doucet, Arnaud , title =. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume =. 2024 , month =

    2024

  218. [226]

    2022 , eprint=

    Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow , author=. 2022 , eprint=

    2022

  219. [227]

    2022 , eprint=

    A Continuous Time Framework for Discrete Denoising Models , author=. 2022 , eprint=

    2022

  220. [228]

    2025 , eprint=

    Discrete Markov Probabilistic Models , author=. 2025 , eprint=

    2025

  221. [229]

    2023 , eprint=

    Non-Denoising Forward-Time Diffusions , author=. 2023 , eprint=

    2023

  222. [230]

    2023 , eprint=

    Flow Matching for Generative Modeling , author=. 2023 , eprint=

    2023

  223. [231]

    2023 , eprint=

    Structured Denoising Diffusion Models in Discrete State-Spaces , author=. 2023 , eprint=

    2023

  224. [232]

    2024 , eprint=

    Discrete Diffusion Modeling by Estimating the Ratios of the Data Distribution , author=. 2024 , eprint=

    2024

  225. [233]

    2025 , eprint=

    Sampling Binary Data by Denoising through Score Functions , author=. 2025 , eprint=

    2025

  226. [234]

    Score-based Generative Models with L\'

    YOON, EUN BI and Park, Keehun and Kim, Sungwoong and Lim, Sungbin , booktitle =. Score-based Generative Models with L\'

  227. [235]

    2025 , eprint=

    Generative modelling with jump-diffusions , author=. 2025 , eprint=

    2025

  228. [236]

    2024 , eprint=

    Piecewise deterministic generative models , author=. 2024 , eprint=

    2024

  229. [237]

    The Thirteenth International Conference on Learning Representations , year=

    Denoising Levy Probabilistic Models , author=. The Thirteenth International Conference on Learning Representations , year=

  230. [238]

    2022 , eprint=

    Heavy-tailed denoising score matching , author=. 2022 , eprint=

    2022

  231. [239]

    Marta Gentiloni-Silveri and Antonio Ocello , year=

  232. [240]

    CoRR , year =

    Ting Chen , title =. CoRR , year =

  233. [241]

    Nguyen and Lingjiong Zhu , title =

    Xuefeng Gao and Hoang M. Nguyen and Lingjiong Zhu , title =. Journal of Machine Learning Research , year =

  234. [242]

    2401.13115 , archivePrefix=

    Wenpin Tang and Hanyang Zhao , year=. 2401.13115 , archivePrefix=

    arXiv

  235. [243]

    Nikiforos Mimikos. Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, NeurIPS 2024, Vancouver, BC, Canada, December 10 - 15, 2024 , year =

    2024

  236. [244]

    Millet and D

    A. Millet and D. Nualart and M. Sanz , title =. The Annals of Probability , number =

  237. [245]

    Uhlenbeck, G. E. and Ornstein, L. S. , title =. Physical Review , volume =

  238. [246]

    Bach , title =

    Eliot Beyler and Francis R. Bach , title =. CoRR , volume =

  239. [247]

    Diffusion Models in Medical Imaging:

    Kazerouni, Amirhossein and Aghdam, Ehsan Khodapanah and Heidari, Moein and Azad, Reza and Fayyaz, Mohsen and Hacihaliloglu, Ilker and Merhof, Dorit , year =. Diffusion Models in Medical Imaging:. Medical Image Analysis , volume =

  240. [248]

    CoRR , volume =

    Quentin Bertrand and Anne Gagneux and Mathurin Massias and R. CoRR , volume =

  241. [249]

    CoRR , volume =

    Giulio Biroli and Tony Bonnaire and Valentin De Bortoli and Marc M. CoRR , volume =. 2024 , url =

    2024

  242. [250]

    Why Diffusion Models Don

    Tony Bonnaire and Rapha. Why Diffusion Models Don. The Thirty-ninth Annual Conference on Neural Information Processing Systems , year=

  243. [251]

    Transactions on Machine Learning Research , year=

    Wasserstein Convergence of Score-based Generative Models under Semiconvexity and Discontinuous Gradients , author=. Transactions on Machine Learning Research , year=

  244. [252]

    ICML 2023 Workshop on Structured Probabilistic Inference

    Diffusion Probabilistic Models Generalize when They Fail to Memorize , author=. ICML 2023 Workshop on Structured Probabilistic Inference. 2023 , url=

    2023

  245. [253]

    Forty-first International Conference on Machine Learning , year=

    The Emergence of Reproducibility and Consistency in Diffusion Models , author=. Forty-first International Conference on Machine Learning , year=

  246. [254]

    Simoncelli and St

    Zahra Kadkhodaie and Florentin Guth and Eero P. Simoncelli and St. The Twelfth International Conference on Learning Representations,

  247. [255]

    Vastola , title =

    John J. Vastola , title =. The Thirteenth International Conference on Learning Representations,

  248. [256]

    Tyler Farghly and Peter Potaptchik and Samuel Howard and George Deligiannidis and Jakiw Pidstrigach , booktitle=

  249. [257]

    Rethinking the Inception Architecture for Computer Vision , year=

    Szegedy, Christian and Vanhoucke, Vincent and Ioffe, Sergey and Shlens, Jon and Wojna, Zbigniew , booktitle=. Rethinking the Inception Architecture for Computer Vision , year=

  250. [258]

    A survey of the Schrödinger problem and some of its connections with optimal transport

    Léonard, Christian. A survey of the Schrödinger problem and some of its connections with optimal transport. Discrete and Continuous Dynamical Systems

  251. [259]

    Probability Surveys , publisher =

    Christian L. Probability Surveys , publisher =

  252. [260]

    Entropies, convexity, and functional inequalities, On -entropies and -Sobolev inequalities

    Chafaï, Djalil. Entropies, convexity, and functional inequalities, On -entropies and -Sobolev inequalities. Kyoto J. Math

  253. [261]

    Gradient estimates for the Schrödinger potentials: convergence to the Brenier map and quantitative stability

    Chiarini, Alberto and Conforti, Giovanni and Greco, Giacomo and Tamanini, Luca. Gradient estimates for the Schrödinger potentials: convergence to the Brenier map and quantitative stability. arXiv [math.PR]

  254. [262]

    U-Net: Convolutional Networks for Biomedical Image Segmentation

    Ronneberger, Olaf and Fischer, Philipp and Brox, Thomas. U-Net: Convolutional Networks for Biomedical Image Segmentation. 2015

    2015

  255. [263]

    Girsanov Theory Under a Finite Entropy Condition

    Léonard, Christian. Girsanov Theory Under a Finite Entropy Condition. Séminaire de Probabilités XLIV

  256. [264]

    Log-concavity and strong log-concavity: A review

    Saumard, Adrien and Wellner, Jon A. Log-concavity and strong log-concavity: A review. Stat. Surv

  257. [265]

    Introduction to entropic optimal transport

    Nutz, Marcel. Introduction to entropic optimal transport. Lecture notes, Columbia University

  258. [266]

    Problème de Schrödinger, inégalités fonctionnelles et transport optimal

    Conforti, Giovanni. Problème de Schrödinger, inégalités fonctionnelles et transport optimal

  259. [267]

    Time reversal of diffusion processes under a finite entropy condition

    Cattiaux, Patrick and Conforti, Giovanni and Gentil, Ivan and Léonard, Christian. Time reversal of diffusion processes under a finite entropy condition. Annales de l'Institut Henri Poincaré, Probabilités et Statistiques

Pith tools

Reviewed July 11, 2026 · model on record in the stance chip above.