Acceleration in Hyperbolic and Spherical Spaces

12/07/2020
by   David Martinez Rubio, et al.
0

We further research on the acceleration phenomenon on Riemannian manifolds by introducing the first global first-order method that achieves the same rates as accelerated gradient descent in the Euclidean space for the optimization of smooth and geodesically convex (g-convex) or strongly g-convex functions defined on the hyperbolic space or a subset of the sphere, up to constants and log factors. To the best of our knowledge, this is the first method that is proved to achieve these rates globally on functions defined on a Riemannian manifold ℳ other than the Euclidean space. Additionally, for any Riemannian manifold of bounded sectional curvature, we provide reductions from optimization methods for smooth and g-convex functions to methods for smooth and strongly g-convex functions and vice versa. As a proxy, we solve a constrained non-convex Euclidean problem, under a condition between convexity and quasar-convexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/25/2021

Negative curvature obstructs acceleration for geodesically convex optimization, even with exact first-order oracles

Hamilton and Moitra (2021) showed that, in certain regimes, it is not po...
research
09/23/2003

Fast Verification of Convexity of Piecewise-linear Surfaces

We show that a realization of a closed connected PL-manifold of dimensio...
research
08/05/2020

An accelerated first-order method for non-convex optimization on manifolds

We describe the first gradient methods on Riemannian manifolds to achiev...
research
11/26/2022

Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties

We propose a globally-accelerated, first-order method for the optimizati...
research
01/14/2021

No-go Theorem for Acceleration in the Hyperbolic Plane

In recent years there has been significant effort to adapt the key tools...
research
07/24/2023

Open Problem: Polynomial linearly-convergent method for geodesically convex optimization?

Let f ℳ→ℝ be a Lipschitz and geodesically convex function defined on a d...
research
05/18/2019

Trajectory Optimization on Manifolds: A Theoretically-Guaranteed Embedded Sequential Convex Programming Approach

Sequential Convex Programming (SCP) has recently gained popularity as a ...

Please sign up or login with your details

Forgot password? Click here to reset