AI Paper Atlas

Research map / Learning theory and algorithms / Optimal transport

A Graph Theoretic Additive Approximation of Optimal Transport

NeurIPS 2019 · Learning theory and algorithms › Optimal transport · approach: Transport map estimation · 12 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the proposed combinatorial algorithm instead of SinkhornOptimal transport on MNIST image pairs with squared-Euclidean costs · MNISTwall-clock running timeHelped
Use the proposed combinatorial algorithm instead of Sinkhorn with both given the same error parameterOptimal transport on MNIST image pairs with squared-Euclidean costs · MNISTsolution costMixed
Use the proposed algorithm with error parameter δ instead of Sinkhorn with error parameter 5δOptimal transport on MNIST image pairs with squared-Euclidean costs · MNISTwall-clock running timeHelped
Use the proposed algorithm with error parameter δ instead of Sinkhorn with error parameter 5δOptimal transport on MNIST image pairs with squared-Euclidean costs · MNISTsolution costHelped
Reduce δProposed algorithm and Sinkhorn, Greenkhorn, and APDAGD · MNISTiteration countMixed

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