A Graph Theoretic Additive Approximation of Optimal Transport

05/28/2019
by   Nathaniel Lahn, et al.
0

Transportation cost is an attractive similarity measure between probability distributions due to its many useful theoretical properties. However, solving optimal transport exactly can be prohibitively expensive. Therefore, there has been significant effort towards the design of scalable approximation algorithms. Previous combinatorial results [Sharathkumar, Agarwal STOC '12, Agarwal, Sharathkumar STOC '14] have focused primarily on the design of strongly polynomial multiplicative approximation algorithms. There has also been an effort to design approximate solutions with additive errors [Cuturi NIPS '13, Altschuler et. al NIPS '17, Dvurechensky et al., ICML '18, Quanrud, SOSA '19] within a time bound that is linear in the size of the cost matrix and polynomial in C/δ; here C is the largest value in the cost matrix and δ is the additive error. We present an adaptation of the classical graph algorithm of Gabow and Tarjan and provide a novel analysis of this algorithm that bounds its execution time by O(n^2 C/δ+ nC^2/δ^2). Our algorithm is extremely simple and executes, for an arbitrarily small constant ε, only 2C/(1-ε)δ + 1 iterations, where each iteration consists only of a Dijkstra search followed by a depth-first search. We also provide empirical results that suggest our algorithm significantly outperforms existing approaches in execution time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2018

Approximating optimal transport with linear programs

In the regime of bounded transportation costs, additive approximations f...
research
03/07/2022

A Push-Relabel Based Additive Approximation for Optimal Transport

Optimal Transport is a popular distance metric for measuring similarity ...
research
06/03/2019

A Direct Õ(1/ε) Iteration Parallel Algorithm for Optimal Transport

Optimal transportation, or computing the Wasserstein or “earth mover's” ...
research
07/14/2023

Fast Algorithms for a New Relaxation of Optimal Transport

We introduce a new class of objectives for optimal transport computation...
research
10/17/2018

Towards Optimal Running Times for Optimal Transport

In this work, we provide faster algorithms for approximating the optimal...
research
12/04/2021

Nonparametric mixture MLEs under Gaussian-smoothed optimal transport distance

The Gaussian-smoothed optimal transport (GOT) framework, pioneered in Go...
research
04/26/2022

On converses to the polynomial method

A surprising 'converse to the polynomial method' of Aaronson et al. (CCC...

Please sign up or login with your details

Forgot password? Click here to reset