Research map / Learning theory and algorithms / Clustering
Fermat Distances: Metric Approximation, Spectral Convergence, and Clustering Algorithms
Nicolás García Trillos, Anna Little, Daniel McKenzie, James M. Murphy
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Geometric structure of graph Laplacian embeddings (JMLR 2021 · similarity 0.88)
- Learning Distances from Data with Normalizing Flows and Score Matching (ICML 2025 · similarity 0.88)
- Structure-Aware Spectral Sparsification via Uniform Edge Sampling (NeurIPS 2025 · similarity 0.87)
- Matrix factorisation and the interpretation of geodesic distance (NeurIPS 2021 · similarity 0.87)
- Hamilton-Jacobi equations on graphs with applications to semi-supervised learning and data depth (JMLR 2022 · similarity 0.86)
- Euclidean Embedding of Data Using Local Distances (NeurIPS 2026 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
