Research map / Learning theory and algorithms / Optimal transport
LoBCD-GW: A Fast and Data-Dependent Algorithm for Computing Gromov-Wasserstein Distance via Localized Block Coordinate Descent
Read the paperCheck your idea against 108,967 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
- Outlier-Robust Gromov-Wasserstein for Graph Data (NeurIPS 2023 · similarity 0.89)
- Gromov-Wasserstein at Scale, Beyond Squared Norms (ICML 2026 · similarity 0.89)
- Partial Gromov-Wasserstein Metric (ICLR 2025 · similarity 0.88)
- Linear Partial Gromov-Wasserstein Embedding (ICLR 2025 · similarity 0.87)
- Sliced Inner Product Gromov–Wasserstein Distances (NeurIPS 2026 · similarity 0.87)
- Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distances (ICML 2025 · similarity 0.86)
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.