Research map / Learning theory and algorithms / Optimal transport
Regularized Optimal Transport and the Rot Mover's Distance
Arnaud Dessein, Nicolas Papadakis, Jean-Luc Rouas
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
- Efficient Discrete Multi Marginal Optimal Transport Regularization (ICLR 2023 · similarity 0.90)
- Regularized Optimal Transport is Ground Cost Adversarial (ICML 2020 · similarity 0.89)
- Geometry-Aware Optimal Transport: Fast Intrinsic Dimension and Wasserstein Distance Estimation (NeurIPS 2026 · similarity 0.87)
- Sparsistency for inverse optimal transport (ICLR 2024 · similarity 0.87)
- Safe and Sparse Newton Method for Entropic-Regularized Optimal Transport (NeurIPS 2024 · similarity 0.86)
- Decreasing Entropic Regularization Averaged Gradient for Semi-Discrete Optimal Transport (NeurIPS 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.
