mlsanityData to 7 Oct 2026

Choosing the parameter of the Fermat distance: navigating geometry and noise

arXiv 2311.18663 ↗First posted 30 Nov 2023stat.ML cs.AI cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

The Fermat distance has been recently established as a useful tool for machine learning tasks when a natural distance is not directly available to the practitioner or to improve the results given by Euclidean distances by exploding the geometrical and statistical properties of the dataset. This distance depends on a parameter α that greatly impacts the performance of subsequent tasks. Ideally, the value of α should be large enough to navigate the geometric intricacies inherent to the problem. At the same, it should remain restrained enough to sidestep any deleterious ramifications stemming from noise during the process of distance estimation. We study both theoretically and through simulations how to select this parameter.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 29 references that are in the map. First posted on arXiv 30 Nov 2023.

Builds on

7 of 29 references.

References · 7

  1. 2020Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlationcited by 420
  2. 2020Balancing Geometry and Density: Path Distances on High-Dimensional Datacited by 16
  3. 2023Fermat Distances: Metric Approximation, Spectral Convergence, and Clustering Algorithmscited by 12
  4. 2019Power Weighted Shortest Paths for Clustering Euclidean Datacited by 10
  5. 2019A flexible EM-like clustering algorithm for noisy datacited by 10
  6. 2020Intrinsic persistent homology via density-based metric learningcited by 9
  7. 2022Hamilton-Jacobi equations on graphs with applications to semi-supervised learning and data depthcited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.