Finite sample bounds for barycenter estimation in geodesic spaces
Not on the map. Why?
Abstract (arXiv)
We study the problem of estimating the barycenter of a distribution given i.i.d. data in a geodesic space. Assuming an upper curvature bound in Alexandrov's sense and a support condition ensuring the strong geodesic convexity of the barycenter problem, we establish finite-sample error bounds in expectation and with high probability. Our results generalize Hoeffding- and Bernstein-type concentration inequalities from Euclidean to geodesic spaces. Building on these concentration inequalities, we derive statistical guarantees for two efficient algorithms for the computation of barycenters.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 8 of its 56 references that are in the map. First posted on arXiv 19 Feb 2025.
Builds on
8 of 56 references.
References · 8
- 2013Fast Computation of Wasserstein Barycenterscited by 216
- 2016First-order Methods for Geodesically Convex Optimizationcited by 93
- 2021Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descentcited by 32
- 2021Wasserstein barycenters are NP-hard to computecited by 28
- 2020Wasserstein barycenters can be computed in polynomial time in fixed dimensioncited by 23
- 2021Differential Privacy Over Riemannian Manifoldscited by 16
- 2018Towards Riemannian Accelerated Gradient Methodscited by 12
- 2023Minimizing Dynamic Regret on Geodesic Metric Spacescited by 6
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026K-means with learned metricscited by 0
- 2026K-means with learned metrics15 Mar 2026