Research map / Learning theory and algorithms / Optimal transport
On the Complexity of Approximating Multimarginal Optimal Transport
Tianyi Lin, Nhat Ho, Marco Cuturi, Michael I. Jordan
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
- Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm (ICML 2018 · similarity 0.92)
- A fast and accurate splitting method for optimal transport: analysis and implementation (ICLR 2022 · similarity 0.90)
- On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm (ICML 2020 · similarity 0.90)
- A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem (NeurIPS 2024 · similarity 0.88)
- Bisimulation Metrics are Optimal Transport Distances, and Can be Computed Efficiently (NeurIPS 2024 · similarity 0.88)
- A Truncated Newton Method for Optimal Transport (ICLR 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.
