Diffusion-GAN uses diffusion to improve GAN training stability and realism.
problem Stability and realism issues in training GANs.
method Diffusion-GAN employs a forward diffusion chain to generate Gaussian-mixture distributed instance noise, with adaptive diffusion process and timestep-dependent discriminator.
result Diffusion-GAN produces more realistic images with higher stability and data efficiency.
Diffusion models generate new samples by adding and removing noise.
problem Generating new samples from data.
method Apply noise to data, reverse the process to generate new samples.
result Diffusion models can improve classifier performance on imbalanced data.
DMPS uses diffusion maps and LAWGD for efficient generative modeling.
problem Efficiently modeling complex data distributions.
method Diffusion maps for manifold learning and LAWGD for sampling.
result DMPS outperforms other methods on moderate-dimensional data.
Diffusion models generate new samples with active guidance, but theory is limited.
problem Insufficient theoretical understanding of diffusion models.
method Review and progressive routine of diffusion models, including conditional sampling.
result Diffusion models can be used for high-dimensional optimization problems.
Automates learning of multivariate diffusions for generative models.
problem Lack of automated methods for choosing and optimizing diffusion processes in generative models.
method Develops a recipe to maximize likelihood without model-specific analysis, parameterizes diffusion for target noise, and optimizes the inference diffusion process.
result Automatic search over all linear diffusions for generative models.
Beta diffusion generates bounded data using multiplicative transitions.
problem Generating data within specific ranges.
method Integrates demasking and denoising with scaled and shifted beta distributions.
result KLUBs are more effective for optimizing beta diffusion compared to negative ELBOs.
Masking diffusion outperforms other discrete diffusion models by incorporating jump times into the model.
problem Improving the performance of discrete diffusion models.
method Conditioning on the jump schedule of discrete Markov processes.
result Schedule-conditioned discrete diffusion (SCUD) models outperform classical and masking diffusion models.
New method bypasses time-reversal for diffusion-based generative models.
problem Diffusion-based generative models require time-reversal, limiting flexibility.
method Constructs diffusion processes without time-reversal through mixtures of diffusion bridges.
result Exact transport without time-reversal, greater flexibility in dynamics.
Remasking improves the quality of discrete diffusion models for natural language and image generation.
problem Limited iterative refinement in masked discrete diffusion models.
method Introducing ReMDM sampler that allows remasking during inference.
result Remasking enables better quality outputs with increased sampling steps.
New blurring diffusion models bridge heat dissipation and denoising.
problem Developing a new generative modeling approach.
method Connecting blurring to Gaussian diffusion with non-isotropic noise.
result Proposed Blurring Diffusion Models offer the best of both Gaussian denoising and inverse heat dissipation.
Faster diffusion-based models generate data with fewer steps.
problem Slow and costly diffusion-based generative models.
method Truncate diffusion process to generate data more efficiently.
result Truncated models provide consistent improvements in performance.
CGD improves diffusion models' out-of-distribution generalization.
problem Reliable sampling from high-value regions beyond training data.
method Context-guided diffusion (CGD) using unlabeled data and smoothness constraints.
result Substantial performance gains across various diffusion processes.
Equivariant diffusion model generates 3D molecules efficiently.
problem Generating high-quality 3D molecules efficiently.
method Equivariant Diffusion Model (EDM) that operates on atom coordinates and types.
result Significantly outperforms previous methods in molecule quality and training efficiency.
This research explores how different discrete diffusion kernels affect graph generation quality.
problem The impact of different discrete diffusion kernels on graph generation quality.
method Developed a family of discrete diffusion kernels that converge to different Bernoulli priors.
result The quality of generated graphs is sensitive to the prior used, challenging previous intuitions.
LADD models improve discrete diffusion for faster language generation.
problem Practical discrete diffusion models ignore cross-token dependencies, degrading performance.
method Introduces a learnable auxiliary latent channel, diffusing over the joint (token, latent) space.
result LADD models yield improvements on unconditional generation metrics.
Soft Truncation improves diffusion model performance by balancing loss scales across diffusion times.
problem Inverse correlation between density estimation and sample generation in diffusion models.
method Introduces Soft Truncation, a training technique that softens the truncation hyperparameter.
result Soft Truncation achieves state-of-the-art performance on various datasets.
DEUA detects diffusion-generated images by accounting for different types of uncertainty.
problem Detecting generated images with varying aleatoric and epistemic uncertainty.
method DEUA framework using Laplace approximation for DEU estimation and asymmetric loss function.
result DEUA achieves state-of-the-art performance on large-scale benchmarks.
Unified diffusion framework enhances generative models flexibility.
problem Improving generative models' design freedom and efficiency.
method Unified framework incorporating choice of representation, prior distribution, and noise scheduling.
result Enhanced flexibility leading to more efficient training and data generation.
Improved language generation with faster sampling speed.
problem Speed and coherence issues in autoregressive language models.
method Introduces Neural Flow Diffusion Models (NFDM) for discrete state spaces.
result Substantially reduces likelihood gap with autoregressive models.
PaGoDA reduces diffusion model training costs by 64x.
problem Diffusion models are computationally expensive during training.
method Three-stage pipeline: downsampled training, distillation, progressive super-resolution.
result PaGoDA achieves state-of-the-art performance with reduced training costs.
Unified framework improves diffusion model rewards without full trajectories.
problem Limited theoretical understanding of guided diffusion samplers.
method Developed a unified algorithmic and theoretical framework for diffusion guidance and reward-guided diffusion.
result Framework shows CFG decreases expected reciprocal of classifier probability.
New sampling and diffusion models methods introduced without density function assumptions.
problem Sampling and diffusion models without regularity assumptions.
method Inspired by reverse diffusion process, novel sampling and diffusion algorithms.
result Explicit convergence rate and dimension-free particle approximation convergence result.
Optimal control theory connects diffusion models to generative modeling.
problem Sampling from unnormalized densities in statistics and computational sciences.
method Deriving a Hamilton-Jacobi-Bellman equation and applying control theory to minimize Kullback-Leibler divergence.
result Time-reversed diffusion sampler (DIS) outperforms other diffusion-based sampling methods.
Framework for training-free guidance in discrete diffusion models for molecular generation.
problem No equivalent training-free guidance methods for discrete diffusion models.
method Framework using guidance functions for discrete data.
result Demonstrated utility on molecular graph generation tasks.
SiD distills pretrained diffusion models into a fast one-step generator.
problem Efficiently distilling pretrained diffusion models into a fast generator.
method Reformulates forward diffusion processes as semi-implicit distributions and uses three score-related identities to create a loss mechanism.
result Achieves high FID performance and significantly reduces generation time.
New method improves image generation for inverse problems using text prompts.
problem Suboptimal performance of existing latent diffusion models for inverse problems.
method Prompt tuning and latent variable projection to optimize text embeddings.
result P2L method outperforms existing methods on various inverse problem tasks.
Improved diffusion model generation speed with speculative sampling.
problem Generating samples from computationally expensive diffusion models.
method Extending speculative sampling to diffusion models, using fast draft models for candidate token generation.
result Significant speedup in generation, halving the number of function evaluations.
This paper simplifies diffusion models for high resolution images.
problem Applying diffusion models to high resolution images is challenging.
method Adjust noise schedule, scale specific parts, add dropout, and use downsampling.
result Achieved state-of-the-art image generation performance.
Diffusion models improve image compression at low bit-rates.
problem Efficiently compressing images at very low bit-rates.
method Encoding into an embedding, using diffusion models to refine the embedding iteratively.
result Realistic reconstructions can be generated at extremely low bit-rates.
New SMC sampler improves diffusion model sampling efficiency.
problem Sampling generative diffusion models efficiently.
method Constructs correlated observation paths and designs a sampler.
result Improved statistical efficiency, especially under outlier conditions.
Improves text-to-image diffusion models using GFlowNets.
problem Aligning diffusion models with text descriptions.
method Post-training diffusion models with GFlowNets to generate high-reward images.
result Effective alignment of large-scale text-to-image diffusion models with reward information.
Discriminator guidance improves autoregressive diffusion models for generating molecular graphs.
problem Improving the accuracy of autoregressive diffusion models for generating molecular graphs.
method Deriving ways to use a discriminator with a pretrained generative model in the discrete case, including optimal and sub-optimal scenarios.
result Using a discriminator can correct pretrained models and improve exact sampling from the data distribution.
Latent diffusion improves robustness in missing data imputation.
problem Missing data imputation under MCAR corruption.
method Two-stage framework: VAE for latent feature learning, diffusion model in latent space.
result Latent diffusion maintains high quality and stability up to 50% missingness.
Faster sampling in discrete diffusion models with predetermined transition time.
problem Efficiency in sampling discrete diffusion models.
method Discrete Non-Markov Diffusion Models (DNDM) with predetermined transition time.
result Significantly reduces the number of function evaluations for faster sampling.
Rolling Diffusion improves video prediction by progressively corrupting frames based on their temporal position.
problem Improving video prediction accuracy by accounting for temporal dynamics.
method A sliding window denoising process that assigns more noise to frames that appear later in a sequence.
result Rolling Diffusion outperforms standard diffusion models in tasks with complex temporal dynamics.
Diffusion models tackle noisy inverse problems with posterior sampling.
problem Efficiently solving general noisy inverse problems.
method Approximation of posterior sampling for diffusion models.
result Diffusion models can handle various noise statistics and nonlinear problems.
NDMs enable non-linear transformations in diffusion models for better generative tasks.
problem Limited to linear transformations, diffusion models struggle with generative tasks.
method Presented NDMs that allow time-dependent non-linear transformations.
result NDMs outperform conventional diffusion models in likelihood and sample quality.
Simplified masked diffusion models improve discrete data generation.
problem Complex model formulations and unclear relationships hinder discrete data generative modeling.
method Developed a simple and general framework for masked diffusion models.
result Models trained on OpenWebText surpass prior diffusion language models and outperform autoregressive models.
We study the small-time fluctuations for diffusion processes which are conditioned by their initial and final positions, under the assumptions that the diffusivity has a sub-Riemannian structure and that the drift vector field lies in the span of the sub-Riemannian structure. In the case where the endpoints agree and t…
The paper analyzes statistical guarantees for denoising reflected diffusion models.
problem The mismatch between theoretical design and implementation of diffusion models introduces issues in high-dimensional target data.
method The paper uses a reflected diffusion process as the driver of noise and establishes rates of convergence in total variation.
result The statistical guarantees for denoising reflected diffusion models match the minimax lower bound up to a polylogarithmic factor.
New reweighted losses improve diffusion model training and image quality.
problem Training and improving diffusion models for image generation.
method Constructing a cascade of time-dependent variational lower bounds.
result Significant improvements in pixel-space image modeling quality.
Graph Beta Diffusion (GBD) generates graphs with mixed discrete and continuous components.
problem Generating graphs with mixed discrete and continuous components.
method Introduces Graph Beta Diffusion (GBD) using a beta diffusion process.
result Competes strongly with existing models across graph benchmarks.
DALMC provides non-asymptotic error bounds for generative models.
problem Efficiently generating samples from complex data distributions.
method Analysis of diffusion paths and Langevin Monte Carlo.
result Theoretical guarantees for a class of generative models.
Paper introduces new methods for modeling categorical data.
problem Training generative models on categorical data like text and segmentation.
method Argmax Flows and Multinomial Diffusion models.
result Models outperform existing methods in log-likelihood.
Neural Flow Diffusion Models improve diffusion models by learning flexible forward processes.
problem Fixed forward processes in diffusion models complicate reverse processes and increase inference costs.
method Introduces NFDM, a framework supporting flexible forward processes and a novel parameterization technique.
result Demonstrates strong performance in likelihood estimation and learning generative dynamics.
A new pyramidal diffusion model speeds up image generation.
problem Training and evaluating diffusion models are time-consuming.
method Introduces a pyramidal diffusion model with a single score function.
result Generates high-resolution images from low-resolution starting points efficiently.
Study mass transport in low-diffusivity using Lagrangian coordinates.
problem Mass preserving transport of passive tracers in low-diffusivity limit.
method Lagrangian coordinates, time-averaged diffusion equation, weighted manifold structure.
result Leading order asymptotics extend to dominant nontrivial singular value in low-diffusivity limit.
This paper extends neural network approximation results to denoising diffusion models.
problem Improving the efficiency and accuracy of generative models.
method Leveraging connections to stochastic control and neural network approximation.
result Established neural network approximation results for the Föllmer drift are extended to denoising diffusion models.