Research map / Learning theory and algorithms / Optimal transport
On Robust Optimal Transport: Computational Complexity and Barycenter Computation
Khang Le, Huy Nguyen, Quang Minh Nguyen, Tung Pham, Hung Bui, Nhat Ho
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 |
|---|---|---|---|
| Extend the proved RobustIBP complexity guarantee from m = 2 to m ≥ 3 | Robust semi-constrained barycenter · Fixed-support robust barycenter, m ≥ 3 | runtime complexity guarantee | No clear effect |
Closest papers by meaning
- Efficient Algorithms for Robust and Partial Semi-Discrete Optimal Transport (NeurIPS 2025 · similarity 0.92)
- Optimal Transport Barycenter via Nonconvex-Concave Minimax Optimization (ICML 2025 · similarity 0.90)
- Continuous Regularized Wasserstein Barycenters (NeurIPS 2020 · similarity 0.89)
- Computing Optimal Transport Maps and Wasserstein Barycenters Using Conditional Normalizing Flows (ICML 2025 · similarity 0.89)
- A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem (NeurIPS 2024 · similarity 0.88)
- Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transport (ICLR 2025 · similarity 0.88)
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.
