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.
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.
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.
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.
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.
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.
DBT combines diffusion models and boosting for supervised learning.
problem Supervised learning problems.
method Diffusion Boosting paradigm and Diffusion Boosted Trees (DBT).
result DBT outperforms deep neural network-based diffusion models and is effective on real-world classification tasks.
New method guides pretrained diffusion models without additional training.
problem Guidance methods for diffusion models often require extra training or are task-specific.
method Variational Control using Diffusion Trajectory Matching (DTM)
result Achieves state-of-the-art results on various problems.
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.
New diffusions help globally optimize non-convex functions.
problem Optimizing non-convex functions globally.
method Euler discretization of Langevin diffusion.
result Different diffusions optimize different convex and non-convex functions.
We present new extensions to a method for constructing several families of solvable one-dimensional time-homogeneous diffusions whose transition densities are obtainable in analytically closed-form. Our approach is based on a dual application of the so-called diffusion canonical transformation method that combines smoo…
New framework for diffusion geometry simplifies complex calculations.
problem Challenges in applying calculus and geometry to real data.
method Reformulates calculus and geometry via diffusion processes.
result Improves precision, robustness, and computational efficiency.
New method uses diffusion models to solve inverse problems.
problem Solving ill-posed inverse problems with powerful priors.
method Formulate posterior sampling as a regularized Wasserstein gradient flow in latent space.
result Demonstrates improved performance on standard benchmarks.
CCDF reduces diffusion sampling steps for inverse problems.
problem Slow sampling from diffusion models in inverse problems.
method Starting from a single forward diffusion step with better initialization, followed by stochastic contraction.
result Significantly reduced sampling steps for state-of-the-art reconstruction.
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.
New tools extend weak approximation of SGD algorithms to infinite time horizon.
problem Weak approximation of stochastic gradient descent algorithms in infinite time horizon.
method Backward error analysis of numerical stochastic differential equations and truncated formal power expansion.
result Characterization of asymptotic behavior of SGD algorithms for strongly convex functions.
New method selects diffusion scales for graph wavelets.
problem Choosing optimal diffusion scales for graph wavelets.
method Proposes an unsupervised method using information theory.
result Method selects diffusion scales for graph wavelets.
A new method for efficient diffusion geometry computation from data regions.
problem Heavy computational load in diffusion maps for modern data analysis.
method Compressed diffusion process between data regions using an adapted MGC kernel.
result Efficient pointwise diffusion map embedding from data regions.
New method simulates diffusion bridges using score matching.
problem Simulating diffusion bridges for statistical inference.
method Backward time representation, variational formulation, score matching.
result Effective approximation of diffusion bridges.
In this paper, we analyze energy-harvesting adaptive diffusion networks for a distributed estimation problem. In order to wisely manage the available energy resources, we propose a scheme where a censoring algorithm is jointly applied over the diffusion strategy. An energy-aware variation of a diffusion algorithm is us…
Develops a new model for pricing without arbitrage opportunities.
problem Arbitrage opportunities in standard jump-diffusion models.
method Introduces a multi-type jump-diffusion model with diffusion-dependent jumps.
result Derives no-arbitrage condition linking drift to model parameters.
New model generates images by reversing heat equation, revealing disentanglement.
problem Image generation without considering image structure.
method Stochastically reverses the heat equation to generate images, using variational approximation.
result Emergent disentanglement of overall colour and shape in images.
New model generates data on constrained sets without losing tractability.
problem Generating data on constrained sets without losing tractability.
method Mirror Diffusion Models (MDM) learn diffusion processes in a dual space constructed from a mirror map.
result MDM generates data on convex constrained sets without losing tractability.
New method for generating images with conditional probability models.
problem Generating images with specific conditions.
method Score-based diffusion models with theoretical analysis and new estimator.
result New estimator for conditional score performs similarly to state-of-the-art.
I2SB learns nonlinear diffusion processes between images.
problem Image restoration tasks, especially with limited structural information.
method Conditional diffusion models, Schrödinger bridge approach.
result I2SB outperforms standard models in various image restoration tasks. New samplers improve compositional generation with diffusion models.
problem Improving compositional generation with diffusion models.
method Score-based interpretation, energy-based parameterization, Metropolis-corrected samplers.
result New samplers enable successful compositional generation across various tasks.
Introduces MFVDM for high-dimensional data analysis.
problem Non-linear dimensionality reduction of high-dimensional datasets.
method Combines multiple unitary irreducible representations for nonlinear embeddings.
result Achieves better nearest neighbor search and alignment estimation on noisy data.
This paper proposes a percolation-based model of new-product diffusion in the spirit of Solomon et al. (2000) and Goldenberg et al. (2000). A consumer buys the new product if she has formed her individual valuation of the product (reservation price) and if this valuation is greater or equal than the price of the produc…
A new graph generator uses heat diffusion on graph Laplacians to create new graph structures.
problem Creating realistic and diverse graph structures for various applications.
method Adapting the Generator Matching paradigm to graph data, using graph Laplacian and heat kernel for diffusion.
result The method effectively generates graphs with structural properties of real and synthetic graphs.
New method improves quality and efficiency of generative models by using smaller diffusion times.
problem Lack of theoretical understanding of diffusion time T in score-based diffusion models.
method Introduce an auxiliary model to bridge the gap between ideal and simulated dynamics, followed by reverse diffusion.
result Empirical results show competitive performance in image data compared to state-of-the-art models.
Solves memorization in diffusion models for manifold data.
problem Memorization effect in diffusion models for manifold data.
method Inertia update at the end of empirical diffusion simulation.
result Approximates true data distribution on a C2 manifold. 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.
Unified framework for multi-view diffusion geometries using intertwined diffusion trajectories.
problem Constructing multi-view diffusion geometries with flexible view interaction and fusion.
method Intertwined multi-view diffusion trajectories (MDTs) as a class of inhomogeneous diffusion processes.
result Established theoretical properties and derived diffusion distances and embeddings.
New method uses QMC and deep learning for accurate diffusivity in random domains.
problem Accurate modeling of exciton diffusion in organic semiconductors with high-dimensional randomness.
method Quasi-Monte Carlo sampling for training data and deep neural network for function extraction.
result Highly accurate and efficient estimation of exciton diffusion length over the entire parameter space.
New method tackles video inverse problems using image diffusion models.
problem Spatio-temporal degradation in video inverse problems.
method Leverages image diffusion models to treat time dimension as batch dimension, introduces batch-consistent diffusion sampling.
result Achieves state-of-the-art reconstructions for various spatio-temporal degradations.
The paper proves the concavity of entropy power for diffusion equations and applies it to new inequalities.
problem Proving concavity of p-Rényi entropy power for diffusion equations. method Analyzing positive solutions to doubly nonlinear diffusion equations and applying Lp-Sobolev and Gagliardo-Nirenberg inequalities. result New proofs and improvements of Lp-Gagliardo-Nirenberg inequalities. Let x denote a diffusion process defined on a closed compact manifold. In an earlier article, the author introduced a new approach to constructing admissible vector fields on the associated space of paths, under the assumption of ellipticity of x. In this article, this method is extended to yield similar results fo…
Paper presents a new video generation model using diffusion probabilistic methods.
problem Generating high-quality video sequences.
method Denoising diffusion probabilistic models, autoregressive, end-to-end optimization.
result Significant improvements in perceptual quality and probabilistic frame forecasting.
FDPs generalize diffusion models to function spaces, enabling efficient image generation.
problem Efficiently generating images from continuous data.
method Introducing FDPs with new mathematical frameworks and training objectives.
result FDPs achieve high-quality image generation with fewer parameters.
A new neural network approach for diffusion on networks.
problem Inference and estimation of diffusion on network structures.
method Neural mean-field dynamics derived from Mori-Zwanzig formalism, approximated by learnable time convolution operators.
result Significantly outperforms existing approaches in accuracy and efficiency.
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.
New method infers and samples point processes from latent diffusion.
problem Modeling point processes with latent diffusion.
method Itô's excursion theory for inference and sampling.
result Proposes a new method to infer and sample point processes.
New method for estimating diffusion model densities without solving flows.
problem Estimating log densities from diffusion models efficiently.
method Monte Carlo path integral estimation, avoiding flow solving.
result Significantly more scalable and efficient density estimation.
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.
A new method clusters hyperspectral images using spatially regularized diffusion.
problem Clustering hyperspectral images effectively.
method Spatially regularized random walks and diffusion geometry.
result The method outperforms state-of-the-art algorithms on real data.
Improved generative models using critically-damped Langevin diffusion.
problem Current score-based generative models (SGMs) use overly simplistic diffusion processes, leading to complex denoising tasks and suboptimal performance.
method Proposed a novel critically-damped Langevin diffusion (CLD) and derived a score matching objective and sampling scheme.
result CLD-based SGMs achieve superior performance in synthesis quality compared to previous methods.
A new method for decision-focused learning using diffusion models.
problem Inability of deterministic point predictions to capture stochasticity in real-world environments.
method Proposes a diffusion-based DFL approach that trains a diffusion model to represent uncertain parameters and optimizes decisions through stochastic optimization.
result Empirically shows consistent outperformance over strong baselines in decision quality.
New algorithm learns bridged diffusion processes without time-reversals.
problem Learning bridged diffusion processes efficiently and accurately.
method Score matching with Doob's h-transform, avoiding time-reversals.
result Outperforms existing methods in learning bridged diffusion processes.