Research map / Optimization / Nonconvex and smooth optimization
Entropic Gromov-Wasserstein Distances: Stability and Algorithms
Gabriel Rioux, Ziv Goldfeld, Kengo Kato
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 |
|---|---|---|---|
| set smoothness parameter L by line search instead of theoretical bound (ablation) | accelerated EGW algorithm · non-convex regime random marginals | average runtime: 10x or larger slowdown with theoretical bound | Improved |
| use accelerated gradient EGW instead of O(N^2) mirror descent | EGW solver · convex regime random marginals | average runtime | No clear effect |
| use line-search L instead of theoretical L, compared with mirror descent | accelerated EGW algorithm · non-convex regime | average runtime | No clear effect |
Closest papers by meaning
- Partial Gromov-Wasserstein Metric (ICLR 2025 · similarity 0.90)
- Linear Partial Gromov-Wasserstein Embedding (ICLR 2025 · similarity 0.90)
- Joint Metric Space Embedding by Unbalanced Optimal Transport with Gromov–Wasserstein Marginal Penalization (ICML 2025 · similarity 0.88)
- Bridging Arbitrary and Tree Metrics via Differentiable Gromov Hyperbolicity (NeurIPS 2025 · similarity 0.87)
- Towards Understanding Gradient Dynamics of the Sliced-Wasserstein Distance via Critical Point Analysis (ICML 2025 · similarity 0.87)
- Tree-Sliced Wasserstein Distance with Nonlinear Projection (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.
