This work improves likelihood of score-based diffusion ODEs using high-order denoising score matching.
problem The gap between maximum likelihood and score matching objectives for score-based diffusion ODEs.
method High-order denoising score matching to maximize likelihood.
result Score-based diffusion ODEs achieve better likelihood on synthetic and CIFAR-10 data.
This paper bridges the gap between ODE and SDE in diffusion models using Fokker-Planck equations.
problem Empirical evidence shows that ODE-based samples from score-based diffusion models are inferior to SDE-based samples.
method The paper rigorously describes dynamics and approximations in training score-based diffusion models, linking them to Fokker-Planck equations.
result Adding a regularisation term based on the Fokker-Planck residual can close the gap between ODE- and SDE-induced distributions.
Derives PF-ODE for infinite-dimensional functions, improving function generation tasks.
problem Efficient inference in infinite-dimensional diffusion models.
method Derives PF-ODE in infinite-dimensional function spaces.
result Reduces function evaluations while maintaining sample quality.
New method speeds up generative modeling without requiring diffusion steps.
problem Improving the speed and efficiency of generative modeling techniques.
method Probability flow ODE with a corrector step, achieving better dimension dependence.
result Better dimension dependence ( O ( d ) O(\sqrt{d}) O ( d ) vs. O ( d ) O(d) O ( d ) , assuming smoothness of the data distribution). AdjointDEIS simplifies diffusion model optimization.
problem Optimizing diffusion models with respect to a differentiable metric.
method Novel bespoke ODE solvers for continuous adjoint equations.
result Continuous adjoint equations simplify to a simple ODE, improving efficiency.
The paper improves the probability flow ODE sampler for faster sampling of natural images.
problem Improving the convergence rate of the probability flow ODE sampler.
method Adapting the probability flow ODE sampler to exploit intrinsic low-dimensional structures in natural image data.
result Achieves a dimension-free convergence rate of O ( k / T ) O(k/T) O ( k / T ) in total variation distance, improving upon existing results. New theory improves diffusion model convergence for generating data.
problem Improving convergence of diffusion models for data generation.
method Developed a non-asymptotic convergence theory for probability flow ODEs.
result Proves d / ε d/\varepsilon d / ε iterations suffice for approximating target distributions. The paper examines the sampling dynamics of diffusion models using ODEs.
problem Understanding the sampling dynamics of diffusion models.
method Careful inspection of ODE-based sampling of SDEs, revealing structures and relationships.
result Established a theoretical relationship between optimal ODE-based sampling and mean-shift algorithm.
DPM-Solver speeds up DPM sampling to 10-20 function evaluations.
problem Slow sampling from Diffusion Probabilistic Models (DPMs).
method Exact formulation of diffusion ODE solutions, using change-of-variable and exponentially weighted integral.
result Generates high-quality samples in 10-20 function evaluations.
CTM improves diffusion model sampling quality with efficient ODE traversal.
problem Lack of natural trade-off between sample quality and speed in consistency models.
method CTM trains a neural network to output scores and traverse ODE trajectories efficiently.
result CTM achieves state-of-the-art FIDs and improves sample quality with increased computational budget.
New error bounds for flow matching methods using deterministic sampling.
problem Improving the accuracy of flow matching methods for generating probability distributions.
method Derived error bounds for flow matching methods under deterministic sampling conditions.
result Presented error bounds for flow matching methods using L 2 L^2 L 2 loss and regularity conditions. Bi-Lipschitz flows approximate a wide range of distributions.
problem Characterizing the expressivity of bi-Lipschitz normalizing flows.
method Linking score regularity to transport map bi-Lipschitzness via probability flow ODE.
result Gaussian pullbacks induced by bi-Lipschitz variance-preserving transport maps are L 1 L^1 L 1 -dense among all probability densities. This work establishes near-minimax optimal guarantees for ODE-based samplers under mild assumptions.
problem Develop rigorous statistical guarantees for ODE-based samplers in generative modeling.
method Proposes a smooth regularized score estimator and refined convergence analysis.
result Achieves minimax rate in total variation distance for ODE-based samplers under mild assumptions.
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.
A new sampling method called Restart improves both speed and quality of generative processes.
problem Balancing speed and quality in generative processes involving differential equations.
method Alternates between adding noise and following ODE, improving both speed and quality.
result Surpasses previous SDE and ODE samplers in both speed and accuracy.
Improved analysis for diffusion models reduces KL divergence error dependence on data dimension and discretization step size.
problem Analyze the convergence of diffusion-based generative models under minimal assumptions.
method Model the generation process as a composition of reverse ODE and noising steps, leveraging Wasserstein-type error control and noise addition.
result Achieved a linear dependence on data dimension and improved dependence on discretization step size for KL divergence error.
Paper accelerates diffusion models without retraining, reducing evaluations.
problem Approximating target data distributions efficiently.
method Training-free sampling algorithm using high-order Lagrange interpolation.
result Requires fewer score function evaluations than previous methods.
New theory improves diffusion models' convergence rates.
problem Understanding and optimizing diffusion models for faster data generation.
method Developed non-asymptotic theory for diffusion models with minimal assumptions.
result Established convergence rates for two diffusion models.
Rex solves the inverse problem for ODE/SDE solvers, improving precision and stability.
problem Inversion of ODE/SDE solvers is inaccurate and impractical for precision applications.
method Rex uses Lawson methods to convert explicit Runge-Kutta schemes into algebraically reversible ones.
result Rex achieves near-machine-precision reconstruction and improves generative models.
New bounds for generative models under weaker assumptions.
problem Establishing convergence guarantees for generative models under weak assumptions.
method Non-asymptotic 2-Wasserstein distance bounds for probability flow ODEs under weak log-concavity and Lipschitz continuity.
result Concrete convergence rates for generative models, including non-log-concave distributions.
StAD predicts divergence of diffusion and flow models without Jacobian computation.
problem Computing likelihood from diffusion and flow models is computationally expensive.
method Introduces StAD, a distillation method to predict divergence using Langevin-Stein operator.
result StAD predicts divergence with competitive variance and speed compared to existing methods.
DDPM encoder matches optimal transport for natural images.
problem Understanding theoretical properties of DDPM latent space.
method Showed DDPM encoder matches optimal transport for common distributions.
result DDPM encoder map coincides with optimal transport map for natural images.
SA-Solver improves stochastic sampling from DPMs.
problem Efficient sampling from Diffusion Probabilistic Models (DPMs) is time-consuming.
method Proposes SA-Solver, an improved stochastic Adams method for solving diffusion SDE.
result SA-Solver achieves improved or comparable performance compared to SOTA methods for few-step sampling.
Paper analyzes convergence of ODE samplers in Wasserstein distances.
problem Limited theoretical understanding of convergence properties of probability flow ODEs.
method Convergence analysis for general probability flow ODEs in 2-Wasserstein distance.
result First non-asymptotic convergence analysis for probability flow ODE samplers.
VT-DIS improves sampling from Boltzmann distributions with minimal overhead.
problem Bias in Monte Carlo estimates from score-based diffusion models.
method Variance-Tuned Diffusion Importance Sampling (VT-DIS) adapts noise covariance to correct bias.
result VT-DIS achieves effective sample sizes of 80%, 35%, and 3.5% on benchmarks, using less computational budget.
Paper improves neural ODEs for forecasting non-Markovian processes.
problem Forecasting irregularly observed time series with incomplete data.
method Path-dependent Neural Jump ODEs with signature transform.
result Path-dependent NJ-ODE outperforms original framework in non-Markovian data.
Reflected Diffusion Models improve on score-based models by incorporating data constraints.
problem Numerical error in score-based models leads to unnatural samples.
method Reverses a reflected stochastic differential equation on data support, learning perturbed score function through generalized score matching loss.
result Improves sample quality and fidelity without architectural modifications.
It has been observed that residual networks can be viewed as the explicit Euler discretization of an Ordinary Differential Equation (ODE). This observation motivated the introduction of so-called Neural ODEs, which allow more general discretization schemes with adaptive time stepping. Here, we propose ANODEV2, which is…
Paper accelerates diffusion models, improving sampling speed.
problem Low sampling speed in score-based diffusion models.
method Design of novel training-free algorithms for deterministic and stochastic samplers.
result Accelerated samplers converge faster with improved rates.
Paper solves MV portfolio selection in jump-diffusion models with no-shorting constraint.
problem Mean-variance portfolio selection in jump-diffusion model with no-shorting constraint.
method Reduces problem to LQ control and finding a maximal point of a function, constructs viscosity solution.
result Explicit viscosity solution to Hamilton-Jacobi-Bellman equation, optimal controls derived.
TADA improves diffusion sampling without training, up to 186% faster.
problem Efficient sampling in diffusion models, especially for high-fidelity images.
method Training-free ODE solver with higher-dimensional initial noise.
result Up to 186% faster sampling compared to state-of-the-art methods.
GLASS Flows improves flow and diffusion model performance by optimizing sampling efficiency.
problem Efficiency bottleneck in sampling Markov transitions for flow and diffusion models.
method Introduces GLASS Flows, a new sampling paradigm that simulates a 'flow matching model within a flow matching model' to sample Markov transitions efficiently.
result Eliminates the trade-off between stochastic evolution and efficiency in large-scale text-to-image models.
Efficiently trains forward processes to minimize generative trajectories curvature.
problem High curvature of generative trajectories slows down sampling speed.
method Trains forward process to minimize curvature without ODE/SDE simulation.
result Lower curvature than previous models, decreased sampling costs.
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.
Neural Jump ODEs model Itô processes without adversarial training.
problem Generating samples from Itô processes with irregular data.
method Neural Jump ODEs framework for drift and diffusion approximation.
result NJODEs can recover true parameters of Itô processes in the limit.
Novel estimator reduces diffusion model variance.
problem High variance in score function estimation for diffusion models.
method Uses nearest neighbour samples to estimate the score function.
result Significant decrease in variance, leading to improved model performance.
DeepONets improve surrogate modeling for engineering systems.
problem Accurately modeling complex PDEs for engineering systems.
method DeepONets specialize in approximating mathematical operators for PDEs.
result DeepONets achieve high prediction accuracy and zero-shot capability.
DEMOTE uses neural diffusion-reaction processes to capture temporal dynamics in sparse tensor data.
problem Sparse and temporally associated tensor data with limited structural knowledge.
method Develops a neural diffusion-reaction process to estimate dynamic embeddings for tensor modes.
result Captures both commonalities and personalities in evolving tensor entries.
In this paper we derive a scaling limit for an infinite dimensional limit order book model driven by Hawkes random measures. The dynamics of the incoming order flow is allowed to depend on the current market price as well as on a volume indicator. With our choice of scaling the dynamics converges to a coupled SDE-ODE s…
HAD-Net forecasts glucose levels with insights into insulin and carbs diffusion.
problem Inaccurate predictions in glucose level forecasting without context understanding.
method Hybrid model combining deep learning and physiological models, using recurrent attention network.
result Achieves competitive performance in glucose level forecasting with plausible diffusion insights.
DreamPropeller accelerates text-to-3D generation by 4.7x with minimal loss in quality.
problem Long generation times in text-to-3D generation algorithms degrade user experience.
method DreamPropeller uses Picard iterations generalized for non-ODE paths to accelerate parallel sampling.
result Empirically achieves up to 4.7x speedup with negligible quality loss.
This work interprets diffusion score matching using normalizing flows for better model training and evaluations.
problem Limitations of diffusion score matching when dealing with certain types of distributions.
method The approach involves interpreting the diffusion matrix using normalizing flows to provide better interpretation and usage of diffusion score matching.
result Diffusion score matching is equivalent to the original score matching evaluated in the transformed space defined by the normalizing flow.
New analysis improves convergence guarantees for diffusion-based samplers in Wasserstein distance.
problem Improving convergence guarantees for diffusion-based generative models.
method Simple framework to analyze discretization, initialization, and score estimation errors.
result First Wasserstein convergence bound for the Heun sampler and improved results for Euler sampler.
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.
SeqRF straightens generative model flows to speed up sampling.
problem High global truncation error in ODE-based solvers for generative models.
method SeqRF, a learning technique that straightens the probability flow.
result Significantly improved sampling speed and synthesis quality.
Improves generative models by adding jump-diffusion noise.
problem Limited performance of diffusion models in generating samples from unknown distributions.
method Generalizes diffusion processes to include jump-diffusion noise, deriving closed-form generalized score functions.
result Jump-diffusion models outperform Gaussian models in specific parameter regimes.
Develops new bounds for deterministic samplers in diffusion models.
problem Analyzing deterministic samplers in diffusion generative models.
method Operational interpretation of deterministic sampling; restoration and degradation steps.
result First polynomial convergence bounds for DDIM-type samplers.
Generative model improved using Liouville PDE-based sliced-Wasserstein flow.
problem Improving generative models for fair regression.
method Transformed sliced-Wasserstein flow into Liouville PDE-based formalism, handling density estimation with normalizing flows of neural ODE.
result Outperforms in convergence and fairness with reduced variance.