While diffusion-based methods have recently emerged as effective tools for probing the intrinsic geometry of high-dimensional data, their statistical difficulty remains largely unexplored. We study estimation of the finite-scale population functional underlying FLIPD (Kamkari et al., 2024; arXiv:2406.03537), a diffusion-based local intrinsic dimension (LID) quantity defined through the logarithmic scale derivative of a Gaussian-smoothed density. Intuitively, Gaussian smoothing turns local dimension into a scale law: near a $d$-dimensional manifold, the kernel mass grows like $\sigma^d$, so differentiating with respect to the noise scale reveals the intrinsic exponent. Under a regular manifold model, we show uniformly over the model class that the finite-scale field differs from the manifold dimension $d$ by at most $O(\sigma^2)$. We then establish a minimax lower bound of order $(n\sigma^d)^{-1}$ for estimating this finite-scale field from $n$ observations, for $n^{-1/(2\alpha+d)}\lesssim\sigma\le\sigma_0$. At the smallest scale covered by our lower-bound construction, the bound becomes the nonparametric rate $n^{-2\alpha/(2\alpha+d)}$.
This work interprets denoising as a dynamical Bayesian classifier, and proves that the KL error bound depends linearly on the maximum intrinsic dimension of a cluster, up to a logarithmic factor, even when $K$ grows polynomially with $D$.
This work studies robust score estimation under Wasserstein perturbations of a reference distribution of Ornstein--Uhlenbeck diffusion and characterize how finite data, intrinsic dimension, and distribution shift affect the robustness of score-based diffusion models.
Wei Luo, N. K. Chada, Shi-Jie Zhang et al.· 0 citations
This work establishes a minimax lower bound under the score-entropy loss, and proposes an MLE-based thresholding estimator that matches this lower bound up to constant and polylogarithmic factors that depend on neighboring density ratios.
This work develops a general framework that separates score discretization from Brownian-motion simulation and allows multiple geodesic random-walk steps per score evaluation and provides a sharper characterization of the convergence and sampling complexity of Riemannian diffusion models.
This work analyzes a continuous two-groups model with Gaussian--Laplace mixtures and derives a prediction-risk bound for the resulting transport-map estimator, thereby reducing the problem to finite-dimensional empirical risk minimization.
This work constructs a cube-to-target map by composing a Gaussian base transformation (the component-wise inverse Gaussian CDF) with an Euler-discretized probability flow ODE, and establishes conditions for diffusion probability-flow transport under mild bounded-derivative assumptions on the learned vector field.
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.