Approximating optimal transport with linear programs

10/14/2018
by   Kent Quanrud, et al.
0

In the regime of bounded transportation costs, additive approximations for the optimal transport problem are reduced (rather simply) to relative approximations for positive linear programs, resulting in faster additive approximation algorithms for optimal transport.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2023

Optimal Transport with Tempered Exponential Measures

In the field of optimal transport, two prominent subfields face each oth...
research
10/17/2018

Towards Optimal Running Times for Optimal Transport

In this work, we provide faster algorithms for approximating the optimal...
research
10/14/2022

Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources

Branched Optimal Transport (BOT) is a generalization of optimal transpor...
research
05/28/2019

A Graph Theoretic Additive Approximation of Optimal Transport

Transportation cost is an attractive similarity measure between probabil...
research
09/19/2023

Predicate Classification Using Optimal Transport Loss in Scene Graph Generation

In scene graph generation (SGG), learning with cross-entropy loss yields...
research
07/14/2021

Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, and More

The current best practice for computing optimal transport (OT) is via en...
research
11/22/2022

The transport problem for non-additive measures

Non-additive measures, also known as fuzzy measures, capacities, and mon...

Please sign up or login with your details

Forgot password? Click here to reset