SOURCE-LINKED INTELLIGENCE

Curvature-Independent Regret Bounds for Distributed Online Optimization on Hadamard Manifolds

arXiv · AI, language, vision and robotics · article · Sep 12, 2026 · UTC

This work addresses decentralized online Riemannian optimization on Hadamard manifolds. Prior work under geodesic convexity (g-convexity) may require curvature information in the optimization analysis, typically through a finite lower bound on the sectional curvature. Curvature may also enter the step size or contraction factor of tangent-space Riemannian consensus schemes. In this work, we relax the curvature dependence for a narrower class of horospherical convex (h-convex) functions. We study Distributed Riemannian Online Gradient Descent (D-ROGD), which combines local Riemannian h-subgradi

Read original source ↗ Open in workspace

recordType

paper

region

Global