arXiv Machine Learning By Swagatam Das, Vaclav Snasel

Sharp Concentration Bounds for Bundle-Valued Statistics on Manifolds

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 21

Riemannian Simultaneous Inference for Tangent Vector Field Regression

The paper develops a nonparametric kernel estimator for tangent vector field regression on a Riemannian manifold without boundary, using parallel transport to align responses before averaging. It derives uniform bias, covariance, and stochastic rates, and constructs a simultaneous confidence tube by whitening the tangent norm into a unit‑variance Gaussian field, whose Gumbel limit yields an explicit intrinsic constant. The method is validated through simulations on various manifolds and applied to reconstruct global wind data, demonstrating spatially varying uncertainty.

By Xiaotian Chang, Yangdi Jiang, Qirui Hu
arXiv Machine Learning
Jul 28

Minimax Lower Bounds of Kernel Discrepancy Estimation: MMD, HSIC, KSD

arXiv:2607. 24235v1 Announce Type: cross Abstract: Over the past 20 years, kernel discrepancies have been leveraged as a highly powerful tool for quantifying the disagreement of distributions, with numerous successful applications in two-sample, goodness-of-fit, and independence testing, among others.

By Jose Cribeiro-Ramallo, Florian Kalinke, Zolt\'an Szab\'o
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