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.
Developed a diffusion model on spherical data, addressing geometric and stochastic challenges.
problem Diffusion models on spherical data face unique geometric and stochastic issues.
method Extended spectral diffusion to spherical harmonics, introducing modified stochastic differential equations.
result Introduced a geometry-dependent inductive bias in spectral diffusion models.
PolyNSD improves Neural Sheaf Diffusion with polynomial operators and spectral rescaling.
problem Limitations of common Neural Sheaf Diffusion implementations, including scalability and stability issues.
method Introduces Polynomial Neural Sheaf Diffusion (PolyNSD) with a degree-K polynomial propagation operator and spectral rescaling.
result PolyNSD achieves state-of-the-art results on both homophilic and heterophilic benchmarks with reduced runtime and memory requirements.
HyFAD improves time series imputation by combining time and frequency diffusion.
problem Improve time series imputation by handling frequency-sensitive denoising and balancing global and local dynamics.
method HyFAD is a hybrid time-frequency diffusion model with frequency-aware embedding, built on DDPM paradigm.
result HyFAD achieves state-of-the-art performance in time series imputation.
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.
Improved spectral convergence bounds for diffusion maps on tori.
problem Weak theoretical error bounds for diffusion maps.
method Spatial Hardy space estimates, PDE spectral stability, Sinkhorn weights.
result Matched pointwise error bounds for spectral data and operator convergence.
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.
Estimates spectral gap for Brownian motion on sticky-reflecting domains.
problem Estimating spectral gap for Brownian motion on sticky-reflecting domains.
method Interpolation method and novel applications of Reilly formula.
result Lower bounds for spectral gap derived for general domains.
We consider a special family of occupation-time derivatives, namely proportional step options introduced by Linetsky in [Math. Finance, 9, 55--96 (1999)]. We develop new closed-form spectral expansions for pricing such options under a class of nonlinear volatility diffusion processes which includes the constant-elastic…
A coupling method and an analytic one allow us to prove new lower bounds for the spectral gap of reversible diffusions on compact manifolds. Those bounds are based on the a notion of curvature of the diffusion, like the coarse Ricci curvature or the Bakry--Emery curvature-dimension inequalities. We show that when this …
The paper analyzes the latent geometry of generative diffusion models.
problem The manifold overfitting phenomenon in generative models.
method Statistical physics approach to analyze the spectrum of eigenvalues and singular values of the Jacobian of the score function.
result Three distinct qualitative phases during the generative process: trivial, manifold coverage, and consolidation phases.
Study quantum diffusion on spectral triples and spinor bundles.
problem Characterize quantum diffusion on almost commutative spectral triples.
method Spin geometry, C *-Dirichlet forms, quantum stochastic flows.
result Existence of covariant quantum stochastic flows on spinor bundles.
Analyzes how diffusion models learn, revealing a spectral bias in structure mastery.
problem Understanding the learning dynamics and bias in diffusion models.
method Developed an analytical framework using a Gaussian-equivalence principle to solve gradient-flow dynamics and integrate probability-flow ODEs.
result Exposes a universal inverse-variance spectral law: high-variance structure is mastered faster than low-variance detail.
Spectral algorithms on manifolds using diffusion kernels improve convergence rates.
problem The limitations of existing spectral algorithms in RKHSs for data on manifolds.
method Integrating manifold structure into spectral algorithms using heat kernel diffusion spaces.
result Spectral algorithms converge to the target function and its derivatives in a strong sense, with rates dependent on manifold intrinsic dimension.
High-dimensional curved diffusions show abrupt convergence at a critical time.
problem Understanding abrupt convergence in high-dimensional curved diffusions.
method Functional inequalities and spectral rigidity.
result Abrupt convergence (cutoff) occurs in high dimensions, linked to spectral rigidity.
Simplicial complexes are increasingly used to study complex system structure and dynamics including diffusion, synchronization and epidemic spreading. The spectral dimension of the graph Laplacian is known to determine the diffusion properties at long time scales. Using the renormalization group here we calculate the s…
Interpolates mean shift and spectral clustering on graphs.
problem Data clustering algorithms.
method Fokker-Planck equations on data graphs.
result New theoretical insights on diffusion maps and mean shift dynamics.
We analyze DMs using spectral methods to design effective noise schedules.
problem Lack of theoretical foundation for synthesis process decisions in DMs.
method Introduced a frequency response perspective based on Gaussianity assumption.
result Proposed a spectral transfer function to understand DM inference process.
A hybrid model combines diffusion and neural operator methods for stress prediction in hyperelastic materials.
problem Challenges in predicting stress fields in hyperelastic materials with complex microstructures.
method A hybrid surrogate framework combining a conditional denoising diffusion probabilistic model (cDDPM) and a modified DeepONet.
result The hybrid model consistently outperforms traditional methods by one to two orders of magnitude.
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.
PRISMA uses PDE residuals for fast, robust, and accurate inference.
problem Slow gradient-based optimization and instability in PDE residual-based methods.
method Integrates PDE residuals directly into the model's architecture via attention mechanisms in the spectral domain.
result Competitive accuracy with significantly lower inference costs and faster speeds.
The paper analyzes diffusion condensation for data geometry and topology.
problem Understanding the geometry and topology of high-dimensional data.
method Time-inhomogeneous diffusion process with geometric, spectral, and topological analysis.
result The condensation process defines intrinsic condensation homology and ambient persistent homology.
Spectral clustering is widely used to partition graphs into distinct modules or communities. Existing methods for spectral clustering use the eigenvalues and eigenvectors of the graph Laplacian, an operator that is closely associated with random walks on graphs. We propose a new spectral partitioning method that exploi…
SpecGrad improves neural vocoder sound quality by adapting diffusion noise to log-mel spectrogram.
problem Improving neural vocoder sound quality, especially in high-frequency bands.
method Adapting the diffusion noise distribution to the conditioning log-mel spectrogram through time-varying filtering.
result SpecGrad generates higher-fidelity speech waveform than conventional DDPM-based neural vocoders.
Novel framework for learning infinitesimal generator of stochastic processes.
problem Challenges in learning infinitesimal generator due to unbounded nature and state space dimensionality.
method Introduces a novel framework based on energy functional, integrates physical priors, and uses reduced-rank estimator in RKHS.
result Learning bounds independent of state space dimension and non-spurious spectral estimation.
New algorithm clusters hyperspectral images at multiple scales.
problem Clustering hyperspectral images at various scales.
method M-SRDL algorithm using spectral-spatial diffusion distances.
result More accurate clustering labels achieved with spatial regularization.
Graph convolution is the core of most Graph Neural Networks (GNNs) and usually approximated by message passing between direct (one-hop) neighbors. In this work, we remove the restriction of using only the direct neighbors by introducing a powerful, yet spatially localized graph convolution: Graph diffusion convolution …
Extends SGM to functional spaces for multimodal data.
problem Modeling densities in functional spaces.
method Represent data in spectral space, dissociate stochastic and space-time components, use SGM for sampling.
result Demonstrates effectiveness on multimodal datasets.
We consider the optimal stopping of a class of spectrally negative jump diffusions. We state a set of conditions under which the value is shown to have a representation in terms of an ordinary nonlinear programming problem. We establish a connection between the considered problem and a stopping problem of an associated…
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.
New algorithm tackles regression on manifold data using diffusion and semi-supervised learning.
problem Regression on high-dimensional manifold data with complex structures.
method Diffusion-based spectral algorithm using graph Laplacian and heat kernel.
result Algorithm achieves convergence rate dependent on intrinsic manifold dimension, avoiding curse of dimensionality.
Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a d-dimensional compact submanifold M in RD, we establish the spectral convergence rate…
Paper proposes a new method for training diffusion models using Markov operators.
problem Training efficiency and accuracy in diffusion models.
method Operator-informed score matching using spectral decomposition of Markov operators.
result Improved score matching for both low and high-dimensional distributions.
New method circumvents curse of dimensionality in Laplacian estimation.
problem High-dimensional data challenges spectral clustering and diffusion maps.
method Kernelized Laplacian estimation via reproducing kernel Hilbert space.
result Non-asymptotic statistical rates show improved performance in high dimensions.
This work analyzes PINNs for advection-diffusion equations using NTK theory.
problem Understanding and resolving the training difficulties of PINNs for advection-diffusion equations.
method Neural Tangent Kernel (NTK) analysis of PINNs for the linear advection-diffusion equation (LAD).
result PINNs struggle due to spectral bias and convergence rate disparity, especially in advection-dominated and diffusion-dominated regimes.
Survey of Laplacian-based methods for data dimensionality reduction and embedding.
problem Efficiently reducing high-dimensional data to lower dimensions while preserving important features and structures.
method Laplacian-based methods including spectral clustering, Laplacian eigenmap, locality preserving projection, graph embedding, and diffusion map.
result Comprehensive overview of various optimization variants and applications of Laplacian-based techniques.
ParPIC clusters directed graphs using random walks and diffusion operators.
problem Challenges in vertex-level clustering for directed graphs due to edge directionality.
method Parametrized Power-Iteration Clustering (ParPIC) based on reversible random walks and diffusion operators.
result ParPIC achieves competitive clustering accuracy with improved scalability compared to spectral and teleportation-based methods.
Fairness-aware diffusion for graph neural networks
problem Fairness in graph neural networks
method Adapting diffusion process with fairness-aware modifications
result Improves fairness metrics with minimal additional cost
Study on curve diffusion flows with scale-critical curvature term.
problem Analyzing stability of curve diffusion flows with scale-critical curvature.
method Introduced and studied a one-parameter family of curve diffusion flows with a scale-critical cubic curvature term. Analyzed dynamical stability of homothetic circles using variational methods.
result Established that any small perturbation of an ω-fold circle monotonically approaches the unit ω-circle after rescaling, translation, and reparametrisation. This paper proposes and analyzes a novel clustering algorithm that combines graph-based diffusion geometry with techniques based on density and mode estimation. The proposed method is suitable for data generated from mixtures of distributions with densities that are both multimodal and have nonlinear shapes. A crucial …
DM uses semigroup property to tune diffusion time for better data analysis.
problem Difficulty in tuning diffusion time for optimal data analysis.
method Proposes a semigroup criterion to select diffusion time.
result Effective and robust method for picking diffusion time.
Two adaptive kernel selection methods improve the accuracy of Kernelized Diffusion Maps.
problem Selecting an appropriate kernel for Kernelized Diffusion Maps.
method Two complementary approaches: variational outer loop and unsupervised cross-validation.
result Both methods improve the quality and stability of the recovered eigenfunctions.
Recursive training of generative models can lead to model collapse, and the recursion converges to a unique limiting distribution.
problem Model collapse in recursive training of generative models
method Recursive training on their own outputs
result Recursive training converges to a unique limiting distribution
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.
Unified framework for generating meteorological time series from text.
problem Lack of large-scale, physically grounded multimodal datasets and architectures ignoring spectral-temporal structure.
method Introduce MeteoCap-3B dataset and MTransformer model.
result State-of-the-art generation quality, accurate cross-modal alignment, strong semantic controllability.
We propose a spatial diffuseness feature for deep neural network (DNN)-based automatic speech recognition to improve recognition accuracy in reverberant and noisy environments. The feature is computed in real-time from multiple microphone signals without requiring knowledge or estimation of the direction of arrival, an…
Clustering is concerned with coherently grouping observations without any explicit concept of true groupings. Spectral graph clustering - clustering the vertices of a graph based on their spectral embedding - is commonly approached via K-means (or, more generally, Gaussian mixture model) clustering composed with either…
Stock price change in financial market occurs through transactions in analogy with diffusion in stochastic physical systems. The analysis of price changes in real markets shows that long-range correlations of price fluctuations largely depend on the number of transactions. We introduce the multiplicative stochastic mod…