Closed-form geodesics and trust-region method to calculate Riemannian logarithms on Stiefel and its quotient manifolds

• URL: http://arxiv.org/abs/2103.13327v1
• Date: Fri, 12 Mar 2021 16:48:38 GMT
• Title: Closed-form geodesics and trust-region method to calculate Riemannian logarithms on Stiefel and its quotient manifolds
• Authors: Du Nguyen
• Abstract summary: We provide two closed-form geodesic formulas for a family of metrics on Stiefel manifold, parameterized by two positive numbers. We show the logarithm map and geodesic distance between two endpoints on the manifold could be computed by it minimizing this square distance by a it trust-region solver.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We provide two closed-form geodesic formulas for a family of metrics on Stiefel manifold, parameterized by two positive numbers, having both the embedded and canonical metrics as special cases. The closed-form formulas allow us to compute geodesics by matrix exponential in reduced dimension for low-rank manifolds. Combining with the use of Fr{\'e}chet derivatives to compute the gradient of the square Frobenius distance between a geodesic ending point to a given point on the manifold, we show the logarithm map and geodesic distance between two endpoints on the manifold could be computed by {\it minimizing} this square distance by a {\it trust-region} solver. This leads to a new framework to compute the geodesic distance for manifolds with known geodesic formula but no closed-form logarithm map. We show the approach works well for Stiefel as well as flag manifolds. The logarithm map could be used to compute the Riemannian center of mass for these manifolds equipped with the above metrics. We also deduce simple trigonometric formulas for the Riemannian exponential and logarithm maps on the Grassmann manifold.

Related papers

• Bounds on the geodesic distances on the Stiefel manifold for a family of Riemannian metrics [2.913033886371052]
  We give bounds on geodesic distances on the Stiefel manifold. These bounds aim at improving the theoretical guarantees and performance of minimal geodesic algorithms.
  arXiv  Detail & Related papers  (2024-07-25T08:27:03Z)
• Decentralized Riemannian Conjugate Gradient Method on the Stiefel Manifold [59.73080197971106]
  This paper presents a first-order conjugate optimization method that converges faster than the steepest descent method. It aims to achieve global convergence over the Stiefel manifold.
  arXiv  Detail & Related papers  (2023-08-21T08:02:16Z)
• Curvature-Independent Last-Iterate Convergence for Games on Riemannian Manifolds [77.4346324549323]
  We show that a step size agnostic to the curvature of the manifold achieves a curvature-independent and linear last-iterate convergence rate. To the best of our knowledge, the possibility of curvature-independent rates and/or last-iterate convergence has not been considered before.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)
• Short and Straight: Geodesics on Differentiable Manifolds [6.85316573653194]
  In this work, we first analyse existing methods for computing length-minimising geodesics. Second, we propose a model-based parameterisation for distance fields and geodesic flows on continuous manifold. Third, we develop a curvature-based training mechanism, sampling and scaling points in regions of the manifold exhibiting larger values of the Ricci scalar.
  arXiv  Detail & Related papers  (2023-05-24T15:09:41Z)
• GraphWalks: Efficient Shape Agnostic Geodesic Shortest Path Estimation [93.60478281489243]
  We propose a learnable network to approximate geodesic paths on 3D surfaces. The proposed method provides efficient approximations of the shortest paths and geodesic distances estimations.
  arXiv  Detail & Related papers  (2022-05-30T16:22:53Z)
• q-Paths: Generalizing the Geometric Annealing Path using Power Means [51.73925445218366]
  We introduce $q$-paths, a family of paths which includes the geometric and arithmetic mixtures as special cases. We show that small deviations away from the geometric path yield empirical gains for Bayesian inference.
  arXiv  Detail & Related papers  (2021-07-01T21:09:06Z)
• Curvatures of Stiefel manifolds with deformation metrics [0.0]
  We compute curvatures of a family of tractable metrics on Stiefel manifold. The metrics could be identified with the Cheeger deformation metrics.
  arXiv  Detail & Related papers  (2021-05-05T02:13:38Z)
• Bayesian Quadrature on Riemannian Data Manifolds [79.71142807798284]
  A principled way to model nonlinear geometric structure inherent in data is provided. However, these operations are typically computationally demanding. In particular, we focus on Bayesian quadrature (BQ) to numerically compute integrals over normal laws. We show that by leveraging both prior knowledge and an active exploration scheme, BQ significantly reduces the number of required evaluations.
  arXiv  Detail & Related papers  (2021-02-12T17:38:04Z)
• Learning High Dimensional Wasserstein Geodesics [55.086626708837635]
  We propose a new formulation and learning strategy for computing the Wasserstein geodesic between two probability distributions in high dimensions. By applying the method of Lagrange multipliers to the dynamic formulation of the optimal transport (OT) problem, we derive a minimax problem whose saddle point is the Wasserstein geodesic. We then parametrize the functions by deep neural networks and design a sample based bidirectional learning algorithm for training.
  arXiv  Detail & Related papers  (2021-02-05T04:25:28Z)
• Operator-valued formulas for Riemannian Gradient and Hessian and families of tractable metrics [0.0]
  We provide a formula for a quotient of a manifold embedded in an inner product space with a non-constant metric function. We extend the list of potential metrics that could be used in manifold optimization and machine learning.
  arXiv  Detail & Related papers  (2020-09-21T20:15:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.