Tight lower bounds for Lipschitz geodesically convex optimization on hyperbolic space
We determine the dimension-independent first-order query complexity of minimizing a Lipschitz geodesically convex (g-convex) function on hyperbolic space. Given a ball of radius $r$ containing a global minimizer, we prove that $\Omega(\zeta_r/\epsilon^2)$ queries are necessary to attain accuracy $\epsilon Mr$, where $M...