Research map / Learning theory and algorithms / Optimal transport
Slicing Wasserstein over Wasserstein via Functional Optimal Transport
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.
Closest papers by meaning
- Sliced Gromov-Wasserstein (NeurIPS 2019 · similarity 0.92)
- Tree-Sliced Wasserstein Distance with Nonlinear Projection (ICML 2025 · similarity 0.92)
- Sliced Wasserstein Estimation with Control Variates (ICLR 2024 · similarity 0.92)
- Distance-Based Tree-Sliced Wasserstein Distance (ICLR 2025 · similarity 0.91)
- Fourier Sliced-Wasserstein Embedding for Multisets and Measures (ICLR 2025 · similarity 0.90)
- Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distances (ICML 2025 · similarity 0.90)
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.