Research map / Optimization / Nonconvex and smooth optimization
A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters
Lei Yang, Jia Li, Defeng Sun, Kim-Chuan Toh
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 |
|---|---|---|---|
| use sGS-ADMM on the dual LP instead of Gurobi for large-scale Wasserstein barycenter LPs | Gurobi 8.0.0 · Synthetic Wasserstein barycenter LPs (pre-specified support) | computational time | Improved |
| use sGS-ADMM instead of IBP and BADMM | IBP, BADMM · Synthetic and MNIST barycenter problems | accuracy and speed | No clear effect |
Closest papers by meaning
- Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm (NeurIPS 2020 · similarity 0.93)
- Optimal Transport Barycenter via Nonconvex-Concave Minimax Optimization (ICML 2025 · similarity 0.91)
- A Unified Approach for Computing Wasserstein Barycenters of Discrete and Continuous Measures (NeurIPS 2026 · similarity 0.90)
- Finding Wasserstein Ball Center: Efficient Algorithm and The Applications in Fairness (ICML 2025 · similarity 0.90)
- Estimating Barycenters of Distributions with Neural Optimal Transport (ICML 2024 · similarity 0.88)
- Towards Marginal Fairness Sliced Wasserstein Barycenter (ICLR 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.
