Manifold Free Riemannian Optimization

09/07/2022
by   Boris Shustin, et al.
0

Riemannian optimization is a principled framework for solving optimization problems where the desired optimum is constrained to a smooth manifold ℳ. Algorithms designed in this framework usually require some geometrical description of the manifold, which typically includes tangent spaces, retractions, and gradients of the cost function. However, in many cases, only a subset (or none at all) of these elements can be accessed due to lack of information or intractability. In this paper, we propose a novel approach that can perform approximate Riemannian optimization in such cases, where the constraining manifold is a submanifold of ^D. At the bare minimum, our method requires only a noiseless sample set of the cost function (_i, y_i)∈ℳ×ℝ and the intrinsic dimension of the manifold ℳ. Using the samples, and utilizing the Manifold-MLS framework (Sober and Levin 2020), we construct approximations of the missing components entertaining provable guarantees and analyze their computational costs. In case some of the components are given analytically (e.g., if the cost function and its gradient are given explicitly, or if the tangent spaces can be computed), the algorithm can be easily adapted to use the accurate expressions instead of the approximations. We analyze the global convergence of Riemannian gradient-based methods using our approach, and we demonstrate empirically the strength of this method, together with a conjugate-gradients type method based upon similar principles.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/21/2023

Decentralized Riemannian Conjugate Gradient Method on the Stiefel Manifold

The conjugate gradient method is a crucial first-order optimization meth...
research
07/31/2019

Improved Pose Graph Optimization for Planar Motions Using Riemannian Geometry on the Manifold of Dual Quaternions

We present a novel Riemannian approach for planar pose graph optimizatio...
research
08/16/2023

Warped geometric information on the optimisation of Euclidean functions

We consider the fundamental task of optimizing a real-valued function de...
research
06/01/2023

Gauss-Southwell type descent methods for low-rank matrix optimization

We consider gradient-related methods for low-rank matrix optimization wi...
research
07/20/2020

Approximating the Riemannian Metric from Point Clouds via Manifold Moving Least Squares

The approximation of both geodesic distances and shortest paths on point...
research
03/29/2023

Infeasible Deterministic, Stochastic, and Variance-Reduction Algorithms for Optimization under Orthogonality Constraints

Orthogonality constraints naturally appear in many machine learning prob...
research
03/25/2020

Zeroth-order Optimization on Riemannian Manifolds

We propose and analyze zeroth-order algorithms for optimization over Rie...

Please sign up or login with your details

Forgot password? Click here to reset