pith. sign in

arxiv: 1805.08207 · v2 · pith:KR562SSWnew · submitted 2018-05-18 · 🧮 math.OC

Gradient descent in hyperbolic space

classification 🧮 math.OC
keywords gradienthyperbolicspacedescentemployingmodeloptimisationpoint
0
0 comments X
read the original abstract

Gradient descent generalises naturally to Riemannian manifolds, and to hyperbolic $n$-space, in particular. Namely, having calculated the gradient at the point on the manifold representing the model parameters, the updated point is obtained by travelling along the geodesic passing in the direction of the gradient. Some recent works employing optimisation in hyperbolic space have not attempted this procedure, however, employing instead various approximations to avoid a calculation that was considered to be too complicated. In this tutorial, we demonstrate that in the hyperboloid model of hyperbolic space, the necessary calculations to perform gradient descent are in fact straight-forward. The advantages of the approach are then both illustrated and quantified for the optimisation problem of computing the Fr\'echet mean (i.e. barycentre) of points in hyperbolic space.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Riemannian gradient descent method for optimization on the indefinite Stiefel manifold

    math.OC 2024-10 unverdicted novelty 6.0

    Develops Riemannian gradient descent with Cayley retraction on the indefinite Stiefel manifold X^T A X = J, proves global convergence, generalizes orthogonal cases, and applies to eigenvalue problems and Procrustes-ty...