Research map / Learning theory and algorithms / Optimal transport
FFT-OT: A Fast Algorithm for Optimal Transportation
Na Lei, Xianfeng Gu
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 |
|---|---|---|---|
| increase grid resolution from 512 to 1k | FFT-OT · Buddha surface | speedup over Su et al.: 39.198 -> 101.450 | Improved |
| increase grid resolution from 512 to 1k | FFT-OT · Female face | speedup over Su et al.: 52.323 -> 167.834 | Improved |
| increase grid resolution from 512 to 1k | FFT-OT · David head | speedup over Su et al.: 8.482 -> 17.239 | Improved |
| increase grid resolution from 1k to 2k | FFT-OT · Buddha surface | runtime (s): 11.8304 -> 97.8272 | Hurt |
| increase grid resolution from 1k to 2k | FFT-OT · Brain cortical surface | runtime (s): 80.9929 -> 705.6193 | Hurt |
| replace convex geometric optimization with FFT-OT | OT map computation · Buddha surface 1k x 1k | runtime (s): 1200.189 -> 11.8304 | Improved |
| increase resolution n | FFT-OT · Buddha and brain surfaces | L2 approximation error: En proportional to 1/n^2 | Improved |
Closest papers by meaning
- Estimation of Stochastic Optimal Transport Maps (NeurIPS 2025 · similarity 0.86)
- Optimal Transport with Cyclic Symmetry (AAAI 2024 · similarity 0.86)
- Improving Neural Optimal Transport via Displacement Interpolation (ICLR 2025 · similarity 0.85)
- Overcoming Spurious Solutions in Semi-Dual Neural Optimal Transport: A Smoothing Approach for Learning the Optimal Transport Plan (ICML 2025 · similarity 0.84)
- Linear Spherical Sliced Optimal Transport: A Fast Metric for Comparing Spherical Data (ICLR 2025 · similarity 0.84)
- Progressive Entropic Optimal Transport Solvers (NeurIPS 2024 · similarity 0.84)
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.
