Geodesic Metrics for Manifold Aware Machine Learning

This direction is split into other directions: Euclidean distance limitation. Its last version stays readable and citable here.

Version 1 of 1180 papers186 conceptsfrozen 2026-10-04

In high-dimensional machine learning, we often assume that data points are vectors in a flat, Euclidean space. We measure the similarity between two points by drawing a straight line between them—the "as the crow flies" distance. However, most real-world data—whether it is the pixel space of natural images, the activation patterns of a brain, or the embeddings of a language model—does not fill this high-dimensional volume uniformly. Instead, it concentrates on low-dimensional, curved surfaces known as manifolds.

When data lives on a manifold, Euclidean distance becomes a deceptive metric. It suggests that two points are close because the straight line between them is short, even if that line passes through a "void" where no valid data can exist. To truly understand the relationship between points, we must instead measure distance geodesically—following the shortest path along the data's intrinsic surface.

The Failure of Flat Geometry

The fundamental problem with Euclidean metrics in high dimensions is the "short-circuit" effect. As noted by Ricardo Dominguez-Olmedo and Bernhard Schölkopf in On Data Manifolds Entailed by Structural Causal Models, standard distances fail to account for the curvature of the data manifold. This leads to models that suggest "impossible" transitions—for example, a counterfactual explanation that moves a data point through a region of zero probability to reach a target state.

This mismatch is particularly visible in specialized data structures like Symmetric Positive Definite (SPD) matrices, used to model brain connectivity. Dehan Kong and Qiang Sun argue in Modeling Symmetric Positive Definite Matrices with An Application to Functional Brain Connectivity that using flat maps for these curved spaces is as distortive as using a flat paper map to measure the distance between two cities on a globe.

Building the Geodesic Intuition

If the Euclidean distance is a crow flying over a mountain range, the geodesic distance is an ant walking over the peaks and valleys. To calculate this, researchers have developed several ways to "sense" the surface of the data:

  1. Local Approximations: Didong Li and David B. Dunson introduced Spherelets, which use local spherical patches rather than flat planes to approximate the manifold. This captures curvature more accurately than linear methods like PCA.
  2. Diffusion and Random Walks: By simulating a particle diffusing across a graph of data points, we can infer the manifold's shape. Alexander Tong and Guy Wolf utilize this in Diffusion Earth Mover's Distance and Distribution Embeddings to compare entire datasets by following their intrinsic geometric structures.
  3. Graph-Based Paths: In Clustering with the Connectivity Kernel, Bernd Fischer and Volker Roth show that by redefining distance based on the "weakest link" in a path between points, we can transform complex, winding clusters into simple shapes that standard algorithms like K-means can finally understand.

Geometry-Aware Optimization

Once we accept that the world is curved, we must change how we move through it. This is the core of Riemannian Metric Learning (RML). As reviewed by Josua Sassen in Riemannian Metric Learning: Closer to You than You Imagine, RML replaces the uniform "grid" of Euclidean space with a metric tensor that varies depending on where you are on the manifold.

This has profound implications for how AI learns:

The Semantic Bridge

Perhaps the most intuitive argument for geodesic metrics comes from retrieval. In Using Text to Teach Image Retrieval, Haoyu Dong and Guillermo Sapiro explain that measuring distance as a straight line through a high-dimensional void fails to reflect the semantic path between items. By using text to "fill the gaps" in the image manifold, they allow for geodesic measurements that follow the logical, incremental transitions between concepts.

By shifting from the "crow's" Euclidean view to the "ant's" geodesic view, machine learning models stop fighting the natural shape of data and start leveraging it. As Georgios Batzolis and colleagues suggest in Score-based pullback Riemannian geometry, the goal is no longer just to "unroll" the manifold into a flat plane, but to learn to navigate its curves directly.

Papers in this version

Showing 60 of 180 papers.

History & citationVersion 1 · 2026-10-04

Split into other directions · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_geodesic_metrics_for_manifold_aware_mach_7818c00d,
  title = {Geodesic Metrics for Manifold Aware Machine Learning},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/geodesic-metrics-for-manifold-aware-machine-learning/rdr_7818c00d38054b74a021b90e67ab7178},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_geodesic_metrics_for_manifold_aware_mach_7818c00d_v1,
  title = {Geodesic Metrics for Manifold Aware Machine Learning},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/geodesic-metrics-for-manifold-aware-machine-learning/rdr_7818c00d38054b74a021b90e67ab7178/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}