Research map / Learning theory and algorithms / Optimal transport
Regularized Optimal Transport is Ground Cost Adversarial
Read the paperCheck your idea against 108,967 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Increase entropy regularization strength ε | Nonnegative adversarial-cost OT · Gaussian measures, d=1000 | difference from classical 2-Wasserstein OT cost | Mixed |
| Increase entropy regularization strength ε | Sinkhorn OT · Gaussian measures, d=1000 | difference from classical 2-Wasserstein OT cost | Mixed |
| Use an adversarially learned one-dimensional metric instead of the classical quadratic cost | OT-based color transfer · Painting color palettes: Modigliani and Schiele | visual color-transfer difference | No clear effect |
Closest papers by meaning
- Sparsistency for inverse optimal transport (ICLR 2024 · similarity 0.90)
- The Sparse-Plus-Low-Rank Quasi-Newton Method for Entropic-Regularized Optimal Transport (ICML 2025 · similarity 0.89)
- Safe and Sparse Newton Method for Entropic-Regularized Optimal Transport (NeurIPS 2024 · similarity 0.88)
- Decreasing Entropic Regularization Averaged Gradient for Semi-Discrete Optimal Transport (NeurIPS 2025 · similarity 0.88)
- Geometry-Aware Optimal Transport: Fast Intrinsic Dimension and Wasserstein Distance Estimation (NeurIPS 2026 · similarity 0.88)
- Analyzing and Improving Optimal-Transport-based Adversarial Networks (ICLR 2024 · similarity 0.88)
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.