Diffusion models adapt to low-dimensional data regardless of coefficient choices.
problem Understanding how diffusion models adapt to low-dimensional data structures.
method Analysis of diffusion models with flexible coefficient choices.
result Proven that O ~ ( k / ε ) \widetilde{O}(k/\varepsilon) O ( k / ε ) iterations suffice for accurate sampling in total variation distance. We define the beta diffusion tree, a random tree structure with a set of leaves that defines a collection of overlapping subsets of objects, known as a feature allocation. A generative process for the tree structure is defined in terms of particles (representing the objects) diffusing in some continuous space, analogou…
Residual Prior Diffusion integrates coarse latent priors with diffusion models for better generative tasks.
problem Diffusion models struggle with representing both large-scale and fine-scale details in data distributions.
method Two-stage framework: first a coarse prior model captures large-scale structure, then a diffusion model represents the residual.
result RPD accurately captures fine-scale details while preserving large-scale structure, outperforming standard diffusion models.
Study shows how heat leaks from material sets in low diffusivity scenarios.
problem Understanding heat leakage from material sets in low diffusivity limits.
method Generalized leading-order asymptotics for time-dependent diffusion processes.
result Diffusive transport out of a material set is proportional to the surface area of the set boundary.
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.
Shallow diffusion models learn hidden low-dimensional structures effectively.
problem Learning from high-dimensional signals like images and video.
method Analysis of shallow diffusion models over the Barron space of single layer neural networks.
result Shallow diffusion models can adapt to simple low-dimensional structures, overcoming the curse of dimensionality.
Auto-regressive diffusion models improve capturing conditional dependence in data.
problem Vanilla diffusion models struggle to capture important, high-level relationships in real-world data.
method Developed auto-regressive diffusion models to better capture conditional dependence structures.
result AR diffusion models produce samples with a reduced gap in approximating the data conditional distribution.
Localized diffusion models reduce training complexity by exploiting low-dimensional structure.
problem Training diffusion models is computationally expensive due to the curse of dimensionality.
method Localized neural networks and localized score matching loss to estimate low-dimensional score functions.
result Localized diffusion models can circumvent the curse of dimensionality with reduced sample complexity.
New framework for discrete-state diffusion models reduces sample complexity.
problem Lack of theoretical understanding and sample complexity analysis for discrete-state diffusion models.
method Developed a principled theoretical framework, decomposing score estimation error.
result Established sample complexity bound of O ~ ( ε − 2 ) \widetilde{\mathcal{O}}(ε^{-2}) O ( ε − 2 ) . Diffusion models reveal latent hierarchical structure in data.
problem Quantitative measurement of data's hierarchical structure.
method Forward-backward experiments in diffusion models.
result Changes in latent variables manifest as correlated chunks in data.
New framework analyzes regret in guided diffusion for optimizing structured inputs.
problem Understanding regret behavior in guided-diffusion black-box optimization for structured design problems.
method Developed a certificate-based expected simple-regret framework that avoids assumptions breaking down in modern diffusion BO pipelines.
result Explains how exponential and polynomial convergence can arise from mass lift in near-optimal designs.
Develops DSD for analyzing multiscale biological networks.
problem Analyzing multiscale structure in biological networks.
method Data-driven diffusion process with multitemporal analysis.
result Parameter-free inference of intrinsic data structure.
Model infers diffusion networks from heterogeneous cascade data.
problem Understanding and predicting diffusion processes in interconnected populations.
method Double mixture directed graph model with layer-specific constraints.
result Convex formulation allows for statistical and computational guarantees.
Identifies smooth curves for financial models.
problem Consistent term structures with flexible diffusion.
method Analyzes manifolds of curves for Heath-Jarrow-Morton models.
result Term structures cannot be affine but must be linear-rational.
We consider Lagrangian coherent structures (LCSs) as the boundaries of material subsets whose advective evolution is metastable under weak diffusion. For their detection, we first transform the Eulerian advection-diffusion equation to Lagrangian coordinates, in which it takes the form of a time-dependent diffusion or h…
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.
We introduce the concept of Hypoelliptic Diffusion Maps (HDM), a framework generalizing Diffusion Maps in the context of manifold learning and dimensionality reduction. Standard non-linear dimensionality reduction methods (e.g., LLE, ISOMAP, Laplacian Eigenmaps, Diffusion Maps) focus on mining massive data sets using w…
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…
Proposes diffusion models using mixed Gaussian priors for better data representation.
problem Improving data representation in diffusion models.
method Structured diffusion models with a mixture of Gaussians as prior.
result Improved model performance compared to classical diffusion models.
MELD model clusters data at multiple scales, improving understanding of latent structure.
problem Understanding latent multiscale structure in datasets.
method Multiscale Learning by Unsupervised Nonlinear Diffusion (M-LUND) algorithm.
result M-LUND detects latent structure in synthetic and real datasets.
A new method uses string method to explore diffusion models.
problem Understanding the geometry of learned distributions in diffusion models.
method String method to compute continuous paths between samples.
result The string method identifies realistic morphing sequences and transition pathways.
A new diffusion model improves time-series forecasting by preserving seasonal patterns.
problem Improving time-series forecasting accuracy, especially for seasonal data.
method A forward diffusion process that decomposes signals into spectral components, altering only the diffusion process.
result The method maintains high signal-to-noise ratios for dominant frequencies, improving long-term pattern recovery.
In this paper, we study the problem of using representation learning to assist information diffusion prediction on graphs. In particular, we aim at estimating the probability of an inactive node to be activated next in a cascade. Despite the success of recent deep learning methods for diffusion, we find that they often…
The paper shows diffusion models can converge faster to a target distribution with low-dimensional structure.
problem Improving the convergence rate of diffusion models to target distributions.
method Analyzing DDIM and DDPM samplers under low-dimensional structure assumptions.
result The iteration complexities of DDIM and DDPM are no greater than k / ε k/\varepsilon k / ε in total variation distance. Gradient guidance improves diffusion models for optimizing specific objectives.
problem Improving diffusion models for specific optimization tasks.
method Established a mathematical framework for gradient-guided diffusion, linking it to optimization theory. Developed a modified gradient guidance method and iteratively fine-tuned version.
result Gradient-guided diffusion models are essentially solutions to regularized optimization problems, preserving latent structure.
Diffusion models generalize better with hierarchical data structure and regularization.
problem Understanding generalization in diffusion models with finite data.
method Analyzing diffusion models through data covariance spectra and developing a theoretical framework based on linear neural networks.
result Generalization in diffusion models improves with hierarchical data structure and regularization.
Nonparametric undirected graphical model selection using diffusion models
problem Undirected graphical model selection
method Diffusion models
result Model selection consistency
A new diffusion model tackles brightness issues with a probabilistic approach.
problem Brightness-related limitations in diffusion models.
method Introduces a novel diffusion model with a probabilistic framework, modifying both forward and reverse diffusion processes.
result The model mitigates brightness-related limitations and improves performance in high-dimensional settings.
Diffusion models adapt to low-dimensional structures for nonparametric density estimation.
problem High-dimensional statistical inference challenges.
method Viewing diffusion models as implicit density estimators and exploiting their low-dimensional structure.
result Achieves minimax optimal rate for total variation distance with factorizable density.
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.
Proposes a model to generate high-dimensional financial returns using latent factor structure.
problem Challenges in financial scenario simulation, especially in high-dimensional and small data settings.
method Integrates latent factor structure into generative diffusion processes, decomposing the score function using time-varying orthogonal projections.
result Establishes rigorous statistical guarantees for score estimation and generated distribution, surpassing dimension-dependent limits.
Diffusion models reveal a phase transition in reconstructing high-level features.
problem Understanding the hierarchical structure of natural data.
method Study of hierarchical generative models of data using diffusion models.
result The backward diffusion process shows a phase transition at a threshold time, where high-level features suddenly drop in reconstructibility.
Paper adapts DDPM to low-dimensional structures in image distributions.
problem Understanding and adapting to low-dimensional structures in image distributions.
method Developed a novel set of analysis tools to characterize algorithmic dynamics.
result First theoretical demonstration that DDPM can adapt to unknown low-dimensional structures.
Study shows how diffusion models learn on low-dimensional manifolds.
problem Learning efficiency of diffusion models on manifolds.
method Analyzes denoising score matching with random feature neural networks.
result Sample complexity scales linearly with intrinsic dimension, not ambient dimension.
Entropy tracking reveals class commitment transitions in diffusion models.
problem Diffusion models lack reliable methods to detect semantic structure transitions.
method Tracking class-conditional entropy of latent variables.
result Entropy isolates noise regimes critical for semantic structure formation.
Confidence-based filtering reveals latent structure in diffusion models.
problem Unclear latent structure in diffusion models.
method Confidence scores from a classifier.
result Class-relevant latent structure emerges under confidence-based filtering.
Improved forecasting of financial risk using Diffusion-Copula framework.
problem Capturing complex, asymmetric dependence structures in financial markets.
method Explicitly decouples marginal distribution learning from dependence structure using Mixture Density Networks and Classification-Diffusion Copula.
result Superior performance in forecasting systemic extremes of marginal and joint events.
DDCD uses diffusion models to learn causal structures from noisy data.
problem Scalability and stability issues in high-dimensional causal structure learning.
method Adaptive k-hop acyclicity constraint and denoising score matching objective of diffusion models.
result DDCD achieves competitive performance on synthetic and real-world data.
New method steers protein design towards desired properties.
problem Challenges in designing proteins with specific structures and properties.
method Feynman-Kac framework applied to RFdiffusion models with guiding potentials.
result Significant improvement in predicted interface energetics and binder designability.
A new diffusion model generates novel protein backbones without relying on pretrained networks.
problem Generating novel protein backbones without relying on pretrained networks.
method Developed a SE(3) invariant diffusion model on multiple frames, called FrameDiff.
result Generated designable protein monomers up to 500 amino acids without pretrained networks.
We construct non-symmetric diffusion processes associated with Dirichlet forms consisting of uniformly elliptic forms and derivation operators with killing terms on RCD spaces by aid of non-smooth differential structures introduced by Gigli '16. After constructing diffusions, we investigate conservativeness and the wea…
A new method relaxes molecules without needing non-equilibrium data.
problem Molecular relaxation requires understanding non-equilibrium structures.
method MoreRed: molecular relaxation by reverse diffusion with time step prediction.
result MoreRed learns a simpler pseudo potential energy surface.
DiffDenoise preserves fine structures in medical images using conditional diffusion models.
problem Medical image denoising often results in loss of fine structures.
method Conditional diffusion model with stabilized reverse sampling and supervised training.
result DiffDenoise outperforms state-of-the-art methods in medical image denoising.
WS diffusion models handle anisotropic Gaussian noise better than conventional methods.
problem Handling anisotropic Gaussian noise in imaging inverse problems.
method Whitened Score (WS) diffusion models based on stochastic differential equations.
result WS DMs outperform conventional DMs on anisotropic Gaussian noise.
Infinite dimensional measure-valued processes modeled as polynomial diffusions.
problem Modeling term structure in energy markets using measure-valued polynomial diffusions.
method Introduced measure-valued polynomial diffusions, derived moment formulas, and characterized infinitesimal generators.
result Recovery of measure-valued affine diffusions as a special case.
Diffusion maps are an emerging data-driven technique for non-linear dimensionality reduction, which are especially useful for the analysis of coherent structures and nonlinear embeddings of dynamical systems. However, the computational complexity of the diffusion maps algorithm scales with the number of observations. T…
Non-autoregressive method speeds up protein folding prediction 23 times.
problem Generating protein sequences with higher order interactions.
method Discrete diffusion conditioned on 3D structure using ProteinMPNN.
result 23 times speed up in inference without performance loss.
New method improves counterfactual distribution learning for high-dimensional outcomes.
problem Counterfactual distribution learning for high-dimensional outcomes with concentrated structure.
method Geometry-adaptive diffusion-guided smoothing estimators combining causal nuisance adjustment and local outcome geometry.
result Geometry-adaptive methods show steeper error decay in semi-synthetic experiments.