Log In Sign Up

Sampling and Optimization on Convex Sets in Riemannian Manifolds of Non-Negative Curvature

by   Navin Goyal, et al.

The Euclidean space notion of convex sets (and functions) generalizes to Riemannian manifolds in a natural sense and is called geodesic convexity. Extensively studied computational problems such as convex optimization and sampling in convex sets also have meaningful counterparts in the manifold setting. Geodesically convex optimization is a well-studied problem with ongoing research and considerable recent interest in machine learning and theoretical computer science. In this paper, we study sampling and convex optimization problems over manifolds of non-negative curvature proving polynomial running time in the dimension and other relevant parameters. Our algorithms assume a warm start. We first present a random walk based sampling algorithm and then combine it with simulated annealing for solving convex optimization problems. To our knowledge, these are the first algorithms in the general setting of positively curved manifolds with provable polynomial guarantees under reasonable assumptions, and the first study of the connection between sampling and optimization in this setting.


page 1

page 2

page 3

page 4


Geodesic Convex Optimization: Differentiation on Manifolds, Geodesics, and Convexity

Convex optimization is a vibrant and successful area due to the existenc...

Fenchel Duality for Convex Optimization and a Primal Dual Algorithm on Riemannian Manifolds

This paper introduces a new duality theory that generalizes the classica...

A Riemannian Corollary of Helly's Theorem

We introduce a notion of halfspace for Hadamard manifolds that is natura...

On a class of geodesically convex optimization problems solved via Euclidean MM methods

We study geodesically convex (g-convex) problems that can be written as ...

Structure-preserving function approximation via convex optimization

Approximations of functions with finite data often do not respect certai...

Convex Optimization with Nonconvex Oracles

In machine learning and optimization, one often wants to minimize a conv...