The DOI matches its Crossref record; 236 of the 236 references it cites were found in a registry or an index; none of the 245 sources its claims cite is checked for support yet.
Diffusion Models: A Comprehensive Survey of Methods and Applications
Open accessAbstract
Diffusion models have emerged as a powerful new family of deep generative models with record-breaking performance in many applications, including image synthesis, video generation, and molecule design. In this survey, we provide an overview of the rapidly expanding body of work on diffusion models, categorizing the research into three key areas: efficient sampling, improved likelihood estimation, and handling data with special structures. We also discuss the potential for combining diffusion models with other generative models for enhanced results. We further review the wide-ranging applications of diffusion models in fields spanning from computer vision, natural language processing, temporal data modeling, to interdisciplinary applications in other scientific disciplines. This survey aims to provide a contextualized, in-depth look at the state of diffusion models, identifying the key areas of focus and pointing to potential areas for further exploration. Github: https://github.com/YangLing0818/Diffusion-Models-Papers-Survey-Taxonomy
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
This survey organizes diffusion-model research into three core areas—efficient sampling, improved likelihood estimation, and handling data with special structures—and reviews connections to other generative models plus six application domains. It also introduces DDPMs, score-based generative models, and Score SDEs as the main formulations and outlines future research directions.
Key findings
- The paper proposes a taxonomy of diffusion-model advances: efficient sampling, improved likelihood estimation, and methods for data with special structures such as discrete data, invariant structures, and manifold structures.
- Efficient sampling methods are split into learning-free and learning-based approaches; customized ODE solvers such as DPM-solver and exponential integrators can produce high-quality samples in just 10 to 20 iterations, far fewer than the hundreds typically required without accelerated sampling.
- Improved-likelihood methods include noise schedule optimization, reverse variance learning, and exact likelihood computation; Variational Diffusion Models show that noise schedules do not affect the VLB as long as they share the same values at \(R_{\min}\) and \(R_{\max}\), and only affect Monte Carlo estimator variance.
- Applications are grouped into six categories: computer vision, natural language processing, temporal data modeling, multi-modal learning, robust learning, and interdisciplinary applications.
Methods
- Design: a comprehensive survey/overview of diffusion models, not an empirical study with new experiments.
- Data/sample: existing published research literature on diffusion models and related generative models, cited throughout the reference list.
- Main analysis: conceptual and taxonomic synthesis, including a self-contained introduction to DDPMs, SGMs, and Score SDEs, followed by categorized review of methods, connections, applications, and future directions.
Limitations
- Stated: the paper identifies open issues including revisiting assumptions such as complete information erasure in finite time, lack of theoretical understanding for why and when diffusion models work, weaker latent representations than VAEs/GANs, and pitfalls such as dataset bias, improper image generation, and privacy issues.
- Stated: for scene-graph-to-image generation, high-quality paired SG-image datasets are scarce, and leveraging large-scale text-image datasets for augmentation or semantic diffusion priors remains an open problem.
- Evident: the survey does not report a systematic search protocol, inclusion/exclusion criteria, or quantitative meta-analysis, so its coverage is broad but potentially selective.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 of 245 cited sources checked · 0 supported · 0 flagged
None of the sources cited for this claim have been checked yet.
In the paper
“They have broken the long-time dominance of generative adversarial networks (GANs) [71] in the challenging task of image synthesis [54,87,223,228]”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 1 INTRODUCTION
What the sources say
- Not checked yetcites [71]
- Not checked yetcites [54]
- Not checked yetcites [87]
- Not checked yetcites [223]
- Not checked yetcites [228]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesNone of the sources cited for this claim have been checked yet.
In the paper
“Diffusion models [87,218,223,228] have emerged as the new state-of-the-art family of deep generative models.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 1 INTRODUCTION
What the sources say
- Not checked yetcites [87]
- Not checked yetcites [218]
- Not checked yetcites [223]
- Not checked yetcites [228]
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Key to the success of this sampling process is training the reverse Markov chain to match the actual time reversal of the forward Markov chain.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 2.1 Denoising Diffusion Probabilistic Models (DDPMs)
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesNone of the sources cited for this claim have been checked yet.
In the paper
“Numerous methods have been developed to improve diffusion models, either by enhancing empirical performance [165,220,224] or by extending the model capacity from a theoretical perspective [144,145,222,228,279].”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 1 INTRODUCTION
What the sources say
- Not checked yetcites [165]
- Not checked yetcites [220]
- Not checked yetcites [224]
- Not checked yetcites [144]
- Not checked yetcites [145]
- Not checked yetcites [222]
- Not checked yetcites [228]
- Not checked yetcites [279]
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Key to all these approaches is to progressively perturb data with intensifying random noise (called the “diffusion” process), then successively remove noise to generate new data samples.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 1 INTRODUCTION
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Comparing Equation (14) with Equation (10), it is clear that the training objectives of DDPMs and SGMs are equivalent, once we set ϵ θ (x, t ) = -σ t s θ (x, t ).”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 2.2 Score-Based Generative Models (SGMs)
Strength:boosted· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIn the paper
“As observed by Sohl-Dickstein et al. (2015) [218], this Gaussian transition kernel allows us to marginalize the joint distribution in Equation (1) to obtain the analytical form of q(x t | x 0 ) for all t ∈ {0, 1, • • • ,T }.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 2.1 Denoising Diffusion Probabilistic Models (DDPMs)
What the sources say
- Not checked yetcites [218]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesA conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“When ᾱT ≈ 0, x T is almost Gaussian in distribution, so we have q(”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 2.1 Denoising Diffusion Probabilistic Models (DDPMs)
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIn the paper
“Song et al. (2020) [228] prove that the reverse diffusion method is a numerical SDE solver for the reverse-time SDE in Equation (18).”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.1.1 SDE Solvers.
What the sources say
- Not checked yetcites [228]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since the cost of sampling increases proportionally with the number of discretized time steps, many researchers have focused on developing discretization schemes that reduce the number of time steps while also minimizing discretization errors.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.1 Learning-Free Sampling
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclear
- It may state two separate claims as one. 66
- Probably not a substantial claim. 67
None of the sources cited for this claim have been checked yet.
In the paper
“and have also shown potential in a variety of domains, ranging from computer vision [2,11,19,23,88,90,113,115,134,150,160,173,198,200,248,270,271,283,290], natural language processing [6,93,139,205,275], temporal data modeling [1,33,124,191,233,262], multi-modal modeling [7,186,196,199,288], robust machine learning [18,28,112,242,273], to interdisciplinary applications in fields such as computa”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 1 INTRODUCTION
What the sources say
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We clarify how they work under the same principle of diffusion and explain how these three models are connected and can be reduced to one another.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 1 INTRODUCTION
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Ho et al. (2020) [87] propose to reweight various terms in L VLB for better sample quality and noticed an important equivalence between the resulting loss function and the training objective for noise-conditional score networks (NCSNs), one type of score-based generative models, in Song and Ermon (2019) [223].”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 2.1 Denoising Diffusion Probabilistic Models (DDPMs)
What the sources say
- Not checked yetcites [87]
- Not checked yetcites [223]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“This objective reduces to Equation (8) for a particular choice of the weighting function λ(t ), and has the same form as the loss of denoising score matching over multiple noise scales for training score-based generative models [223]”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 2.1 Denoising Diffusion Probabilistic Models (DDPMs)
What the sources say
- Not checked yetcites [223]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Training and sampling are completely decoupled in the formulation of score-based generative models, so one can use a multitude of sampling techniques after the estimation of score functions.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 2.2 Score-Based Generative Models (SGMs)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Both the reverse-time SDE and the probability flow ODE allow sampling from the same data distribution as their trajectories have the same marginals.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 2.3 Stochastic Differential Equations (Score SDEs)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“The added velocity term is reported to improve sampling speed as well as quality.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.1.1 SDE Solvers.
What the sources say
- Not checked yetcites [59]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Noise-Conditional Score Networks (NCSNs) [223] and Critically-Damped Langevin Diffusion (CLD) [59] both solve the reverse-time SDE with inspirations from Langevin dynamics.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.1.1 SDE Solvers.
What the sources say
- Not checked yetcites [223]
- Not checked yetcites [59]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“The forward processes in DDPMs and SGMs are both discretizations of this SDE.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 2.3 Stochastic Differential Equations (Score SDEs)
What the sources say
- Not checked yetcites [228]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Generating samples from diffusion models typically demands iterative approaches that involve a large number of evaluation steps.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3 DIFFUSION MODELS WITH EFFICIENT SAMPLING
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
In the paper
“Inspired by statistical mechanics, CLD proposes an augmented SDE with an auxiliary velocity term resembling underdamped Langevin diffusion.To obtain the time reversal of the extended SDE, CLD only needs to learn the score function of the conditional distribution of velocity given data, arguably easier than learning scores of data directly.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.1.1 SDE Solvers.
What the sources say
- Not checked yetcites [59]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“This process can be applied to any types of forward SDEs, and empirical results indicate this sampler performs slightly better than DDPM [228] for a particular type of SDEs called the VP-SDE.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.1.1 SDE Solvers.
What the sources say
- Not checked yetcites [228]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Subsequent research on diffusion models focuses on improving these classical approaches (DDPMs, SGMs, and Score SDEs) from three major directions: faster and more efficient sampling, more accurate likelihood and density estimation, and handling data with special structures (such as permutation invariance, manifold structures, and discrete data).”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 2.3 Stochastic Differential Equations (Score SDEs)
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Jolicoeur-Martineau et al. (2021) [107] develop an SDE solver with adaptive step sizes for faster generation.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.1.1 SDE Solvers.
What the sources say
- Not checked yetcites [107]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Although the sampling trajectories of ALD are not exact solutions to the reverse-time SDE, they have the correct marginals and hence produce correct samples under the assumption that Langevin dynamics converges to its equilibrium at every noise level.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.1.1 SDE Solvers.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- The authors state this as an assumption: Langevin dynamics converges to its equilibrium at every noise level.
In the paper
“PNDM [142] proposes a pseudo numerical method to generate sample along a specific manifold in R N .It uses numerical solver with nonlinear transfer part to solve differential equation on manifolds and then generates sample, which encapsulates DDIM as a special case.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > Denoising Diffusion Implicit Models (DDIM)
What the sources say
- Not checked yetcites [142]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Karras et al. (2022) [111] further improve the Langevin dynamics corrector in [228] by proposing a Langevin-like “churn” step of adding and removing noise, achieving new state-of-the-art sample quality on datasets like CIFAR-10 [126] and ImageNet-64 [53].”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.1.1 SDE Solvers.
What the sources say
- Not checked yetcites [111]
- Not checked yetcites [228]
- Not checked yetcites [126]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“DDIM learns a Markov chain to reverse this non-Markov perturbation process, which is fully deterministic when σ 2 t = 0.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > Denoising Diffusion Implicit Models (DDIM)
What the sources say
- Not checked yetcites [220]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“It is observed in [111,145,201,220] that the DDIM sampling process amounts to a special discretization scheme of the probability flow ODE.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > Denoising Diffusion Implicit Models (DDIM)
What the sources say
- Not checked yetcites [111]
- Not checked yetcites [145]
- Not checked yetcites [201]
- Not checked yetcites [220]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“The predictor-corrector method proposed in [228] solves the reverse SDE by combining numerical SDE solvers (“predictor”) and iterative Markov chain Monte Carlo (MCMC) approaches (“corrector”).”
- Also stated in: § 3.1.1 SDE Solvers. · plain
“The resulting samples have the same time-marginals as solution trajectories of the reverse-time SDE, i.e., they are equivalent in distribution at all time steps.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.1.1 SDE Solvers.
What the sources say
- Not checked yetcites [228]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- Also stated in: § 3.1.1 SDE Solvers. · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In contrast to SDE solvers, the trajectories of ODE solvers are deterministic and thus not affected by stochastic fluctuations.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.1.2 ODE Solvers.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“Based on truncated Taylor methods, Dockhorn et al. (2022) [60] derive a second-order solver for accelerating synthesis by training an additional head on top of the first-order score network.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.2.1 Optimized Discretization.
What the sources say
- Not checked yetcites [60]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Given a pre-trained diffusion model, Watson et al. (2021) [247] put forth a strategy for finding the optimal discretization scheme by selecting the best K time steps to maximize the training objective for DDPMs.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.2.1 Optimized Discretization.
What the sources say
- Not checked yetcites [247]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Key to this approach is the observation that the DDPM objective can be broken down into a sum of individual terms, making it well suited for dynamic programming.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.2.1 Optimized Discretization.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“These methods contain DDIM as a first-order approximation.However, they also allow for higher order integrators, which can produce highquality samples in just 10 to 20 iterations-far fewer than the hundreds of iterations typically required by diffusion models without accelerated sampling.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > Denoising Diffusion Implicit Models (DDIM)
What the sources say
- Not checked yetcites [279]
- Not checked yetcites [145]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“Repeating this procedure can further reduce sampling steps, although fewer steps can result in reduced sample quality.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 3.2.3 Knowledge Distillation.
What the sources say
- Not checked yetcites [201]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“This bound, however, may not be tight in many cases [120], leading to potentially suboptimal log-likelihoods from diffusion models.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 4 DIFFUSION MODELS WITH IMPROVED LIKELIHOOD
What the sources say
- Not checked yetcites [120]
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As a result, noise schedules do not affect the VLB as long as they share the same values at R min and R max , and will only affect the variance of Monte Carlo estimators for VLB.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 4.1 Noise Schedule Optimization
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As a result, given a pre-trained score model, we can estimate its first-and second-order moments to obtain the optimal reverse variances.Plugging them into the VLB can lead to tighter VLBs and higher likelihood values.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 4.2 Reverse Variance Learning
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“In iDDPM [165], Nichol and Dhariwal propose to learn the reverse variances by parameterizing them with a form of linear interpolation and training them using a hybrid objective.This results in higher log-likelihoods and faster sampling without losing sample quality.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 4.2 Reverse Variance Learning
What the sources say
- Not checked yetcites [165]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The classical formulation of diffusion models assumes that Gaussian transition kernels in the reverse Markov chain have fixed variance parameters.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 4.2 Reverse Variance Learning
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“For p sde θ , several concurrent works [95,144,222] demonstrate that there exists an efficiently computable variational lower bound, and we can directly train our diffusion models to maximize p sde θ using modified diffusion losses.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 4.3 Exact Likelihood Computation
What the sources say
- Not checked yetcites [95]
- Not checked yetcites [144]
- Not checked yetcites [222]
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Since the probability flow ODE is a special case of neural ODEs or continuous normalizing flows, we can use well-established approaches in those fields to compute log p ode θ accurately.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 4.3 Exact Likelihood Computation
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Difficulties may arise, for example, when models rely on score functions that are only defined on continuous data domains, or when data reside on low dimensional manifolds.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5 DIFFUSION MODELS FOR DATA WITH SPECIAL STRUCTURES
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Most diffusion models are geared towards continuous data domains, because Gaussian noise perturbation as used in DDPMs is not a natural fit for discrete data, and the score functions required by SGMs and Score SDEs are only defined on continuous data domains.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.1 Discrete Data
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Leveraging Continuous Time Markov Chains, they are able to derive efficient samplers that outperform discrete counterparts, while providing a theoretical analysis on the error between the sample distribution and the true data distribution.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.1 Discrete Data
What the sources say
- Not checked yetcites [24]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“Specifically, VQ-Diffusion [78] replaces Gaussian noise with a random walk on the discrete data space, or a random masking operation.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.1 Discrete Data
What the sources say
- Not checked yetcites [78] source
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“Building upon this theoretical result, authors further propose efficient training algorithms for minimizing high order score matching losses and reported improved p ode θ on data.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 4.3 Exact Likelihood Computation
What the sources say
- Not checked yetcites [144]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“While diffusion models have achieved great success for data domains like images and audio, they do not necessarily translate seamlessly to other modalities.Many important data domains have special structures that must be taken into account for diffusion models to function effectively.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5 DIFFUSION MODELS FOR DATA WITH SPECIAL STRUCTURES
Load-bearingStrength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Data in many important domains have invariant structures.For example, graphs are permutation invariant, and point clouds are both translation and rotation invariant.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.2 Data with Invariant Structures
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
In the paper
“For example, Xu et al. (2022) [261] shows that Markov chains starting with an invariant prior and evolving with equivariant Markov kernels can induce an invariant marginal distribution, which can be used to enforce appropriate data invariance in molecular conformation generation.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.2 Data with Invariant Structures
What the sources say
- Not checked yetcites [261]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“This process models both the joint distribution of nodes and edges through a system of stochastic differential equations (SDEs), where message-passing operations are used to guarantee permutation invariance.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.2 Data with Invariant Structures
What the sources say
- Not checked yetcites [105]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In diffusion models, these invariances are often ignored, which can lead to suboptimal performance.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.2 Data with Invariant Structures
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
In the paper
“GDSS [105] further develops this idea by proposing a continuous-time graph diffusion process.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.2 Data with Invariant Structures
What the sources say
- Not checked yetcites [105]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In order to be successful, it is crucial to design a loss function that allows for the joint training of the autoencoder and the diffusion models.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.3.2 Learned Manifolds.
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✗ Checkable: fails✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“Unlike the RSGM, the RDM takes an extrinsic view, assuming that the relevant Riemannian manifold is embedded in a higher dimensional Euclidean space.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.3.1 Known Manifolds.
What the sources say
- Not checked yetcites [94]
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Many recent works have built on this idea, starting by using an autoencoder to condense the data into a lower dimensional manifold, followed by training diffusion models in this latent space.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.3.2 Learned Manifolds.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“The authors of the RDM model have shown that maximizing this VLB is equivalent to minimizing a Riemannian scorematching loss.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.3.1 Known Manifolds.
What the sources say
- Not checked yetcites [94]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In addition, many data domains have well-known manifold structures.For instance, climate and earth data naturally lie on the sphere because that is the shape of our planet.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.3 Data with Manifold Structures
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“According to the manifold hypothesis [66], most natural data lies on manifolds with significantly reduced intrinsic dimensionality.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.3.2 Learned Manifolds.
What the sources say
- Not checked yetcites [66] source
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
None of the sources cited for this claim have been checked yet.
In the paper
“This adaptation parallels the generalization of neural ODEs [34] and continuous normalizing flows [74] to Riemannian manifolds [143,157].”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.3.1 Known Manifolds.
What the sources say
- Not checked yetcites [34]
- Not checked yetcites [74]
- Not checked yetcites [143]
- Not checked yetcites [157]
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Data with manifold structures are ubiquitous in machine learning.As the manifold hypothesis [66] posits, natural data often reside on manifolds with lower intrinsic dimensionality.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.3 Data with Manifold Structures
What the sources say
- Not checked yetcites [66] source
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“It is trained with a generalized denoising score matching objective.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.3.1 Known Manifolds.
What the sources say
- Not checked yetcites [51]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In these cases, the manifold is implicitly defined by the autoencoder and learned through the reconstruction loss.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.3.2 Learned Manifolds.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This formulation allows flexible choice of encoder and decoder models.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.1 Variational Autoencoders and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Typically, these models are represented by exponential family distributions whose parameters are generated by multi-layer neural networks.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.1 Variational Autoencoders and Connections with Diffusion Models
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
None of the sources cited for this claim have been checked yet.
In the paper
“Variational Autoencoders [61,123,194] aim to learn both an encoder and a decoder to map input data to values in a continuous latent space.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.1 Variational Autoencoders and Connections with Diffusion Models
What the sources say
- Not checked yetcites [61]
- Not checked yetcites [123] source
- Not checked yetcites [194]
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“First, an autoencoder is trained to produce a low-dimensional latent space.Then, the diffusion model is trained to generate latent codes.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.3.2 Learned Manifolds.
What the sources say
- Not checked yetcites [196] source
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Specifically, DDPM's forward process functions as the encoder, and this process is structured as a linear Gaussian model (as described by Equation ( 2)).”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.1 Variational Autoencoders and Connections with Diffusion Models
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“To guarantee an effective inference, a variational Bayes approach is used to maximize the evidence lower bound:”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.1 Variational Autoencoders and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The latent variables within the decoder are all the same size as the sample data.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.1 Variational Autoencoders and Connections with Diffusion Models
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“DALLE-2 [186] employs a similar strategy by training a diffusion model on the CLIP image embedding space, followed by training a separate decoder to create images based on the CLIP image embeddings.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 5.3.2 Learned Manifolds.
What the sources say
- Not checked yetcites [186]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Consequently, optimizing a diffusion model can be seen as training an infinitely deep hierarchical VAE-a finding that supports the common belief that Score SDE diffusion models can be interpreted as the continuous limit of hierarchical VAEs.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.1 Variational Autoencoders and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The DDPM's reverse process, on the other hand, corresponds to the decoder, which is shared across multiple decoding steps.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.1 Variational Autoencoders and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Provided that the parameterized likelihood function p θ (x | z) and the parameterized posterior approximation q ϕ (z | x) can be computed in a point-wise way and are differentiable with their parameters, the ELBO can be maximized with gradient descent.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.1 Variational Autoencoders and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In these models, the embedding can be interpreted as a latent variable in a probabilistic generative model, and a probabilistic decoder can be formulated by a parameterized likelihood function.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.1 Variational Autoencoders and Connections with Diffusion Models
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“Namely, the goal of GAN optimization is to achieve Nash equilibrium [192].”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.2 Generative Adversarial Networks and Connections with Diffusion Models
What the sources say
- Not checked yetcites [192] source
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Taking advantage of the flexible diffusion model, Wang et al. (2022) [245] inject noise to the discriminator with an adaptive noise schedule determined by a diffusion model.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.2 Generative Adversarial Networks and Connections with Diffusion Models
What the sources say
- Not checked yetcites [245]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The optimization of GANs can be viewed as a minimax optimization problem with value function V (G, D):”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.2 Generative Adversarial Networks and Connections with Diffusion Models
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Xiao et al. (2021) [256] show that slow sampling is caused by the Gaussian assumption in the denoising step, which is justified only for small step sizes.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.2 Generative Adversarial Networks and Connections with Diffusion Models
What the sources say
- Not checked yetcites [256]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The generator G aims to generate new examples and implicitly model the data distribution.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.2 Generative Adversarial Networks and Connections with Diffusion Models
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“One solution is to inject noise into the discriminator input for widening the support of both the generator and discriminator distributions.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.2 Generative Adversarial Networks and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Normalizing flows can transform simple probability distribution into an extremely complex probability distribution, which can be used in generative models, reinforcement learning, variational inference, and other fields.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.3 Normalizing Flows and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“As such, each denoising step is modeled by a conditional GAN, allowing larger step size.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.2 Generative Adversarial Networks and Connections with Diffusion Models
What the sources say
- Not checked yetcites [256]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“At that point, the generator can be considered that it has captured the accurate distribution of real examples.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.2 Generative Adversarial Networks and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“Generative Adversarial Networks (GANs) [45,71,79] mainly consist of two models: a generator G and a discriminator D.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.2 Generative Adversarial Networks and Connections with Diffusion Models
What the sources say
- Not checked yetcites [45] source
- Not checked yetcites [71]
- Not checked yetcites [79]
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The discriminator D is usually a binary classifier that is used to identify generated examples from true examples with maximally possible accuracy.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.2 Generative Adversarial Networks and Connections with Diffusion Models
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“Normalizing flows [56,193] are generative models that generate tractable distributions to model high-dimensional data [57,121].”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.3 Normalizing Flows and Connections with Diffusion Models
What the sources say
- Not checked yetcites [56]
- Not checked yetcites [193]
- Not checked yetcites [57]
- Not checked yetcites [121]
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“One of the issues of GAN is the instability in the training process, which is mainly caused by the non-overlapping between the distribution of input data and that of the generated data.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.2 Generative Adversarial Networks and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The optimization process ends at a saddle point that produces a minimum about the generator and a maximum about the discriminator.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.2 Generative Adversarial Networks and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The trajectory in normalizing flows is formulated by a differential equation.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.3 Normalizing Flows and Connections with Diffusion Models
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Similar to the continuous setting, normalizing flows allow for the retrieval of the exact loglikelihood through a change of variable formula.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.3 Normalizing Flows and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“For example, DiffFlow [278] introduces a generative modeling algorithm that combines the benefits of both flow-based and diffusion models.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.3 Normalizing Flows and Connections with Diffusion Models
What the sources say
- Not checked yetcites [278]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“Autoregressive Models (ARMs) work by decomposing the joint distribution of data into a product of conditional distributions using the probability chain rule:”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.4 Autoregressive Models and Connections with Diffusion Models
What the sources say
- Not checked yetcites [13] source
- Not checked yetcites [127]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“Existing normalizing flows are constructed based on the change of variable formula [56,193].”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.3 Normalizing Flows and Connections with Diffusion Models
What the sources say
- Not checked yetcites [56]
- Not checked yetcites [193]
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“As a result, DiffFlow produces sharper boundaries than normalizing flow and learns more general distributions with fewer discretization steps compared to diffusion probabilistic models.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.3 Normalizing Flows and Connections with Diffusion Models
What the sources say
- Not checked yetcites [278]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Several works attempt to relax this bijection requirement [57,249].”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.3 Normalizing Flows and Connections with Diffusion Models
What the sources say
- Not checked yetcites [57]
- Not checked yetcites [249]
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“Recent advances in deep learning have facilitated significant progress for various data modalities [29,161,205], such as images [38,239], audio [110,170], and text [14,20,75,159,162].”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.4 Autoregressive Models and Connections with Diffusion Models
What the sources say
- Not checked yetcites [29] source
- Not checked yetcites [161]
- Not checked yetcites [205]
- Not checked yetcites [38]
- Not checked yetcites [239]
- Not checked yetcites [110]
- Not checked yetcites [170]
- Not checked yetcites [14]
- Not checked yetcites [20]
- Not checked yetcites [75]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In the discrete-time setting, the mapping from data x to latent z in normalizing flows is a composition of a sequence of bijections, taking the form of F = F N • F N -1 • . . .• F 1 .”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.3 Normalizing Flows and Connections with Diffusion Models
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“An energy-based model is defined as p θ (x) = 1 Z θ exp( f θ (x)), where Z θ = exp( f θ (x))dx is the partition function, which is analytically intractable for high-dimensional x.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.5 Energy-based Models and Connections with Diffusion Models
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“First, learning EBMs by maximizing the likelihood requires MCMC method to generate samples from the model, which can be very computationally expensive.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.5 Energy-based Models and Connections with Diffusion Models
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Sampling from these models requires the same number of network calls as the data's dimensionality.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.4 Autoregressive Models and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“The Autoregressive Diffusion Model (ARDM) [92], on the other hand, is capable of generating arbitrary-order data, including order-agnostic autoregressive models and discrete diffusion models as special cases [6,93,219].”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.4 Autoregressive Models and Connections with Diffusion Models
What the sources say
- Not checked yetcites [92]
- Not checked yetcites [6]
- Not checked yetcites [93]
- Not checked yetcites [219]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Energy-based Models (EBMs) [119,129,226] can be viewed as one generative version of discriminators [101,128,131], while can be learned from unlabeled input data.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.5 Energy-based Models and Connections with Diffusion Models
What the sources say
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“While ARMs are effective density estimators, sampling is a continuous, time-consuming process-particularly for high-dimensional data.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.4 Autoregressive Models and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“For images, f θ (x) is parameterized by a convolutional neural network with a scalar output.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.5 Energy-based Models and Connections with Diffusion Models
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Second, as demonstrated in [168], the energy potentials learned with non-convergent MCMC are not stable, in the sense that samples from long-run Markov chains can be significantly different from the observed samples, and thus it is difficult to evaluate the learned energy potentials.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.5 Energy-based Models and Connections with Diffusion Models
What the sources say
- Not checked yetcites [168]
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Salimans and Ho (2021) [202] compare both constrained score models and energy-based models for modeling the score of the data distribution, finding that constrained score models, i.e., energy based models, can perform just as well as unconstrained models when using a comparable model structure.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.5 Energy-based Models and Connections with Diffusion Models
What the sources say
- Not checked yetcites [202]
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“At the testing stage, the ARDM is able to generate data in parallel-enabling its application to a range of arbitrary-generation tasks.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.4 Autoregressive Models and Connections with Diffusion Models
What the sources say
- Not checked yetcites [92]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Autoregressive models (ARMs) offer generative capabilities through the use of a single neural network.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.4 Autoregressive Models and Connections with Diffusion Models
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“For example, the Flexible Diffusion Model (FDM) [83] uses a generative model to allow for the sampling of any arbitrary subset of video frames, given any other subset.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 7.1.3 Video Generation.
What the sources say
- Not checked yetcites [83]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“EBMs maximize the recovery likelihood because it is more tractable than marginal likelihood, as sampling from the conditional distributions is much easier than sampling from the marginal distributions.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.5 Energy-based Models and Connections with Diffusion Models
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“For inpainting tasks, RePaint [146] features an enhanced denoising strategy that uses resampling iterations to better condition the image (see Figure 5).”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 7.1.1 Super Resolution, Inpainting, and Translation.
What the sources say
- Not checked yetcites [146] source
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“SDEdit [160] uses a Stochastic Differential Equation (SDE) prior to improve fidelity.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 7.1.1 Super Resolution, Inpainting, and Translation.
What the sources say
- Not checked yetcites [160]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Meanwhile, Palette [198] employs conditional diffusion models to create a unified framework for four image generation tasks: colorization, inpainting, uncropping, and JPEG restoration.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 7.1.1 Super Resolution, Inpainting, and Translation.
What the sources say
- Not checked yetcites [198] source
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“SR3 conducts super-resolution through a stochastic, iterative denoising process.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 7.1.1 Super Resolution, Inpainting, and Translation.
What the sources say
- Not checked yetcites [200] source
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“The Cascaded Diffusion Model (CDM) [88] consists of multiple diffusion models in sequence, each generating images of increasing resolution.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 7.1.1 Super Resolution, Inpainting, and Translation.
What the sources say
- Not checked yetcites [88]
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“This model can generate high-quality samples, and long-run MCMC samples from the conditional distributions still resemble realistic images.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 6.5 Energy-based Models and Connections with Diffusion Models
What the sources say
- Not checked yetcites [69]
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Both the SR3 and CDM directly apply the diffusion process to input images, which leads to larger evaluation steps.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 7.1.1 Super Resolution, Inpainting, and Translation.
What the sources say
- Not checked yetcites [200] source
- Not checked yetcites [88]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Similarly, Decoder Denoising Pretraining (DDeP) [19] integrates diffusion models with denoising autoencoders [241] and delivers promising results on label-efficient semantic segmentation.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 7.1.2 Semantic Segmentation.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“Super-Resolution via Repeated Refinement (SR3) [200] uses DDPM to enable conditional image generation.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 7.1.1 Super Resolution, Inpainting, and Translation.
What the sources say
- Not checked yetcites [200] source
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“diffusion models would learn and even amplify the bias in the training dataset [21,39]”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > Pitfalls on Diffusion Models.
What the sources say
- Not checked yetcites [21]
- Not checked yetcites [39]
Strength:hedged· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“In addition, some approaches apply guided diffusion processes for advanced adversarial purification [242,251].”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 7.5.1 Data Purification.
What the sources say
- Not checked yetcites [242]
- Not checked yetcites [251]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“GeoDiff [261] demonstrates that Markov chains evolving with equivariant Markov kernels can produce an invariant distribution, and further designs blocks for the Markov kernels to preserve the desirable equivariance property”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 7.6.1 Molecular Graph Modeling.
What the sources say
- Not checked yetcites [261]
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“Furthermore, since the latent space in diffusion models often possesses the same dimensionality as the data space, sampling efficiency is negatively affected and the models may not learn the representation schemes well [103].”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > Latent Representations.
What the sources say
- Not checked yetcites [103]
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“Wang et al. [244] employ the recent diffusion model to improve adversarial training, and the trained models achieve state-ofthe-art performance using only generated data.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 7.5.2 Generating Synthetic Data for Robust Learning.
What the sources say
- Not checked yetcites [244]
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Recent advances in Schrödinger bridges and optimal transport [35,50,52,214,221] provide promising alternative solutions, suggesting new formulations for diffusion models that are capable of converging to a specified prior distribution in finite time.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > Revisiting Assumptions.
What the sources say
- Not checked yetcites [35]
- Not checked yetcites [50]
- Not checked yetcites [52]
- Not checked yetcites [214]
- Not checked yetcites [221]
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Other methods incorporate the equivariance property into 3D molecule generation [91] and protein generation [3,15].”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > 7.6.1 Molecular Graph Modeling.
What the sources say
- Not checked yetcites [91]
- Not checked yetcites [3]
- Not checked yetcites [15] source
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In reality, complete removal of information is unachievable in finite time.”
§ Diffusion Models: A Comprehensive Survey of Methods and Applications > Revisiting Assumptions.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
The paper relies on this without support.
Over the past two years, the body of research on diffusion models has grown significantly, making it increasingly challenging for new researchers to stay abreast of recent developments.
“Over the past two years, the body of research on diffusion models has grown significantly, making it increasingly challenging for new researchers to stay abreast of the recent developments in the field.”
The paper relies on this without support.
The sheer volume of work on diffusion models can obscure major trends and hinder further research progress.
“Additionally, the sheer volume of work can obscure major trends and hinder further research progress.”
The authors state this as an assumption.
Langevin dynamics converges to its equilibrium at every noise level.
“under the assumption that Langevin dynamics converges to its equilibrium at every noise level”
The paper relies on this without support.
Text-to-image generation models struggle to faithfully reproduce complex sentences with many objects and relationships.
“Despite text-to-image generation models have made significant progress, they struggle to faithfully reproduce complex sentences with many objects and relationships.”
The paper relies on this without support.
High-quality paired scene-graph-image datasets are scarce.
“However, highquality paired SG-image datasets are scarce.”
The paper relies on this without support.
Diffusion models have emerged as a powerful framework, notably as the only one that can rival generative adversarial networks in most applications without resorting to adversarial training.
“Diffusion models have emerged as a powerful framework, notably as the only one that can rival generative adversarial networks (GANs) in most applications without resorting to adversarial training.”
The paper relies on this without support.
Unlike variational autoencoders or generative adversarial networks, diffusion models are less effective for providing good representations of data in their latent space.
“Unlike variational autoencoders or generative adversarial networks, diffusion models are less effective for providing good representations of data in their latent space.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“Their ability to produce photorealistic imagery with fine-grained control has made them the dominant tools for generating synthetic content (Yang et al. 2023), including AI CSAM (Thorn 2024a).”
From AI-generated child sexual abuse material: what’s the harm? (2026) · cites this paper as Yang et al. 2023
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Grad-TTS2 name disagrees with its cited reference
MinorThe text calls the model Grad-TTS2, but reference [118] is titled Guided-TTS 2.
“Grad-TTS2 [118] improves Grad-TTS in an adaptive way.”
“118. Sungwon Kim, Heeseung Kim, and Sungroh Yoon. 2022. Guided-TTS 2: A diffusion model for high-quality adaptive text-to-speech with untranscribed data.”
Latent Diffusion Models is cited as DPM-solver
MinorThe citation attached to Latent Diffusion Models points to a bibliography entry for DPM-solver, not the paper identified elsewhere in the text as LDM [196].
“Latent Diffusion Models [145]”
“145. Cheng Lu, Yuhao Zhou, Fan Bao, Jianfei Chen, Chongxuan Li, and Jun Zhu. 2022. DPM-solver: A fast ODE solver for diffusion probabilistic model sampling in around 10 steps.”
GeoDiff citation year disagrees with the reference
MinorThe text dates reference [261] to 2022, while its bibliography entry gives 2021.
“Xu et al. (2022) [261] shows that Markov chains starting with an invariant prior and evolving with equivariant Markov kernels can induce an invariant marginal distribution”
“261. Minkai Xu, Lantao Yu, Yang Song, Chence Shi, Stefano Ermon, and Jian Tang. 2021. GeoDiff: A geometric diffusion model for molecular conformation generation.”
DDPM reverse SDE has the opposite score-term sign
MinorEquation (18) subtracts the score term in a reverse-time SDE. Substituting the DDPM drift from Equation (16) therefore gives a negative score term, but Equation (21) gives it a positive sign.
“dx = - 1 2 β (t )(x t -∇ x t log q t (x t ))dt + β (t )dw(21)”
“dx = f (x, t ) -д(t ) 2 ∇ x log q t (x) dt + д(t )d w (18”
Annealed Langevin sampling uses incompatible time-step ranges
MinorThe stated iteration runs from T down to 1, but the immediately following initialization rule applies from 0 up to T−1. As written, the rule does not initialize the first stated step, t = T, and the stated iteration does not perform the t = 0 step.
“We first initialize ALD with x (N ) T ∼ N (0, I), then apply Langevin Monte Carlo for t = T ,T -1, • • • , 1 one after the other.”
“At each time step 0 ≤ t < T , we start with x (0) t = x (N ) t +1”
Citations
Cites
ImageNet: A large-scale hierarchical image database
Deng, J., Dong, W., Socher, R., Li, L.-J., Li, K., & Fei-Fei, L. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206848 · Cited by 65,333
Highly accurate protein structure prediction with AlphaFold
Jumper, J., Evans, R., Pritzel, A., Green, T., Figurnov, M., Ronneberger, O., Tunyasuvunakool, K., Bates, R., Žídek, A., Potapenko, A., et al. (2021) · Nature · doi:10.1038/s41586-021-03819-2 · Cited by 43,764
Berman, H. M. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.235 · Cited by 40,196
Image-to-Image Translation with Conditional Adversarial Networks
Isola, P., Zhu, J.-Y., Zhou, T., & Efros, A. A. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.632 · Cited by 22,930
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
High-Resolution Image Synthesis with Latent Diffusion Models
Rombach, R., Blattmann, A., Lorenz, D., Esser, P., & Ommer, B. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01042 · Cited by 20,302
Auto-Encoding Variational Bayes
Kingma, D. P., & Welling, M. (2013) · arXiv · doi:10.48550/arxiv.1312.6114 · Cited by 20,067
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 16,043
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,759
Advances in Neural Information Processing Systems 29
Teymur, O., Zygalakis, K., & Calderhead, B. (2016) · Cited by 13,881
A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2978386 · Cited by 11,000
The graph neural network model
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005605 · Cited by 9,582
Extracting and composing robust features with denoising autoencoders
Vincent, P., Larochelle, H., Bengio, Y., & Manzagol, P.-A. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390294 · Cited by 7,436
Graph neural networks: A review of methods and applications
Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., & Sun, M. (2020) · AI Open · doi:10.1016/j.aiopen.2021.01.001 · Cited by 6,880
Self-citationKoller, D., & Friedman, N. (2009) · The MIT Press eBooks · Cited by 6,653
Metropolis, N., & Ulam, S. (1949) · Journal of the American Statistical Association · doi:10.1080/01621459.1949.10483310 · Cited by 6,474
(2009) · Cited by 6,153
Machine learning for molecular and materials science
Butler, K. T., Davies, D. W., Cartwright, H., Isayev, O., & Walsh, A. (2018) · Nature · doi:10.1038/s41586-018-0337-2 · Cited by 4,968 · cited 1×
“Solid state materials are the critical foundation of numerous key technologies [19].”
BackgroundWaveNet: a generative model for raw audio
Oord, A. V. D., Dieleman, S., Zen, H., Simonyan, K., Vinyals, O., Graves, A., Kalchbrenner, N., Senior, A., & Kavukcuoglu, K. (2016) · arXiv · doi:10.48550/arxiv.1609.03499 · Cited by 4,911
Adding Conditional Control to Text-to-Image Diffusion Models
Zhang, L., Rao, A., & Agrawala, M. (2023) · 2023 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.00355 · Cited by 4,547
Generative Adversarial Networks: An Overview
Creswell, A., White, T., Dumoulin, V., Arulkumaran, K., Sengupta, B., & Bharath, A. A. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2765202 · Cited by 4,540
DeepAR: Probabilistic forecasting with autoregressive recurrent networks
Salinas, D., Flunkert, V., Gasthaus, J. A., & Januschowski, T. (2019) · International Journal of Forecasting · doi:10.1016/j.ijforecast.2019.07.001 · Cited by 3,094
2011 International Conference on Computer Vision
(2011) · doi:10.1109/iccv17851.2011 · Cited by 2,895
Generating Sequences With Recurrent Neural Networks
Graves, A. (2013) · arXiv · doi:10.48550/arxiv.1308.0850 · Cited by 2,894
2009 International Joint Conference on Artificial Intelligence
(2009) · doi:10.1109/jcai15434.2009 · Cited by 2,846
DPM-Solver: A Fast ODE Solver for Diffusion Probabilistic Model Sampling in Around 10 StepsPreprint
Lu, C., Zhou, Y., Bao, F., et al. (2022) · Neural Information Processing Systems · doi:10.48550/arxiv.2206.00927 · Cited by 2,705
A neural probabilistic language model
BengioYoshua, DucharmeRéjean, VincentPascal, & JanvinChristian (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944966 · Cited by 2,646
Unsupervised Anomaly Detection with Generative Adversarial Networks to Guide Marker Discovery
Schlegl, T., Seeböck, P., Waldstein, S. M., Schmidt-Erfurth, U., & Langs, G. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-59050-9_12 · Cited by 2,627
An Introduction to Variational Autoencoders
Kingma, D. P., & Welling, M. (2019) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000056 · Cited by 2,609
PaLM: Scaling Language Modeling with Pathways
Chowdhery, A., Narang, S., Devlin, J., Bosma, M., Mishra, G., Roberts, A., Barham, P., Chung, H. W., Sutton, C., Gehrmann, S., et al. (2022) · arXiv · doi:10.48550/arxiv.2204.02311 · Cited by 2,590
Photorealistic Text-to-Image Diffusion Models with Deep Language Understanding
Saharia, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E., Ghasemipour, S. K. S., Ayan, B. K., Mahdavi, S. S., Lopes, R. G., et al. (2022) · arXiv · doi:10.48550/arxiv.2205.11487 · Cited by 2,528
Taming Transformers for High-Resolution Image Synthesis
Esser, P., Rombach, R., & Ommer, B. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01268 · Cited by 2,514
Hierarchical Text-Conditional Image Generation with CLIP Latents
Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., & Chen, M. (2022) · arXiv · doi:10.48550/arxiv.2204.06125 · Cited by 2,511 · cited 8×
“DALLE-2 [216] employs a similar strategy by training a diffusion model on the CLIP image embedding space, followed by training a separate decoder to create images based on the CLIP image embeddings.”
BackgroundMethodInfluentialDreamBooth: Fine Tuning Text-to-Image Diffusion Models for Subject-Driven Generation
Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., & Aberman, K. (2022) · arXiv · doi:10.48550/arxiv.2208.12242 · Cited by 2,442
Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations
Ascher, U. M., & Petzold, L. R. (1998) · doi:10.1137/1.9781611971392 · Cited by 2,403 · cited 1×
“In the following, we will discuss them in detail.”
BackgroundRecurrent Neural Networks for Multivariate Time Series with Missing Values
Che, Z., Purushotham, S., Cho, K., Sontag, D., & Liu, Y. (2018) · Scientific Reports · doi:10.1038/s41598-018-24271-9 · Cited by 2,370
Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences
Pham, T., & Wagner, H. (2025) · Leibniz international proceedings in informatics · doi:10.4230/lipics.wads.2025.45 · Cited by 2,353
DreamBooth: Fine Tuning Text-to-Image Diffusion Models for Subject-Driven Generation
Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., & Aberman, K. (2023) · 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52729.2023.02155 · Cited by 2,295
Representation Learning on Graphs: Methods and ApplicationsPreprint
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · IEEE Data Engineering Bulletin · doi:10.48550/arxiv.1709.05584 · Cited by 2,203
Neural ordinary differential equations
Chen, R. T. Q., Rubanova, Y., Bettencourt, J., & Duvenaud, D. (2018) · arXiv · doi:10.48550/arxiv.1806.07366 · Cited by 2,097
Image Super-Resolution Via Iterative Refinement
Saharia, C., Ho, J., Chan, W., Salimans, T., Fleet, D. J., & Norouzi, M. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3204461 · Cited by 1,829
RePaint: Inpainting using Denoising Diffusion Probabilistic Models
Lugmayr, A., Danelljan, M., Romero, A., Yu, F., Timofte, R., & Van Gool, L. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01117 · Cited by 1,778
Palette: Image-to-Image Diffusion Models
Saharia, C., Chan, W., Chang, H., Lee, C., Ho, J., Salimans, T., Fleet, D., & Norouzi, M. (2022) · Special Interest Group on Computer Graphics and Interactive Techniques Conference Proceedings · doi:10.1145/3528233.3530757 · Cited by 1,717
Graph Neural Networks in Recommender Systems: A Survey
Wu, S., Sun, F., Zhang, W., Xie, X. H., & Cui, B. (2022) · ACM Computing Surveys · doi:10.1145/3535101 · Cited by 1,571
Self-citationNICE: Non-linear Independent Components Estimation
Dinh, L., Krueger, D., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1410.8516 · Cited by 1,493
2011 International Joint Conference on Neural Networks
Boubacar, H. A., Lecoeuche, S., & Maouche, S. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2063350 · Cited by 1,481
Tutorial on Variational Autoencoders
Doersch, C. (2016) · arXiv · doi:10.48550/arxiv.1606.05908 · Cited by 1,470
Normalizing Flows for Probabilistic Modeling and InferencePreprint
Papamakarios, G., Nalisnick, E., Rezende, D. J., Mohamed, S., & Lakshminarayanan, B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.02762 · Cited by 1,280
A Review on Generative Adversarial Networks: Algorithms, Theory, and Applications
Gui, J., Sun, Z., Wen, Y., Tao, D., & Ye, J. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3130191 · Cited by 1,231
Classifier-Free Diffusion Guidance
Ho, J., & Salimans, T. (2022) · arXiv · doi:10.48550/arxiv.2207.12598 · Cited by 1,126
Extracting Training Data from Diffusion ModelsPreprint
Carlini, N., Hayes, J., Nasr, M., Jagielski, M., Sehwag, V., Tramèr, F., Balle, B., Ippolito, D., & Wallace, E. (2023) · USENIX Security Symposium · doi:10.48550/arxiv.2301.13188 · Cited by 1,112
Magic3D: High-Resolution Text-to-3D Content Creation
Lin, C.-H., Gao, J., Tang, L., Takikawa, T., Zeng, X., Huang, X., Kreis, K., Fidler, S., Liu, M.-Y., & Lin, T.-Y. (2023) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52729.2023.00037 · Cited by 1,100
Generating Long Sequences with Sparse Transformers
Child, R., Gray, S., Radford, A., & Sutskever, I. (2019) · arXiv · doi:10.48550/arxiv.1904.10509 · Cited by 1,063
A note on the evaluation of generative models
Theis, L., Oord, A. V. D., & Bethge, M. (2015) · arXiv · doi:10.48550/arxiv.1511.01844 · Cited by 1,026
A Connection Between Score Matching and Denoising Autoencoders
Vincent, P. (2011) · Neural Computation · doi:10.1162/neco_a_00142 · Cited by 1,011
Deep Graph Contrastive Representation LearningPreprint
Zhu, Y., Xu, Y., Yu, F., Liu, Q., Wu, S., & Wang, L. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.04131 · Cited by 1,003
Energy-based Generative Adversarial Network
Zhao, J., Mathieu, M., & LeCun, Y. (2016) · arXiv · doi:10.48550/arxiv.1609.03126 · Cited by 912 · cited 1×
“Energy-based Models (EBMs) [26, 48, 58, 64, 67, 68, 75, 78, 79, 120, 129, 132, 165, 170, 182, 196, 254, 281] can be viewed as one generative version of discriminators [79, 104, 131, 134], while can be learned from unlabeled input data.”
BackgroundRhizoDB: A Bounded Activation-Flow Architecture for Graph-Based Memory Systems
Guberte, J. A. (2026) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.20695702 · Cited by 897
Blended Diffusion for Text-driven Editing of Natural Images
Avrahami, O., Lischinski, D., & Fried, O. (2022) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52688.2022.01767 · Cited by 889
A Tutorial on Energy-Based Learning
LeCun, Y., Chopra, S., Hadsell, R. T., Ranzato, A., & Huang, F. J. (2006) · Cited by 844
Image Generation from Scene Graphs
Johnson, J., Gupta, A., & Fei-Fei, L. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00133 · Cited by 836
Glow: Generative Flow with Invertible 1x1 Convolutions
Kingma, D. P., & Dhariwal, P. (2018) · arXiv · Cited by 825
Tune-A-Video: One-Shot Tuning of Image Diffusion Models for Text-to-Video Generation
Wu, J. Z., Ge, Y., Wang, X., Lei, S. W., Gu, Y., Shi, Y., Hsu, W., Shan, Y., Qie, X., & Shou, M. Z. (2023) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.00701 · Cited by 799
SRDiff: Single image super-resolution with diffusion probabilistic models
Li, H., Yang, Y., Chang, M., Chen, S., Feng, H., Xu, Z., Li, Q., & Chen, Y. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.01.029 · Cited by 777
(2005) · doi:10.5555/1046920.1088696 · Cited by 756
CTRL: A Conditional Transformer Language Model for Controllable Generation
Keskar, N. S., McCann, B., Varshney, L. R., Xiong, C., & Socher, R. (2019) · arXiv · doi:10.48550/arxiv.1909.05858 · Cited by 751
High-Resolution Image Synthesis with Latent Diffusion Models
Rombach, R., Blattmann, A., Lorenz, D., Esser, P., & Ommer, B. (2021) · arXiv · doi:10.48550/arxiv.2112.10752 · Cited by 737
Diffusion Probabilistic Models for 3D Point Cloud Generation
Luo, S., & Hu, W. (2021) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr46437.2021.00286 · Cited by 726
Vector Quantized Diffusion Model for Text-to-Image Synthesis
Gu, S., Chen, D., Bao, J., Wen, F., Zhang, B., Chen, D., Yuan, L., & Guo, B. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01043 · Cited by 720
Elucidating the Design Space of Diffusion-Based Generative Models
Karras, T., Aittala, M., Aila, T., & Laine, S. (2022) · arXiv · doi:10.48550/arxiv.2206.00364 · Cited by 702
Elucidating the Design Space of Diffusion-Based Generative Models
Karras, T., Aittala, M., Aila, T., & Laine, S. (2022) · neural information processing systems · doi:10.52202/068431-1926 · Cited by 702
Time-Series Representation Learning via Temporal and Contextual Contrasting
Eldele, E., Ragab, M., Chen, Z., Wu, M., Kwoh, C. K., Li, X., & Guan, C. (2021) · Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2021/324 · Cited by 696 · cited 1×
“Time series data are widely used with many important real-world applications [54, 152, 228, 243].”
BackgroundOne billion word benchmark for measuring progress in statistical language modeling
Chelba, C., Mikolov, T., Schuster, M., Ge, Q., Brants, T., Koehn, P., & Robinson, T. (2014) · Interspeech 2014 · doi:10.21437/interspeech.2014-564 · Cited by 627
Representations of Knowledge in Complex Systems
Grenander, U., & Miller, M. I. (1994) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/j.2517-6161.1994.tb02000.x · Cited by 619
PyOD: A Python Toolbox for Scalable Outlier DetectionPreprint
Zhao, Y., Nasrullah, Z., & Li, Z. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.01588 · Cited by 617
Self-citationWaveGrad: Estimating Gradients for Waveform GenerationPreprint
Chen, N., Zhang, Y., Zen, H., Weiss, R. J., Norouzi, M., & Chan, W. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.00713 · Cited by 603
Ho, J., Salimans, T., Gritsenko, A. A., Chan, W., Norouzi, M., & Fleet, D. J. (2022) · neural information processing systems · doi:10.52202/068431-0628 · Cited by 603
Unsupervised Medical Image Translation With Adversarial Diffusion Models
Özbey, M., Dalmaz, O., Dar, S. U. H., Bedel, H. A., Öztürk, Ş., Güngör, A., & Çukur, T. (2023) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2023.3290149 · Cited by 590
DiffusionCLIP: Text-Guided Diffusion Models for Robust Image Manipulation
Kim, G., Kwon, T., & Ye, J. C. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.00246 · Cited by 570
DiffWave: A Versatile Diffusion Model for Audio Synthesis
Kong, Z., Ping, W., Huang, J., Zhao, K., & Catanzaro, B. (2020) · arXiv · doi:10.48550/arxiv.2009.09761 · Cited by 569
Reverse-time diffusion equation models
Anderson, B. D. O. (1982) · Stochastic Processes and their Applications · doi:10.1016/0304-4149(82)90051-5 · Cited by 565
Cascaded Diffusion Models for High Fidelity Image Generation
Ho, J., Saharia, C., Chan, W., Fleet, D. J., Norouzi, M., & Salimans, T. (2021) · arXiv · doi:10.48550/arxiv.2106.15282 · Cited by 514
Score-based diffusion models for accelerated MRI
Chung, H., & Ye, J. C. (2022) · Medical Image Analysis · doi:10.1016/j.media.2022.102479 · Cited by 488
DPM-Solver: A Fast ODE Solver for Diffusion Probabilistic Model Sampling in Around 10 Steps
Lu, C., Zhou, Y., Bao, F., Chen, J., Li, C., & Zhu, J. (2022) · neural information processing systems · doi:10.52202/068431-0418 · Cited by 477
DreamFusion: Text-to-3D using 2D DiffusionPreprint
Poole, B., Jain, A., Barron, J. T., & Mildenhall, B. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2209.14988 · Cited by 475
Understanding Diffusion Models: A Unified PerspectivePreprint
Luo, C. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2208.11970 · Cited by 455
MaskGIT: Masked Generative Image Transformer
Chang, H., Zhang, H., Jiang, L., Liu, C., & Freeman, W. T. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01103 · Cited by 446
AnoDDPM: Anomaly Detection with Denoising Diffusion Probabilistic Models using Simplex Noise
Wyatt, J., Leach, A., Schmon, S. M., & Willcocks, C. G. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw56347.2022.00080 · Cited by 442
Testing the manifold hypothesis
Fefferman, C., Mitter, S., & Narayanan, H. (2016) · Journal of the American Mathematical Society · doi:10.1090/jams/852 · Cited by 430
A tensor-based method for missing traffic data completion
Tan, H., Feng, G., Feng, J., Wang, W., Zhang, Y., & Li, F. (2013) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2012.12.007 · Cited by 428
GraphAF: a Flow-based Autoregressive Model for Molecular Graph GenerationPreprint
Shi, C., Xu, M., Zhu, Z., Zhang, W., Zhang, M., & Tang, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.09382 · Cited by 423
Self-citation3D Shape Generation and Completion through Point-Voxel Diffusion
Zhou, L., Du, Y., & Wu, J. (2021) · 2021 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv48922.2021.00577 · Cited by 421
Tackling the Generative Learning Trilemma with Denoising Diffusion GANsPreprint
Xiao, Z., Kreis, K., & Vahdat, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.07804 · Cited by 416
Imagen Video: High Definition Video Generation with Diffusion Models
Ho, J., Chan, W., Saharia, C., Whang, J., Gao, R., Gritsenko, A., Kingma, D. P., Poole, B., Norouzi, M., Fleet, D. J., et al. (2022) · arXiv · doi:10.48550/arxiv.2210.02303 · Cited by 399
Flexible Diffusion Modeling of Long VideosPreprint
Harvey, W., Naderiparizi, S., Masrani, V., Weilbach, C., & Wood, F. (2022) · Neural Information Processing Systems · doi:10.48550/arxiv.2205.11495 · Cited by 389
Knowledge Distillation in Iterative Generative Models for Improved Sampling SpeedPreprint
Luhman, E., & Luhman, T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.02388 · Cited by 387
Pre-Trained Language Models for Text Generation: A Survey
Li, J., Tang, T., Zhao, W. X., Nie, J., & Wen, J.-R. (2024) · ACM Computing Surveys · doi:10.1145/3649449 · Cited by 383
A Stochastic Estimator of the Trace of the Influence Matrix for Laplacian Smoothing Splines
Hutchinson, M. F. (1989) · Communications in Statistics - Simulation and Computation · doi:10.1080/03610918908812806 · Cited by 381
How to Train Your Energy-Based ModelsPreprint
Song, Y., & Kingma, D. P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.03288 · Cited by 376
Self-citationVQGAN-CLIP: Open Domain Image Generation and Editing with Natural Language Guidance
Crowson, K., Biderman, S., Kornis, D., Stander, D., Hallahan, E., Castricato, L., & Raff, E. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-19836-6_6 · Cited by 367
Latent-NeRF for Shape-Guided Generation of 3D Shapes and Textures
Metzer, G., Richardson, E., Patashnik, O., Giryes, R., & Cohen-Or, D. (2023) · 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52729.2023.01218 · Cited by 336
Chung, H., Sim, B., & Ye, J. C. (2022) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52688.2022.01209 · Cited by 329
Diffusion-LM Improves Controllable Text GenerationPreprint
Li, X. L., Thickstun, J., Gulrajani, I., Liang, P., & Hashimoto, T. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2205.14217 · Cited by 318
Deblurring via Stochastic Refinement
Whang, J., Delbracio, M., Talebi, H., Saharia, C., Dimakis, A. G., & Milanfar, P. (2022) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52688.2022.01581 · Cited by 316
A Survey of Vision-Language Pre-Trained Models
Du, Y., Liu, Z., Li, J., & Zhao, W. X. (2022) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2022/762 · Cited by 313
Fast Sampling of Diffusion Models with Exponential IntegratorPreprint
Zhang, Q., & Chen, Y. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2204.13902 · Cited by 302
Ho, J., Salimans, T., Gritsenko, A., Chan, W., Norouzi, M., & Fleet, D. J. (2022) · arXiv · doi:10.48550/arxiv.2204.03458 · Cited by 301
Conditional Image Generation with Score-Based Diffusion ModelsPreprint
Batzolis, G., Stanczuk, J., Schönlieb, C., & Etmann, C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.13606 · Cited by 286
Diffsound: Discrete Diffusion Model for Text-to-Sound Generation
Yang, D., Yu, J., Wang, H., Wang, W., Weng, C., Zou, Y., & Yu, D. (2023) · IEEE/ACM Transactions on Audio Speech and Language Processing · doi:10.1109/taslp.2023.3268730 · Cited by 284
Adaptive diffusion priors for accelerated MRI reconstruction
Güngör, A., Dar, S. U. H., Öztürk, Ş., Korkmaz, Y., Bedel, H. A., Elmas, G., Özbey, M., & Çukur, T. (2023) · Medical Image Analysis · doi:10.1016/j.media.2023.102872 · Cited by 277
FUDGE: Controlled Text Generation With Future Discriminators
Yang, K., & Klein, D. (2021) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/2021.naacl-main.276 · Cited by 276
ADBench: Anomaly Detection BenchmarkPreprint
Han, S., Hu, X., Huang, H., Jiang, M., & Zhao, Y. (2022) · SSRN Electronic Journal · doi:10.2139/ssrn.4266498 · Cited by 269
Self-citationDPGN: Distribution Propagation Graph Network for Few-Shot Learning
Yang, L. Q., Li, L., Zhang, Z., Zhou, X., Zhou, E., & Liu, Y. (2020) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr42600.2020.01340 · Cited by 268
Self-citationDiffusion Models for Adversarial Purification
Nie, W., Guo, B., Huang, Y., Xiao, C., Vahdat, A., & Anandkumar, A. (2022) · CaltechAUTHORS (California Institute of Technology) · doi:10.48550/arxiv.2205.07460 · Cited by 262
Diffusion Probabilistic Modeling for Video Generation
Yang, R., Srivastava, P. K., & Mandt, S. (2023) · Entropy · doi:10.3390/e25101469 · Cited by 261
Adversarial Latent Autoencoders
Pidhorskyi, S., Adjeroh, D., & Doretto, G. (2020) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr42600.2020.01411 · Cited by 258
The survey: Text generation models in deep learning
Iqbal, T., & Qureshi, S. (2020) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2020.04.001 · Cited by 258
A Review on Generative Adversarial Networks: Algorithms, Theory, and ApplicationsPreprint
Gui, J., Sun, Z., Wen, Y., Tao, D., & Ye, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.06937 · Cited by 252
Gotta Go Fast When Generating Data with Score-Based ModelsPreprint
Jolicoeur‐Martineau, A., Li, K., Piché-Taillefer, R., Kachman, T., & Mitliagkas, I. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.14080 · Cited by 249
Correlation functions and computer simulations
Parisi, G. (1981) · Nuclear Physics B · doi:10.1016/0550-3213(81)90056-0 · Cited by 243
Learning Gradient Fields for Shape Generation
Cai, R., Yang, G., Averbuch-Elor, H., Hao, Z., Belongie, S., Snavely, N., & Hariharan, B. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58580-8_22 · Cited by 225
Characterization and computation of local Nash equilibria in continuous games
Ratliff, L. J., Burden, S. A., & Sastry, S. S. (2013) · 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2013.6736623 · Cited by 223
GeDi: Generative Discriminator Guided Sequence Generation
Krause, B., Gotmare, A. D., McCann, B., Keskar, N. S., Joty, S., Socher, R., & Rajani, N. F. (2021) · Findings of the Association for Computational Linguistics: EMNLP 2021 · doi:10.18653/v1/2021.findings-emnlp.424 · Cited by 220
Safe Latent Diffusion: Mitigating Inappropriate Degeneration in Diffusion Models
Schramowski, P., Brack, M., Deiseroth, B., & Kersting, K. (2023) · 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52729.2023.02157 · Cited by 219
Equivariant Diffusion for Molecule Generation in 3DPreprint
Hoogeboom, E., Satorras, V. G., Vignac, C., & Welling, M. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2203.17003 · Cited by 216
Score-Based Point Cloud Denoising
Luo, S., & Hu, W. (2021) · 2021 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv48922.2021.00454 · Cited by 209
Adding Conditional Control to Text-to-Image Diffusion Models
Zhang, L., Rao, A., & Agrawala, M. (2023) · arXiv · doi:10.48550/arxiv.2302.05543 · Cited by 201
Flexible Diffusion Modeling of Long Videos
Harvey, W., Naderiparizi, S., Masrani, V., Weilbach, C., & Wood, F. (2022) · neural information processing systems · doi:10.52202/068431-2027 · Cited by 180
SegDiff: Image Segmentation with Diffusion Probabilistic Models
Amit, T., Shaharbany, T., Nachmani, E., & Wolf, L. (2021) · arXiv · doi:10.48550/arxiv.2112.00390 · Cited by 179
MR Image Denoising and Super-Resolution Using Regularized Reverse Diffusion
Chung, H., Lee, E. S., & Ye, J. C. (2022) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2022.3220681 · Cited by 172
Luo, S., Su, Y., Peng, J., Wang, S., Peng, J., & Ma, J. (2022) · neural information processing systems · doi:10.52202/068431-0709 · Cited by 170
A review of missing values handling methods on time-series data
Pratama, I., Permanasari, A. E., Ardiyanto, I., & Indrayani, R. (2016) · International Conference on Information Technology Systems and Innovation · doi:10.1109/icitsi.2016.7858189 · Cited by 167
GeDi: Generative Discriminator Guided Sequence GenerationPreprint
Krause, B., Gotmare, A. D., McCann, B., Keskar, N. S., Joty, S., Socher, R., & Rajani, N. F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.06367 · Cited by 164
GENIE: Higher-Order Denoising Diffusion SolversPreprint
Dockhorn, T., Vahdat, A., & Kreis, K. (2022) · Neural Information Processing Systems · doi:10.48550/arxiv.2210.05475 · Cited by 162
Generating Videos with Dynamics-aware Implicit Generative Adversarial NetworksPreprint
Yu, S., Tack, J., Mo, S., Kim, H., Kim, J., Ha, J.-W., & Shin, J. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2202.10571 · Cited by 158
Riemannian Diffusion ModelsPreprint
Huang, C.-W., Aghajohari, M., Bose, A., Panangaden, P., & Courville, A. C. (2022) · Neural Information Processing Systems · doi:10.48550/arxiv.2208.07949 · Cited by 158
Luo, S., Su, Y., Peng, X., Wang, S., Peng, J., & Ma, J. (2022) · doi:10.1101/2022.07.10.499510 · Cited by 151
Diffusion-GAN: Training GANs with DiffusionPreprint
Wang, Z., Zheng, H., He, P., Chen, W., & Zhou, M. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2206.02262 · Cited by 149
Learning to Efficiently Sample from Diffusion Probabilistic ModelsPreprint
Watson, D., Ho, J., Norouzi, M., & Chan, W. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.03802 · Cited by 138
Diffusion-based Time Series Imputation and Forecasting with Structured State Space ModelsPreprint
Alcaraz, J. M. L., & Strodthoff, N. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2208.09399 · Cited by 136
DALL-Eval: Probing the Reasoning Skills and Social Biases of Text-to-Image Generative TransformersPreprint
Cho, J., Zala, A., & Bansal, M. (2022) · arXiv.org · doi:10.48550/arxiv.2202.04053 · Cited by 135
Graph Barlow Twins: A self-supervised representation learning framework for graphs
Bielak, P., Kajdanowicz, T. J., & Chawla, N. V. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.109631 · Cited by 134
Guided Diffusion Model for Adversarial PurificationPreprint
Wang, J., Lyu, Z., Lin, D., Dai, B., & Fu, H. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2205.14969 · Cited by 132
High-Frequency Space Diffusion Model for Accelerated MRI
Cao, C., Cui, Z., Wang, Y., Liu, S., Chen, T., Zheng, H., Liang, D., & Zhu, Y. (2024) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2024.3351702 · Cited by 128
Xie, Y., & Li, Q. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-16446-0_62 · Cited by 122
Denoising Pretraining for Semantic Segmentation
Brempong, E. A., Kornblith, S., Chen, T., Parmar, N., Minderer, M., & Norouzi, M. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw56347.2022.00462 · Cited by 120
Improving Robustness using Generated DataPreprint
Gowal, S., Rebuffi, S.-A., Wiles, O., Stimberg, F., Calian, D. A., & Mann, T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.09468 · Cited by 120
Bootstrapped Representation Learning on GraphsPreprint
Thakoor, S., Tallec, C., Azar, M. G., Munos, R., Veličković, P., & Valko, M. (2021) · arXiv (Cornell University) · Cited by 118
EGSDE: Unpaired Image-To-Image Translation Via Energy-Guided Stochastic Differential Equations
Zhao, M., Bao, F., Li, C., & Zhu, J. (2022) · neural information processing systems · doi:10.52202/068431-0261 · Cited by 116
Taking on the curse of dimensionality in joint distributions using neural networks
Bengio, S., & Bengio, Y. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846725 · Cited by 115
Towards Performant and Reliable Undersampled MR Reconstruction via Diffusion Model Sampling
Peng, C., Guo, P., Zhou, S. K., Patel, V. M., & Chellappa, R. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-16446-0_59 · Cited by 113
Graph Neural Networks in Recommender Systems: A SurveyPreprint
Wu, S., Sun, F., Zhang, W., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.02260 · Cited by 108
Self-citationSpall, J. C. (2011) · Springer eBooks · doi:10.1007/978-3-642-21551-3_7 · Cited by 104
Differentially Private Diffusion ModelsPreprint
Dockhorn, T., Cao, T., Vahdat, A., & Kreis, K. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2210.09929 · Cited by 102
Score-based Generative Modeling of Graphs via the System of Stochastic Differential EquationsPreprint
Jo, J., Lee, S., & Hwang, S. J. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2202.02514 · Cited by 99
gDDIM: Generalized denoising diffusion implicit modelsPreprint
Zhang, Q., Tao, M., & Chen, Y. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2206.05564 · Cited by 98
Analog Bits: Generating Discrete Data using Diffusion Models with Self-Conditioning
Chen, T., Zhang, R., & Hinton, G. (2022) · arXiv · doi:10.48550/arxiv.2208.04202 · Cited by 97
Score-based generative modeling for de novo protein design
Lee, J. S., Kim, J., & Kim, P. M. (2023) · Nature Computational Science · doi:10.1038/s43588-023-00440-3 · Cited by 94
ProteinSGM: Score-based generative modeling for de novo protein design
Lee, J. S., Kim, J., & Kim, P. M. (2022) · doi:10.1101/2022.07.13.499967 · Cited by 94
Deep Directed Generative Models with Energy-Based Probability EstimationPreprint
Kim, T., & Bengio, Y. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.03439 · Cited by 92
Learning Canonical Representations for Scene Graph to Image Generation
Herzig, R., Bar, A., Xu, H., Chechik, G., Darrell, T., & Globerson, A. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58574-7_13 · Cited by 92
Torsional Diffusion for Molecular Conformer GenerationPreprint
Jing, B., Corso, G., Chang, J., Barzilay, R., & Jaakkola, T. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2206.01729 · Cited by 91
Protein Structure and Sequence Generation with Equivariant Denoising Diffusion Probabilistic Models
Anand, N., & Achim, T. (2022) · arXiv · doi:10.48550/arxiv.2205.15019 · Cited by 90
Better Diffusion Models Further Improve Adversarial TrainingPreprint
Wang, Z., Pang, T., Du, C., Lin, M., Liu, W., & Yan, S. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2302.04638 · Cited by 90
Adversarial score matching and improved sampling for image generation
Jolicoeur-Martineau, A., Piché-Taillefer, R., Combes, R. T. D., & Mitliagkas, I. (2020) · arXiv · doi:10.48550/arxiv.2009.05475 · Cited by 88
Learning Energy-Based Models by Diffusion Recovery LikelihoodPreprint
Gao, R., Song, Y. S., Poole, B., Wu, Y., & Kingma, D. P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.08125 · Cited by 87
Self-citationLossy Image Compression with Conditional Diffusion Models
Yang, R., & Mandt, S. (2023) · neural information processing systems · doi:10.52202/075280-2835 · Cited by 82
DDPM-CD: Denoising Diffusion Probabilistic Models as Feature Extractors for Change DetectionPreprint
Bandara, W. G. C., Nair, N. G., & Patel, V. M. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2206.11892 · Cited by 80
Riemannian Score-Based Generative ModellingPreprint
Bortoli, V. D., Mathieu, É., Hutchinson, M., Thornton, J., Teh, Y. W., & Arnaud Doucet, B. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2202.02763 · Cited by 78
Least Squares Estimation Without Priors or Supervision
Raphan, M., & Simoncelli, E. P. (2010) · Neural Computation · doi:10.1162/neco_a_00076 · Cited by 70
EGSDE: Unpaired Image-to-Image Translation via Energy-Guided Stochastic Differential EquationsPreprint
Zhao, M., Bao, F., Li, C., et al. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2207.06635 · Cited by 70
Accelerating Diffusion Models via Early Stop of the Diffusion ProcessPreprint
Lyu, Z., Xudong, X. U., Yang, C., Lin, D., & Dai, B. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2205.12524 · Cited by 68
The Eigenvalues of Mega-dimensional Matrices
Skilling, J. (1989) · Maximum Entropy and Bayesian Methods · doi:10.1007/978-94-015-7860-8_48 · Cited by 66
Yan, T., Zhang, H., Zhou, T., Zhan, Y., & Xia, Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.10121 · Cited by 66
Pretrained Language Models for Text Generation: A SurveyPreprint
Li, J., Tang, T., Zhao, W. X., et al. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2201.05273 · Cited by 66
PasteGAN: A Semi-Parametric Method to Generate Image from Scene GraphPreprint
Li, Y., Ma, T., Bai, Y., Duan, N., Wei, S., & Wang, X. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.01608 · Cited by 61
GENIE: Higher-Order Denoising Diffusion Solvers
Dockhorn, T., Vahdat, A., & Kreis, K. (2022) · neural information processing systems · doi:10.52202/068431-2186 · Cited by 58
High-Dimensional Probability Estimation with Deep Density ModelsPreprint
Rippel, O., & Adams, R. P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.5125 · Cited by 57
(Certified!!) Adversarial Robustness for Free!Preprint
Carlini, N., Tramèr, F., Dvijotham, Rice, L., Sun, M., & Kolter, J. Z. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2206.10550 · Cited by 57
Wasserstein Introspective Neural Networks
Lee, K., Xu, W., Fan, F., & Tu, Z. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00390 · Cited by 56
ADBench: Anomaly Detection BenchmarkPreprint
Han, S., Hu, X., Huang, H., Jiang, M., & Zhao, Y. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2206.09426 · Cited by 56
Self-citationScore-Based Generative ClassifiersPreprint
Zimmermann, R. S., Schott, L., Song, Y., Dunn, B. A., & Klindt, D. A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.00473 · Cited by 51
Self-citationIntrospective Neural Networks for Generative Modeling
Lazarow, J., Jin, L., & Tu, Z. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.302 · Cited by 49
Neural Manifold Ordinary Differential EquationsPreprint
Lou, A., Lim, D., Katsman, I., Huang, L., Jiang, Q., Lim, S.-N., & De, C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.10254 · Cited by 49
Discrete Contrastive Diffusion for Cross-Modal Music and Image GenerationPreprint
Zhu, Y., Wu, Y., Olszewski, K., Ren, J., Tulyakov, S., & Yan, Y. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2206.07771 · Cited by 49
On the Anatomy of MCMC-Based Maximum Likelihood Learning of Energy-Based Models
Nijkamp, E., Hill, M., Han, T., Zhu, S. C., & Wu, Y. N. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5973 · Cited by 48
Simulating Diffusion Bridges with Score MatchingPreprint
Heng, J., Bortoli, V. D., Arnaud Doucet, B., & Thornton, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.07243 · Cited by 48
EdiTTS: Score-based Editing for Controllable Text-to-Speech
Tae, J., Kim, H., & Kim, T. (2022) · Interspeech (USB) · doi:10.21437/interspeech.2022-6 · Cited by 43
Stochastic Image Denoising by Sampling from the Posterior Distribution
Kawar, B., Vaksman, G., & Elad, M. (2021) · 2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW) · doi:10.1109/iccvw54120.2021.00213 · Cited by 42
Generating High Fidelity Data from Low-density Regions using Diffusion Models
Sehwag, V., Hazirbas, C., Gordo, A., Ozgenel, F., & Ferrer, C. C. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01120 · Cited by 41
Kim, G., & Chun, S. Y. (2023) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52729.2023.01365 · Cited by 41
A Survey of Vision-Language Pre-Trained ModelsPreprint
Du, Y., Liu, Z., Li, J., et al. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2202.10936 · Cited by 41
Threat Model-Agnostic Adversarial Defense using Diffusion ModelsPreprint
Blau, T., Ganz, R., Kawar, B., Bronstein, A. M., & Elad, M. (2022) · arXiv.org · doi:10.48550/arxiv.2207.08089 · Cited by 40
Riemannian Continuous Normalizing FlowsPreprint
Mathieu, É., & Nickel, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.10605 · Cited by 39
AugDiff: Diffusion-Based Feature Augmentation for Multiple Instance Learning in Whole Slide Image
Shao, Z., Dai, L., Wang, Y., Wang, H., & Zhang, Y. (2024) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2024.3454591 · Cited by 37
Time-Series Representation Learning via Temporal and Contextual ContrastingPreprint
Eldele, E., Ragab, M., Chen, Z., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.14112 · Cited by 36
Subspace Diffusion Generative Models
Jing, B., Corso, G., Berlinghieri, R., & Jaakkola, T. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20050-2_17 · Cited by 36
Huang, C.-W., Aghajohari, M., Bose, A. J., Panangaden, P., & Courville, A. C. (2022) · neural information processing systems · doi:10.52202/068431-0199 · Cited by 36
Unsupervised Medical Image Translation with Adversarial Diffusion ModelsPreprint
Özbey, M., Dalmaz, O., Dar, S. U. H., et al. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2207.08208 · Cited by 32
Flagged first, then by citations
Research works printed but not linked: 92
- Jacob Austin, Daniel D. Johnson, Jonathan Ho, Daniel Tarlow, and Rianne van den Berg. 2021. Structured denoising diffusion models in discrete state-spaces. In Advances in Neural Information Processing Systems.
- Hritik Bansal and Aditya Grover. 2023. Leaving reality to imagination: Robust classification via generated datasets. In International Conference on Learning Representations.
- Fan Bao, Chongxuan Li, Jun Zhu, and Bo Zhang. 2021. Analytic-DPM: An analytic estimate of the optimal reverse variance in diffusion probabilistic models. In International Conference on Learning Representations.
- Dmitry Baranchuk, Andrey Voynov, Ivan Rubachev, Valentin Khrulkov, and Artem Babenko. 2021. Label-efficient semantic segmentation with diffusion models. In International Conference on Learning Representations.
- Mikołaj Bińkowski, Dougal J. Sutherland, Michael Arbel, and Arthur Gretton. 2018. Demystifying MMD GANs. In International Conference on Learning Representations.
- Tom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, Sandhini Agarwal, Ariel Herbert-Voss, Gretchen Krueger, Tom Henighan, Rewon Child, Aditya Ramesh, Daniel M. Ziegler, Jeffrey Wu, Clemens Winter, Christopher Hesse, Mark Chen, Eric Sigler, Mateusz Litwin, Scott Gray, Benjamin Chess, Jack Clark, Christopher Berner, Sam McCandlish, Alec Radford, Ilya Sutskever, and Dario Amodei. 2020. Language models are few-shot learners. In Advances in Neural Information Processing Systems.
- Wei Cao, Dong Wang, Jian Li, Hao Zhou, Lei Li, and Yitan Li. 2018. BRITS: Bidirectional recurrent imputation for time series. In Advances in Neural Information Processing Systems, Vol. 31.
- Tianrong Chen, Guan-Horng Liu, and Evangelos Theodorou. 2021. Likelihood training of Schrödinger bridge using forward-backward SDEs theory. In International Conference on Learning Representations.
- Rewon Child. 2020. Very deep VAEs generalize autoregressive models and can outperform them on images. In International Conference on Learning Representations.
- Rob Cornish, Anthony Caterini, George Deligiannidis, and Arnaud Doucet. 2020. Relaxing bijectivity constraints with continuously indexed normalising flows. In International Conference on Machine Learning. 2133–2143.
- Sumanth Dathathri, Andrea Madotto, Janice Lan, Jane Hung, Eric Frank, Piero Molino, Jason Yosinski, and Rosanne Liu. 2019. Plug and play language models: A simple approach to controlled text generation. In International Conference on Learning Representations.
- Valentin De Bortoli, James Thornton, Jeremy Heng, and Arnaud Doucet. 2021. Diffusion Schrödinger bridge with applications to score-based generative modeling. In Advances in Neural Information Processing Systems, Vol. 34. 17695–17709.
- Prafulla Dhariwal and Alexander Nichol. 2021. Diffusion models beat GANs on image synthesis. In Advances in Neural Information Processing Systems, Vol. 34. 8780–8794.
- Laurent Dinh, Jascha Sohl-Dickstein, and Samy Bengio. 2017. Density estimation using Real NVP. In International Conference on Learning Representations.
- Tim Dockhorn, Arash Vahdat, and Karsten Kreis. 2021. Score-based generative modeling with critically-damped Langevin diffusion. In International Conference on Learning Representations.
- Vincent Fortuin, Dmitry Baranchuk, Gunnar Ratsch, and Stephan Mandt. 2020. GP-VAE: Deep probabilistic time series imputation. In International Conference on Artificial Intelligence and Statistics. 1651–1661.
- Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, and George E. Dahl. 2017. Neural message passing for quantum chemistry. In International Conference on Machine Learning. 1263–1272.
- Will Grathwohl, Ricky T. Q. Chen, Jesse Bettencourt, and David Duvenaud. 2019. Scalable reversible generative models with free-form continuous dynamics. In International Conference on Learning Representations.
- Albert Gu, Karan Goel, and Christopher Re. 2021. Efficiently modeling long sequences with structured state spaces. In International Conference on Learning Representations.
- William L. Hamilton, Rex Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Advances in Neural Information Processing Systems. 1025–1035.
- Ruifei He, Shuyang Sun, Xin Yu, Chuhui Xue, Wenqing Zhang, Philip Torr, Song Bai, and Xiaojuan Qi. 2022. Is synthetic data from generative models ready for image recognition?. In International Conference on Learning Representations.
- Jonathan Ho, Ajay Jain, and Pieter Abbeel. 2020. Denoising diffusion probabilistic models. In Advances in Neural Information Processing Systems, Vol. 33. 6840–6851.
- Emiel Hoogeboom, Alexey A. Gritsenko, Jasmijn Bastings, Ben Poole, Rianne van den Berg, and Tim Salimans. 2021. Autoregressive diffusion models. In International Conference on Learning Representations.
- Emiel Hoogeboom, Didrik Nielsen, Priyank Jaini, Patrick Forré, and Max Welling. 2021. Argmax flows and multinomial diffusion: Learning categorical distributions. In Advances in Neural Information Processing Systems, Vol. 34. 12454–12465.
- Chin-Wei Huang, Jae Hyun Lim, and Aaron C. Courville. 2021. A variational perspective on diffusion-based generative models and score matching. In Advances in Neural Information Processing Systems, Vol. 34. 22863–22876.
- Long Jin, Justin Lazarow, and Zhuowen Tu. 2017. Introspective classification with convolutional nets. In Advances in Neural Information Processing Systems, Vol. 30. 823–833.
- Wengong Jin, Regina Barzilay, and Tommi Jaakkola. 2018. Junction tree variational autoencoder for molecular graph generation. In International Conference on Machine Learning. 2323–2332.
- Nal Kalchbrenner, Erich Elsen, Karen Simonyan, Seb Noury, Norman Casagrande, Edward Lockhart, Florian Stimberg, Aäron van den Oord, Sander Dieleman, and Koray Kavukcuoglu. 2018. Efficient neural audio synthesis. In International Conference on Machine Learning. 2410–2419.
- Boah Kim, Inhwa Han, and Jong Chul Ye. 2021. DiffuseMorph: Unsupervised deformable image registration along continuous trajectory using diffusion models. arXiv preprint arXiv:2112.05149 (2021). · arXiv
- Diederik Kingma, Tim Salimans, Ben Poole, and Jonathan Ho. 2021. Variational diffusion models. In Advances in Neural Information Processing Systems, Vol. 34. 21696–21707.
- Hugo Larochelle and Iain Murray. 2011. The neural autoregressive distribution estimator. In International Conference on Artificial Intelligence and Statistics.
- Junnan Li, Dongxu Li, Caiming Xiong, and Steven Hoi. 2022. BLIP: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In International Conference on Machine Learning. PMLR, 12888–12900.
- Shiyang Li, Xiaoyong Jin, Yao Xuan, Xiyou Zhou, Wenhu Chen, Yu-Xiang Wang, and Xifeng Yan. 2019. Enhancing the locality and breaking the memory bottleneck of transformer on time series forecasting. In Advances in Neural Information Processing Systems, Vol. 32.
- Luping Liu, Yi Ren, Zhijie Lin, and Zhou Zhao. 2021. Pseudo numerical methods for diffusion models on manifolds. In International Conference on Learning Representations.
- Cheng Lu, Kaiwen Zheng, Fan Bao, Jianfei Chen, Chongxuan Li, and Jun Zhu. 2022. Maximum likelihood training for score-based diffusion ODEs by high order denoising score matching. In International Conference on Machine Learning. 14429–14460.
- Shitong Luo, Chence Shi, Minkai Xu, and Jian Tang. 2021. Predicting molecular conformation via dynamic graph score matching. In Advances in Neural Information Processing Systems, Vol. 34. 19784–19795.
- Yonghong Luo, Xiangrui Cai, Ying Zhang, Jun Xu, and Xiaojie Yuan. 2018. Multivariate time series imputation with generative adversarial networks. In Advances in Neural Information Processing Systems, Vol. 31.
- Zhaoyang Lyu, Zhifeng Kong, X. U. Xudong, Liang Pan, and Dahua Lin. 2021. A conditional point diffusion-refinement paradigm for 3D point cloud completion. In International Conference on Learning Representations.
- Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu. 2018. Towards deep learning models resistant to adversarial attacks. In International Conference on Learning Representations.
- Gábor Melis, Chris Dyer, and Phil Blunsom. 2018. On the state of the art of evaluation in neural language models. In International Conference on Learning Representations.
- Chenlin Meng, Yutong He, Yang Song, Jiaming Song, Jiajun Wu, Jun-Yan Zhu, and Stefano Ermon. 2021. SDEdit: Guided image synthesis and editing with stochastic differential equations. In International Conference on Learning Representations.
- Chenlin Meng, Jiaming Song, Yang Song, Shengjia Zhao, and Stefano Ermon. 2020. Improved autoregressive modeling with distribution smoothing. In International Conference on Learning Representations.
- Stephen Merity, Nitish Shirish Keskar, and Richard Socher. 2018. Regularizing and optimizing LSTM language models. In International Conference on Learning Representations.
- Alexander Quinn Nichol and Prafulla Dhariwal. 2021. Improved denoising diffusion probabilistic models. In International Conference on Machine Learning. 8162–8171.
- Alexander Quinn Nichol, Prafulla Dhariwal, Aditya Ramesh, Pranav Shyam, Pamela Mishkin, Bob Mcgrew, Ilya Sutskever, and Mark Chen. 2022. GLIDE: Towards photorealistic image generation and editing with text-guided diffusion models. In International Conference on Machine Learning. 16784–16804.
- Chenhao Niu, Yang Song, Jiaming Song, Shengjia Zhao, Aditya Grover, and Stefano Ermon. 2020. Permutation invariant graph generation via score-based generative modeling. In International Conference on Artificial Intelligence and Statistics. 4474–4484.
- Boris N. Oreshkin, Dmitri Carpov, Nicolas Chapados, and Yoshua Bengio. 2019. N-BEATS: Neural basis expansion analysis for interpretable time series forecasting. In International Conference on Learning Representations.
- Sung Woo Park, Kyungjae Lee, and Junseok Kwon. 2021. Neural Markov controlled SDE: Stochastic optimization for continuous-time data. In International Conference on Learning Representations.
- Vadim Popov, Ivan Vovk, Vladimir Gogoryan, Tasnima Sadekova, and Mikhail Kudinov. 2021. Grad-TTS: A diffusion probabilistic model for text-to-speech. In International Conference on Machine Learning. 8599–8608.
- Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, Gretchen Krueger, and Ilya Sutskever. 2021. Learning transferable visual models from natural language supervision. In International Conference on Machine Learning. 8748–8763.
- Alec Radford, Jeffrey Wu, Rewon Child, David Luan, Dario Amodei, and Ilya Sutskever. 2019. Language models are unsupervised multitask learners. OpenAI blog 1, 8 (2019), 9.
- 10.5555/3455716.3455856 · DOI
- Aditya Ramesh, Mikhail Pavlov, Gabriel Goh, Scott Gray, Chelsea Voss, Alec Radford, Mark Chen, and Ilya Sutskever. 2021. Zero-shot text-to-image generation. In International Conference on Machine Learning. 8821–8831.
- Kashif Rasul, Calvin Seward, Ingmar Schuster, and Roland Vollgraf. 2021. Autoregressive denoising diffusion models for multivariate probabilistic time series forecasting. In International Conference on Machine Learning. 8857–8868.
- Kashif Rasul, Abdul-Saboor Sheikh, Ingmar Schuster, Urs M. Bergmann, and Roland Vollgraf. 2020. Multivariate probabilistic time series forecasting via conditioned normalizing flows. In International Conference on Learning Representations.
- Danilo Rezende and Shakir Mohamed. 2015. Variational inference with normalizing flows. In International Conference on Machine Learning. 1530–1538.
- Danilo Jimenez Rezende, Shakir Mohamed, and Daan Wierstra. 2014. Stochastic backpropagation and approximate inference in deep generative models. In International Conference on Machine Learning. 1278–1286.
- Tim Salimans and Jonathan Ho. 2021. Progressive distillation for fast sampling of diffusion models. In International Conference on Learning Representations.
- Tim Salimans and Jonathan Ho. 2021. Should EBMs model the energy or the score?. In International Conference on Learning Representations.
- David Salinas, Michael Bohlke-Schneider, Laurent Callot, Roberto Medico, and Jan Gasthaus. 2019. High-dimensional multivariate forecasting with low-rank Gaussian copula processes. In Advances in Neural Information Processing Systems, Vol. 32.
- Nikolay Savinov, Junyoung Chung, Mikolaj Binkowski, Erich Elsen, and Aaron van den Oord. 2021. Step-unrolled denoising autoencoders for text generation. In International Conference on Learning Representations.
- Vikash Sehwag, Saeed Mahloujifar, Tinashe Handina, Sihui Dai, Chong Xiang, Mung Chiang, and Prateek Mittal. 2021. Robust learning meets generative models: Can proxy distributions improve adversarial robustness?. In International Conference on Learning Representations.
- Chence Shi, Shitong Luo, Minkai Xu, and Jian Tang. 2021. Learning gradient fields for molecular conformation generation. In International Conference on Machine Learning. 9558–9568.
- Ikaro Silva, George Moody, Daniel J. Scott, Leo A. Celi, and Roger G. Mark. 2012. Predicting in-hospital mortality of ICU patients: The physionet/computing in cardiology challenge 2012. In 2012 Computing in Cardiology. 245–248.
- Uriel Singer, Adam Polyak, Thomas Hayes, Xi Yin, Jie An, Songyang Zhang, Qiyuan Hu, Harry Yang, Oron Ashual, and Oran Gafni. 2022. Make-a-Video: Text-to-video generation without text-video data. In International Conference on Learning Representations.
- Jascha Sohl-Dickstein, Eric Weiss, Niru Maheswaranathan, and Surya Ganguli. 2015. Deep unsupervised learning using nonequilibrium thermodynamics. In International Conference on Machine Learning. 2256–2265.
- Xizewen Han Huangjie Zheng and Mingyuan Zhou. 2022. Card: Classification and regression diffusion models. Advances in Neural Information Processing Systems 35 (2022) 18100–18115.
- Jiaming Song, Chenlin Meng, and Stefano Ermon. 2020. Denoising diffusion implicit models. In International Conference on Learning Representations.
- Yang Song, Conor Durkan, Iain Murray, and Stefano Ermon. 2021. Maximum likelihood training of score-based diffusion models. In Advances in Neural Information Processing Systems, Vol. 34. 1415–1428.
- Yang Song and Stefano Ermon. 2019. Generative modeling by estimating gradients of the data distribution. In Advances in Neural Information Processing Systems, Vol. 32.
- Yang Song and Stefano Ermon. 2020. Improved techniques for training score-based generative models. In Advances in Neural Information Processing Systems, Vol. 33. 12438–12448.
- Yang Song, Sahaj Garg, Jiaxin Shi, and Stefano Ermon. 2019. Sliced score matching: A scalable approach to density and score estimation. In The Conference on Uncertainty in Artificial Intelligence. 204.
- Yang Song, Liyue Shen, Lei Xing, and Stefano Ermon. 2021. Solving inverse problems in medical imaging with score-based generative models. In International Conference on Learning Representations.
- Yang Song, Jascha Sohl-Dickstein, Diederik P. Kingma, Abhishek Kumar, Stefano Ermon, and Ben Poole. 2020. Score-based generative modeling through stochastic differential equations. In International Conference on Learning Representations.
- Xuan Su, Jiaming Song, Chenlin Meng, and Stefano Ermon. 2022. Dual diffusion implicit bridges for image-to-image translation. In International Conference on Learning Representations.
- Yusuke Tashiro, Jiaming Song, Yang Song, and Stefano Ermon. 2021. CSDI: Conditional score-based diffusion models for probabilistic time series imputation. In Advances in Neural Information Processing Systems, Vol. 34. 24804–24816.
- Brandon Trabucco, Kyle Doherty, Max Gurinas, and Ruslan Salakhutdinov. 2023. Effective data augmentation with diffusion models. In International Conference on Learning Representations.
- Arash Vahdat, Karsten Kreis, and Jan Kautz. 2021. Score-based generative modeling in latent space. In Advances in Neural Information Processing Systems, Vol. 34. 11287–11302.
- Aäron van den Oord, Nal Kalchbrenner, and Koray Kavukcuoglu. 2016. Pixel recurrent neural networks. In International Conference on Machine Learning. 1747–1756.
- Daniel Watson, William Chan, Jonathan Ho, and Mohammad Norouzi. 2021. Learning fast samplers for diffusion models by differentiating through sample quality. In International Conference on Learning Representations.
- Hao Wu, Jonas Köhler, and Frank Noe. 2020. Stochastic normalizing flows. In Advances in Neural Information Processing Systems, Vol. 33. 5933–5944.
- Pan Xie, Qipeng Zhang, Zexian Li, Hao Tang, Yao Du, and Xiaohui Hu. 2022. Vector quantized diffusion model with CodeUnet for text-to-sign pose sequences generation. arXiv preprint arXiv:2208.09141 (2022). · arXiv
- Tian Xie, Xiang Fu, Octavian-Eugen Ganea, Regina Barzilay, and Tommi S. Jaakkola. 2021. Crystal diffusion variational autoencoder for periodic material generation. In International Conference on Learning Representations.
- Minghao Xu, Hang Wang, Bingbing Ni, Hongyu Guo, and Jian Tang. 2021. Self-supervised graph-level representation learning with local and global structure. In International Conference on Machine Learning. 11548–11558.
- Minkai Xu, Lantao Yu, Yang Song, Chence Shi, Stefano Ermon, and Jian Tang. 2021. GeoDiff: A geometric diffusion model for molecular conformation generation. In International Conference on Learning Representations.
- Ling Yang and Shenda Hong. 2022. Unsupervised time-series representation learning with iterative bilinear temporal-spectral fusion. In International Conference on Machine Learning. 25038–25054.
- Jongmin Yoon, Sung Ju Hwang, and Juho Lee. 2021. Adversarial purification with score-based generative models. In International Conference on Machine Learning. 12062–12072.
- Jinsung Yoon, Daniel Jarrett, and Mihaela Van der Schaar. 2019. Time-series generative adversarial networks. In Advances in Neural Information Processing Systems, Vol. 32.
- Peiyu Yu, Sirui Xie, Xiaojian Ma, Baoxiong Jia, Bo Pang, Ruiqi Gao, Yixin Zhu, Song-Chun Zhu, and Ying Nian Wu. 2022. Latent diffusion energy-based model for interpretable text modelling. In International Conference on Machine Learning. 25702–25720.
- Qinsheng Zhang and Yongxin Chen. 2021. Diffusion normalizing flow. In Advances in Neural Information Processing Systems, Vol. 34. 16280–16291.
- Wenrui Zhang, Ling Yang, Shijia Geng, and Shenda Hong. 2022. Cross reconstruction transformer for self-supervised time series representation learning. arXiv preprint arXiv:2205.09928 (2022). · arXiv
- Huangjie Zheng, Pengcheng He, Weizhu Chen, and Mingyuan Zhou. 2022. Truncated diffusion probabilistic models. arXiv preprint arXiv:2202.09671 (2022). · arXiv
Cited by
Sorted by citations
A Brief Overview of ChatGPT: The History, Status Quo and Potential Future Development
Wu, T., He, S., Liu, J., Sun, S., Liu, K., Han, Q.-L., & Tang, Y. (2023) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2023.123618 · Cited by 1,452
Diffusion models in medical imaging: A comprehensive survey
Kazerouni, A., Aghdam, E. K., Heidari, M., Azad, R., Fayyaz, M., Hacihaliloglu, I., & Merhof, D. (2023) · Medical Image Analysis · doi:10.1016/j.media.2023.102846 · Cited by 1,006
Longo, L., Brcic, M., Cabitza, F., Choi, J., Confalonieri, R., Ser, J. D., Guidotti, R., Hayashi, Y., Herrera, F., Holzinger, A., et al. (2024) · Information Fusion · doi:10.1016/j.inffus.2024.102301 · Cited by 626
Retrieval-Augmented Generation for AI-Generated Content: A Survey
Zhao, P., Zhang, H., Yu, Q., Wang, Z., Geng, Y., Fu, F., Yang, L., Zhang, W., Jiang, J., & Cui, B. (2026) · Data Science and Engineering · doi:10.1007/s41019-025-00335-5 · Cited by 871
Self-citationBengesi, S., El-Sayed, H., Sarker, M. K., Houkpati, Y., Irungu, J., & Oladunni, T. (2024) · IEEE Access · doi:10.1109/access.2024.3397775 · Cited by 470
Metadata
- Authors
- Yang, L., Zhang, Z., Song, Y., Hong, S., Xu, R., Zhao, Y., Zhang, W., Cui, B., & Yang, M.-H.
- Affiliations
- Peking University (CN)
- OpenAI (United States) (US)
- University of California, Los Angeles (US)
- University of Southern California (US)
- HEC Montréal (CA)
- University of California, Merced (US)
- ORCID
- Venue
- ACM Computing Surveys
- Published
- 2023-11-09
- Volume
- 56
- Issue
- 4
- Pages
- 1-39
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W4387195417
- Cited by
- 1,704
- References
- 199
- Citations by year
- 2026: 392 · 2025: 683 · 2024: 483 · 2023: 142
- FWCI
- 154.02
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM Computing Surveys (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Generative Adversarial Networks and Image Synthesis
- Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image and Signal Denoising Methods
- Keywords
- diffusion models, deep generative models, efficient sampling, likelihood estimation, structured data, hybrid generative models, image generation, video generation, temporal data modeling
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review