Research map / Learning theory and algorithms / Optimal transport
Approximate Discrete Optimal Transport Plan with Auxiliary Measure Method
Dongsheng An, 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 |
|---|---|---|---|
| use auxiliary-measure plan instead of Sinkhorn | discrete OT solver · Color transfer autumn -> comunion | estimated OT cost: 88.7535 -> 87.4280 | Improved |
| use auxiliary-measure plan instead of Sinkhorn | discrete OT solver · Color transfer autumn -> graffiti | estimated OT cost: 131.0952 -> 129.6989 | Improved |
| use auxiliary-measure plan instead of Sinkhorn | discrete OT solver · Color transfer comunion -> rainbow | estimated OT cost: 39.7300 -> 39.4653 | Improved |
| use auxiliary-measure plan instead of SOT | discrete OT solver · Color transfer (6 image pairs) | valid transport plan | Improved |
| use a uniform auxiliary measure where nu1 is sampled, instead of a Gaussian mixture (ablation) | auxiliary measure method · Synthetic d=5 (1000x2000 and 1500 assignment) | transport cost | Improved |
| use a Gaussian mixture auxiliary measure instead of the uniform one (ablation) | auxiliary measure method · Synthetic d=5 | sparsity and running time | Improved |
| decrease mu-volume accuracy threshold theta (ablation) | SDOT sparsity estimation · Synthetic d=5 | transport cost | Improved |
| increase number of nearest neighbours k used to extend S (ablation) | auxiliary measure method · Synthetic d=5 | transport cost vs sparsity and time | Mixed |
Closest papers by meaning
- Stochastic Optimization in Semi-Discrete Optimal Transport: Convergence Analysis and Minimax Rate (NeurIPS 2025 · similarity 0.90)
- A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem (NeurIPS 2024 · similarity 0.88)
- The Sparse-Plus-Low-Rank Quasi-Newton Method for Entropic-Regularized Optimal Transport (ICML 2025 · similarity 0.87)
- Expected Sliced Transport Plans (ICLR 2025 · similarity 0.87)
- Optimal Transport with Tempered Exponential Measures (AAAI 2024 · similarity 0.87)
- Overcoming Spurious Solutions in Semi-Dual Neural Optimal Transport: A Smoothing Approach for Learning the Optimal Transport Plan (ICML 2025 · similarity 0.87)
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.
