Related papers: Geodesic regression
In this work, we analyze two of the most fundamental algorithms in geodesically convex optimization: Riemannian gradient descent and (possibly inexact) Riemannian proximal point. We quantify their rates of convergence and produce different…
We propose a new metric between probability measures on a compact metric space that mirrors the Riemannian manifold-like structure of quadratic optimal transport but includes entropic regularization. Its metric tensor is given by the…
In this paper, the Riemannian gradient algorithm and the natural gradient algorithm are applied to solve descent direction problems on the manifold of positive definite Hermitian matrices, where the geodesic distance is considered as the…
We give an accessible introduction and elaboration on the methods used in obtaining a geodesic, which is the curve of shortest length connecting two points lying on the surface of a function. This is found through computing what's known as…
We develop a new Riemannian descent algorithm that relies on momentum to improve over existing first-order methods for geodesically convex optimization. In contrast, accelerated convergence rates proved in prior work have only been shown to…
A fundamental result of thermodynamic geometry is that the optimal, minimal-work protocol that drives a nonequilibrium system between two thermodynamic states in the slow-driving limit is given by a geodesic of the friction tensor, a…
The goal of inversion is to estimate the model which generates the data of observations with a specific modeling equation. One general approach to inversion is to use optimization methods which are algebraic in nature to define an objective…
Shape optimization is commonly applied in engineering to optimize shapes with respect to an objective functional relying on PDE solutions. In this paper, we view shape optimization as optimization on Riemannian shape manifolds. We consider…
Machine learning problems have an intrinsic geometric structure as central objects including a neural network's weight space and the loss function associated with a particular task can be viewed as encoding the intrinsic geometry of a given…
Given a compact manifold with boundary with unknown Riemannian metric. The problem is to reconstruct the metric in a class of conformal metrics from knowledge of lengths of all closed geodesics (kinematic data). An integral inequality is…
Deep generative models learn a mapping from a low dimensional latent space to a high-dimensional data space. Under certain regularity conditions, these models parameterize nonlinear manifolds in the data space. In this paper, we investigate…
Many geometric machine learning and image analysis applications, require a left-invariant metric on the 5D homogeneous space of 3D positions and orientations SE(3)/SO(2). This is done in Equivariant Neural Networks (G-CNNs), or in PDE-Based…
Based on a local approximation of the Riemannian distance on a manifold by a computationally cheap dissimilarity measure, a time discrete geodesic calculus is developed, and applications to shape space are explored. The dissimilarity…
We propose a metric learning paradigm, Regression-based Elastic Metric Learning (REML), which optimizes the elastic metric for geodesic regression on the manifold of discrete curves. Geodesic regression is most accurate when the chosen…
The aim of this paper is the study of the geodesic distance in operator groups with several Riemannian metrics. More precisely we study the geodesic distance in self-adjoint operator groups with the left invariant Riemannian metric induced…
Manifolds discovered by machine learning models provide a compact representation of the underlying data. Geodesics on these manifolds define locally length-minimising curves and provide a notion of distance, which are key for reduced-order…
This paper studies the problem of distributed Riemannian optimization over a network of agents whose cost functions are geodesically smooth but possibly geodesically non-convex. Extending a well-known distributed optimization strategy…
For the complex of curves of a closed orientable surface of genus $g$, $\mathcal{C}(S_{g>1})$, the notion of efficient geodesic in was introduced in arXiv:1408.4133. There it was established that there always exists (finitely many)…
In this paper we study the notion of geodesic curvature of smooth horizontal curves parametrized by arc lenght in the Heisenberg group, that is the simplest sub-Riemannian structure. Our goal is to give a metric interpretation of this…
We investigate the geometrical structure of probabilistic generative dimensionality reduction models using the tools of Riemannian geometry. We explicitly define a distribution over the natural metric given by the models. We provide the…