We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

cs.LG

Change to browse by:

References & Citations

DBLP - CS Bibliography

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Computer Science > Machine Learning

Title: Computing distances and means on manifolds with a metric-constrained Eikonal approach

Abstract: Computing distances on Riemannian manifolds is a challenging problem with numerous applications, from physics, through statistics, to machine learning. In this paper, we introduce the metric-constrained Eikonal solver to obtain continuous, differentiable representations of distance functions on manifolds. The differentiable nature of these representations allows for the direct computation of globally length-minimising paths on the manifold. We showcase the use of metric-constrained Eikonal solvers for a range of manifolds and demonstrate the applications. First, we demonstrate that metric-constrained Eikonal solvers can be used to obtain the Fr\'echet mean on a manifold, employing the definition of a Gaussian mixture model, which has an analytical solution to verify the numerical results. Second, we demonstrate how the obtained distance function can be used to conduct unsupervised clustering on the manifold -- a task for which existing approaches are computationally prohibitive. This work opens opportunities for distance computations on manifolds.
Subjects: Machine Learning (cs.LG); Computational Geometry (cs.CG); Metric Geometry (math.MG)
Cite as: arXiv:2404.08754 [cs.LG]
  (or arXiv:2404.08754v1 [cs.LG] for this version)

Submission history

From: Daniel Kelshaw [view email]
[v1] Fri, 12 Apr 2024 18:26:32 GMT (11603kb,D)

Link back to: arXiv, form interface, contact.