AI Paper Atlas

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

NeurIPS 2021 · Learning theory and algorithms › Optimal transport · approach: Sinkhorn and entropic OT algorithms · 4 citations (OpenAlex)

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 changedWhereMeasuredEffect
Extend the proved RobustIBP complexity guarantee from m = 2 to m ≥ 3Robust semi-constrained barycenter · Fixed-support robust barycenter, m ≥ 3runtime complexity guaranteeNo clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy