We introduce Ordered Diffusion Kernels (ODKs), a novel class of local kernels that can approximate the infinitesimal generator of an arbitrary It\^o Stochastic Differential Equation (SDE). ODKs are designed to be applied to data sampled from dynamical systems where little dynamical information is available a priori. The Laplacian of classical diffusion kernels approximates the Laplace-Beltrami operator on the underlying manifold; adjusting the normalisation introduces an advection term that depends on the sampling density; recently, TMDmap generalised this normalisation to target an arbitrary measure, but at the cost of coupling advection to diffusion. More general local kernels can learn arbitrary second-order elliptic operators but are formulated in terms of known velocity fields --- making the first step of any analysis a potentially ill-posed inference problem. To formulate ODK, we first relax the problem of potential estimation to the more tractable task of inferring an ordering of the data, which we represent through an ordering function. We prove ODK's Laplacian converges to the infinitesimal generator of a gradient-flow SDE with state-dependent isotropic diffusion, without coupling advection and diffusion. We provide various extensions of ODK to: arbitrary drifts via local ordering functions; anisotropic diffusions via a Strang splitting scheme; multiple ordering functions; and self-tuning bandwidths. In addition, we introduce two loss functions which exploit the structure of ODKs to solve a non-parametric inference problem. We validate this framework on synthetic data from deterministic and stochastic systems, demonstrating accurate recovery of operators, velocity fields, extrinsic curvature, and spatially dependent drift and diffusion coefficients.
We introduce weighted Laplacian flow (WLF), a deterministic particle-flow framework for sampling from a target distribution known only up to normalization. The proposed method evolves the logarithmic density ratio through a transport equation and determines the particle velocity from a target-weighted Poisson problem,...
Probability-flow ordinary differential equations (PF-ODEs) are widely used as deterministic samplers for score-based diffusion models. Their usual justification is that the Fokker--Planck equation of a diffusion can be rewritten as a continuity equation driven by the score function of the forward diffusion. This identi...
It is shown that the work-minimizing optimal protocol in the slow-driving limit coincides precisely with an expectation geodesic of the statistical manifold with non-metricity equipped with $(g, {}^{(1/2)}\Gamma, {}^{(-1/2)}\Gamma)$, highlighting the active physical role of non-metricity in information geometry.
Diffusion models rely on numerical solvers requiring time-discretization, which has a large influence on the tradeoff between sampling cost and quality. However, the computational difficulty of the reverse process varies along the sampling trajectory and across data distributions, making the choice of discretization im...
This work constructs a Gaussian random-field approximation whose velocity field matches the mean and covariance of the original stochastic gradient, and shows that the Gaussian approximation captures the SGD dynamics with second-order weak accuracy.
Maria Oprea, Qin Li, Yu-Nan Yang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.