Research map / Point clouds / Point cloud classification
Globally solving the Gromov-Wasserstein problem for point clouds in low dimensional Euclidean spaces
Martin Ryner, Jan Kronqvist, Johan Karlsson
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 |
|---|---|---|---|
| solve concave subproblem by extreme point search instead of Gurobi spatial branch and bound (ablation) | Algorithm 1 · U n=10 dims 2,2 | time (s): 21 (6-47) -> 0.14 (0.07-0.3) | Improved |
| extreme point search instead of B&B (ablation) | Algorithm 1 · U n=500 dims 2,2 | time (s): 408 (269-511) -> 11 (9-16) | Improved |
| extreme point search instead of B&B (ablation) | Algorithm 1 · N1 n=10 dims 2,3 | time (s): 708 (233-1184) -> 0.51 (0.39-0.65) | Improved |
| extreme point search instead of B&B (ablation) | Algorithm 1 · N3 n=2000 dims 3,3 | time (s): 578 (429-691) -> 93 (91-100) | Improved |
| proposed method vs MILP1 formulation | Algorithm 1 · U n=10 dims 2,2 | time (s): 39 (11-58) -> 0.14 (0.07-0.3) | Improved |
| proposed method vs direct Gurobi on larger problems | Algorithm 1 · U n=100 dims 2,2 | time (s): 25 (19-39) -> 0.48 (0.3-0.7) | Improved |
| proposed method vs direct Gurobi on tiny 3D problems | Algorithm 1 · N2 n=10 dims 3,3 | time (s): 1.8 (0.7-3.2) vs 0.2(0.1-0.3) | Hurt |
| proposed vs direct Gurobi at n>=500 | Algorithm 1 · U n=500 dims 2,2 | time (s): - -> 11 (9-16) | Improved |
| increase point dimension from 2,2 to 2,3 | Algorithm 1 · U n=100 | time (s): 0.48 (0.3-0.7) -> 278 (99-813) | Hurt |
| reflection-dominated data (N3) vs rotation-rich data (N2) | Algorithm 1 · n=500 dims 3,3 | time (s): 436 (228-862) -> 11 (9-16) | Improved |
| proposed method vs local search with random restarts | Algorithm 1 · U n=400 dims 2,2 | time (s): 322 (97-685) -> 6 (5-8) | Improved |
| proposed method vs local search | Algorithm 1 · N1 n=400 dims 2,2 | time (s): 149 (22-378) -> 4.4 (3.6-5.3) | Improved |
Closest papers by meaning
- Semidefinite Relaxations of the Gromov-Wasserstein Distance (NeurIPS 2024 · similarity 0.88)
- Gromov-Wasserstein Problem with Cyclic Symmetry (CVPR 2025 · similarity 0.87)
- Optimal Transport Barycenter via Nonconvex-Concave Minimax Optimization (ICML 2025 · similarity 0.87)
- Linear Partial Gromov-Wasserstein Embedding (ICLR 2025 · similarity 0.87)
- A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem (NeurIPS 2024 · similarity 0.87)
- Computing Optimal Transport Maps and Wasserstein Barycenters Using Conditional Normalizing Flows (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.
