Fast and Robust Shortest Paths on Manifolds Learned from Data

by   Georgios Arvanitidis, et al.

We propose a fast, simple and robust algorithm for computing shortest paths and distances on Riemannian manifolds learned from data. This amounts to solving a system of ordinary differential equations (ODEs) subject to boundary conditions. Here standard solvers perform poorly because they require well-behaved Jacobians of the ODE, and usually, manifolds learned from data imply unstable and ill-conditioned Jacobians. Instead, we propose a fixed-point iteration scheme for solving the ODE that avoids Jacobians. This enhances the stability of the solver, while reduces the computational cost. In experiments involving both Riemannian metric learning and deep generative models we demonstrate significant improvements in speed and stability over both general-purpose state-of-the-art solvers as well as over specialized solvers.


Geodesic Clustering in Deep Generative Models

Deep generative models are tremendously successful in learning low-dimen...

Bayesian Quadrature on Riemannian Data Manifolds

Riemannian manifolds provide a principled way to model nonlinear geometr...

Learning Neural PDE Solvers with Convergence Guarantees

Partial differential equations (PDEs) are widely used across the physica...

Probabilistic Solutions to Differential Equations and their Application to Riemannian Statistics

We study a probabilistic numerical method for the solution of both bound...

Diffusion Mean Estimation on the Diagonal of Product Manifolds

Computing sample means on Riemannian manifolds is typically computationa...

Riemannian Continuous Normalizing Flows

Normalizing flows have shown great promise for modelling flexible probab...

Statistical Translation, Heat Kernels and Expected Distances

High dimensional structured data such as text and images is often poorly...