Research map / Learning theory and algorithms / Optimal transport
A Direct tilde{O}(1/epsilon) Iteration Parallel Algorithm for Optimal Transport
Arun Jambulapati, Aaron Sidford, Kevin Tian
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use optimized regularizer size and step sizes (ablation) | Dual extrapolation · MNIST | matrix-vector multiplications | Improved |
| Use unoptimized settings (ablation) | Dual extrapolation · MNIST | matrix-vector multiplications | Hurt |
| Use Sinkhorn iteration instead of a first-order method | Optimal transport methods · MNIST | matrix-vector multiplications | Improved |
| Use optimized dual extrapolation instead of conservatively-regularized Sinkhorn | Optimal transport methods · MNIST | matrix-vector multiplications | Improved |
Closest papers by meaning
- A Truncated Newton Method for Optimal Transport (ICLR 2025 · similarity 0.87)
- A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem (NeurIPS 2024 · similarity 0.87)
- A Provably Convergent and Practical Algorithm for Gromov–Wasserstein Optimal Transport (NeurIPS 2026 · similarity 0.87)
- Geometry-Aware Optimal Transport: Fast Intrinsic Dimension and Wasserstein Distance Estimation (NeurIPS 2026 · similarity 0.86)
- Optimal Transport Barycenter via Nonconvex-Concave Minimax Optimization (ICML 2025 · similarity 0.86)
- Tree-Sliced Wasserstein Distance: A Geometric Perspective (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.
