Research map / Graph learning / Graph self-supervised learning
Hamilton-Jacobi equations on graphs with applications to semi-supervised learning and data depth
Jeff Calder, Mahmood Ettehad
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
- Fermat Distances: Metric Approximation, Spectral Convergence, and Clustering Algorithms (JMLR 2024 · similarity 0.86)
- Euclidean Embedding of Data Using Local Distances (NeurIPS 2026 · similarity 0.86)
- A Gromov--Wasserstein Geometric View of Spectrum-Preserving Graph Coarsening (ICML 2023 · similarity 0.84)
- Learning Distances from Data with Normalizing Flows and Score Matching (ICML 2025 · similarity 0.84)
- Aligning Embeddings and Geometric Random Graphs: Informational Results and Computational Approaches for the Procrustes-Wasserstein Problem (NeurIPS 2024 · similarity 0.84)
- Fast Wasserstein rates for estimating probability distributions of probabilistic graphical models (NeurIPS 2026 · similarity 0.83)
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.
