Research map / Learning theory and algorithms / Optimal transport
Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm
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
- Finding Wasserstein Ball Center: Efficient Algorithm and The Applications in Fairness (ICML 2025 · similarity 0.90)
- Optimal Transport Barycenter via Nonconvex-Concave Minimax Optimization (ICML 2025 · similarity 0.89)
- A Unified Approach for Computing Wasserstein Barycenters of Discrete and Continuous Measures (NeurIPS 2026 · similarity 0.89)
- On the Convergence of Projected Bures-Wasserstein Gradient Descent under Euclidean Strong Convexity (ICML 2024 · similarity 0.87)
- Fréchet Regression on the Bures-Wasserstein Manifold (NeurIPS 2026 · similarity 0.87)
- Computing Optimal Transport Maps and Wasserstein Barycenters Using Conditional Normalizing Flows (ICML 2025 · similarity 0.86)
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.