arXiv Machine Learning

Minimax Lower Bound for Estimating Diffusion-based Local Intrinsic Dimension

arXiv:2609. 04822v1 Announce Type: cross Abstract: 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.

arXiv Machine Learning
Aug 10

Convergence of Diffusion Models Under the Manifold Hypothesis in High-Dimensions

arXiv:2409. 18804v3 Announce Type: replace-cross Abstract: Denoising Diffusion Probabilistic Models (DDPM) are powerful state-of-the-art methods used to generate synthetic data from high-dimensional data distributions and are widely used for image, audio, and video generation as well as many more applications in science and beyond.

By Iskander Azangulov, George Deligiannidis, Judith Rousseau
arXiv AI
Jun 8

A Temporal Spatial Minimax Rate for Smoothly-Varying Distributions in Wasserstein Space

arXiv:2606. 07325v1 Announce Type: cross Abstract: We study the minimax rate of estimating a future value $\mu_{t_n+h}$ of a curve $t\mapsto\mu_t$ in the $2$-Wasserstein space $\mathcal{P}_2(\mathbb{R}^d)$ from finitely many noisy snapshots of its past, under an adiabatic bound $\|\nabla_t^k v\|\le\varepsilon$ on the $k$-th covariant derivative of the velocity field.

By Munsik Kim
arXiv Machine Learning
Jul 14

Sharp Concentration Bounds for Bundle-Valued Statistics on Manifolds

arXiv:2607. 10592v1 Announce Type: new Abstract: Many geometric statistics and manifold learning pipelines routinely produce observations -- such as tangent vectors or local frames -- whose natural home is a varying family of fibers attached to different points of a base manifold, rather than a single shared vector space.

By Swagatam Das, Vaclav Snasel
arXiv Machine Learning
Jul 21

Scaling Limits of Constant-Stepsize SGD at Flat Minima

arXiv:2607. 16384v1 Announce Type: new Abstract: For stochastic gradient descent (SGD) with a constant stepsize $\alpha$, the invariant law of the iterates, centered at a minimizer, describes the behavior of the algorithm over long time horizons.

By Jingyi Zhang, Cheng Mao, Debankur Mukherjee