Sharp statistical theory for conditional diffusion models.
problem Lack of theoretical foundation for conditional diffusion models.
method Sharp statistical theory with approximation of conditional score function.
result Sample complexity bound that adapts to data distribution smoothness.
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 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.
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.
Study large deviations for hypoelliptic diffusion on sub-Riemannian manifolds.
problem Large deviations for hypoelliptic diffusion measures on sub-Riemannian manifolds.
method Rough path theory and manifold-valued Malliavin calculus.
result Proved a large deviation principle for pinned hypoelliptic diffusion measures.
Theory explains creativity in diffusion models generating novel images.
problem Diffusion models generate highly original images far from training data.
method Identified locality and equivariance as inductive biases to prevent optimal score-matching.
result Analytic models predict diffusion model outputs with high accuracy.
Unified theory of measure-preserving diffusions on manifolds.
problem Deriving a complete recipe for measure-preserving diffusions on manifolds.
method Developed a geometric theory that unifies and generalizes previous constructions, relying on intrinsic geometry of the target measure.
result The completeness result is a direct consequence of manifold topology and target measure geometry.
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/ε iterations suffice for approximating target distributions. Diffusion Transformer captures spatial-temporal dependencies in sequential data.
problem Capturing rich spatial and temporal dependencies in sequential data.
method Established theoretical guarantees for diffusion transformers learning Gaussian process data.
result Spatial-temporal dependencies are captured within attention layers of diffusion transformers.
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.
For general varifolds in Euclidean space, we prove an isoperimetric inequality, adapt the basic theory of generalised weakly differentiable functions, and obtain several Sobolev type inequalities. We thereby intend to facilitate the use of varifold theory in the study of diffused surfaces.
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.
We provide a complete characterization of the class of one-dimensional time-homogeneous diffusions consistent with a given law at an exponentially distributed time using classical results in diffusion theory. To illustrate we characterize the class of diffusions with the same distribution as Brownian motion at an expon…
New model learns graph spectra accurately, outperforming existing methods.
problem Graph diffusion models struggle to distinguish certain graph families and their spectra.
method Leveraged random matrix theory to analytically extract spectral properties, introducing Dyson Diffusion Model.
result Dyson Diffusion Model learns graph spectra accurately and outperforms existing models.
Diffusion models' consistency across splits explained by random matrix theory.
problem Consistency of diffusion models trained on non-overlapping subsets.
method Random matrix theory framework to quantify dataset effects on denoiser and sampling map.
result The theory explains and predicts cross-split disagreement in diffusion models.
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.
At the heart of technology transitions lie complex processes of social and industrial dynamics. The quantitative study of sustainability transitions requires modelling work, which necessitates a theory of technology substitution. Many, if not most, contemporary modelling approaches for future technology pathways overlo…
For covering spaces and properly discontinuous actions with compatible diffusion processes, we discuss Lyons-Sullivan discretizations of the processes and the associated function theory.
Weak diffusion priors can still perform well in inverse problems.
problem Using mismatched or low-fidelity diffusion priors in inverse problems.
method Extensive experiments and theoretical analysis combining Bayesian-consistency theory and local-correlation analysis.
result Weak priors succeed when measurements are highly informative, and they fail in other regimes.
This work improves the convergence theory of diffusion models for generating samples from complex distributions.
problem Improving theoretical understanding of diffusion models, particularly their convergence analysis.
method Developed an instance-dependent convergence rate that adapts to the smoothness of target distributions.
result Established an iteration complexity of min{d,d2/3L1/3,d1/3L}ε−2/3 for generating high-quality samples. Paper establishes fast convergence theory for diffusion models under minimal assumptions.
problem Establish theoretical guarantees for diffusion models under minimal assumptions.
method Developed a convergence theory for denoising diffusion probabilistic models (DDPM) under minimal assumptions.
result Achieved convergence rate of O(d/T) for target distributions with finite first-order moment.
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.
Reconstructs Riemannian geometry from diffusion properties.
problem Recovering Riemannian geometry from diffusion data.
method Intrinsic reconstruction from diffusion semigroup and calculus.
result Reveals Riemannian structure from diffusion properties.
Generative models use latent abstractions to create images.
problem Understanding how generative models create high-dimensional data like images.
method Developed a theoretical framework using SDE and information theory.
result Diffusion models can be seen as a non-linear filter driven by latent abstractions.
We study the Stochastic Gradient Descent (SGD) method in nonconvex optimization problems from the point of view of approximating diffusion processes. We prove rigorously that the diffusion process can approximate the SGD algorithm weakly using the weak form of master equation for probability evolution. In the small ste…
New diffusion models can generate text faster than traditional autoregressive models.
problem The slow generation time of autoregressive models.
method Theoretical analysis of diffusion language models using information theory.
result The sampling error in diffusion models decays with fewer iterations than the text sequence length.
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.
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.
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…
We provide convergence guarantees in Wasserstein distance for a variety of variance-reduction methods: SAGA Langevin diffusion, SVRG Langevin diffusion and control-variate underdamped Langevin diffusion. We analyze these methods under a uniform set of assumptions on the log-posterior distribution, assuming it to be smo…
Generalized diffusion type equations are considered and point symmetry analysis is applied to them. The equations with extremal order point symmetry algebras are described. Some old geometrical results are rederived in connection with theory of these equation.
The paper introduces new methods for Asian option pricing using Laguerre quadrature.
problem Developing accurate pricing models for Asian options.
method Utilizes Laguerre quadrature and diffusion kernel approach.
result Demonstrates new techniques to solve complex Asian option pricing equations.
Improved generative models for rare events using nonlinear diffusion.
problem Challenges in modeling rare conditional distributions with linear diffusion models.
method Adapting data representation and forward scheme for nonlinear drift term.
result Significant improvement in capturing extreme tail events.
An Euler discretization of the Langevin diffusion is known to converge to the global minimizers of certain convex and non-convex optimization problems. We show that this property holds for any suitably smooth diffusion and that different diffusions are suitable for optimizing different classes of convex and non-convex …
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.
The paper proves sampling methods using discrete-time processes and information theory.
problem Proving convergence guarantees for diffusion-based sampling methods.
method Directly works with discrete-time stochastic processes and uses information theory.
result Discrepancy between sampling and comparison processes is bounded using information theory.
Different technological domains have significantly different rates of performance improvement. Prior theory indicates that such differing rates should influence the relative speed of diffusion of the products embodying the different technologies since improvement in performance during the diffusion process increases th…
Diffusion models achieve nearly optimal distribution estimation in various spaces.
problem Theoretical limitations of diffusion modeling for distribution estimation.
method Analysis of approximation and generalization abilities of diffusion models in Besov spaces.
result Diffusion models achieve nearly minimax optimal estimation rates in total variation and Wasserstein distances.
Study shows neural operators can efficiently solve complex reaction-diffusion systems.
problem Efficiently solving nonlinear reaction-diffusion systems using neural operators.
method Laplacian-based neural operators applied to a generalized Gierer-Meinhardt system.
result Explicit approximation error bounds established for neural operators in terms of network parameters.
We identify 'critical windows' in diffusion models where specific features emerge, providing a theoretical framework.
problem Understanding narrow time intervals in diffusion models where specific features emerge.
method Developed a formal framework to study these critical windows, showing provable bounds for certain data types.
result Proved that critical windows can be bounded in terms of measures of separation for data from mixtures of log-concave densities.
This paper establishes a theoretical foundation for consistency training in diffusion models.
problem Lack of a comprehensive theoretical understanding of consistency training in diffusion models.
method Demonstrates the necessity of a number of steps in consistency learning exceeding d5/2/ε for generating samples within ε proximity to the target distribution. result Establishes rigorous insights into the validity and efficacy of consistency models, offering theoretical underpinnings for their utility.
InfoBridge uses diffusion bridges to estimate mutual information accurately.
problem Estimating mutual information between random variables.
method Formulated mutual information estimation as a domain transfer problem using diffusion bridge models.
result Demonstrated unbiased estimator for various data types.
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.
Develops a framework for multi-objective learning in diffusion models with limited labeled data.
problem Achieving good trade-offs in multi-objective learning with diffusion models requires a generalist model class with larger capacity than individual tasks.
method Proposes a two-stage training procedure: first fitting specialist models from limited paired data, then distilling them into a generalist model.
result Establishes generalization bounds showing the number of paired samples depends only on specialist model complexity.
We extend diffusion models to function spaces and introduce a new method for sampling from posterior distributions.
problem Sampling from posterior distributions in infinite-dimensional function spaces using diffusion models.
method Infinite-dimensional extension of Doob's h-transform, Supervised Guidance Training for efficient sampling. result We prove that diffusion models can be conditioned to sample from posterior distributions and introduce a simulation-free score matching objective.
New method recovers curvature from heat diffusion data.
problem Recovering Riemannian curvature from heat diffusion.
method Information-theoretic approach using relative entropy.
result Local curvature determined by heat diffusion.
RL for jump-diffusions applies to financial portfolio selection and option hedging.
problem Optimizing control in systems with jump-diffusion dynamics.
method Entropy-regularized exploratory control with stochastic policies, using existing diffusion algorithms with modifications.
result RL algorithms and parameterizations are invariant to jumps in jump-diffusion systems.
Study of diffusion annealed Langevin dynamics for generative models.
problem Theoretical efficiency of score-based diffusion processes.
method Rigorous construction and analysis of diffusion processes with Poincaré and logarithmic Sobolev inequalities.
result Improvement in efficiency of diffusion processes through Poincaré and logarithmic Sobolev inequalities.