mlsanityData to 14 Oct 2026

Sharp Concentration Bounds for Bundle-Valued Statistics on Manifolds

arXiv 2607.10592 ↗First posted 12 Jul 2026cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

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. Forming empirical averages requires transporting these observations to a common reference fiber, thereby introducing curvature- and holonomy-driven effects that are absent from classical concentration theory. We develop a non-asymptotic concentration theory for such transported empirical means, deriving finite-sample, dimension-free Hoeffding- and Bernstein-type bounds via sharp Hilbert-space inequalities. When shortest paths to the reference point are non-unique, transport becomes path-dependent and introduces a deterministic holonomy bias; we isolate and quantify this bias through bundle curvature and loop geometry, with sharp closed-form formulas for the tangent bundle of a round sphere. The resulting bias-variance decomposition separates the stochastic fluctuation decaying at the classical n-1/2 rate in sample size n, from a curvature-driven error floor that no amount of additional data can eliminate; minimax lower bounds confirm both terms are unavoidable. We further establish a robust median-of-means estimator achieving optimal rates under heavy tails and the central limit theorem in the reference fiber. Controlled experiments on the sphere validate all theoretical predictions.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 2 of its 39 references that are in the map. First posted on arXiv 12 Jul 2026.

Builds on

2 of 39 references.

References · 2

  1. 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,167
  2. 2026Wasserstein Parallel Transport for Predicting the Dynamics of Statistical Systemscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.