Corpus ID: 211068892

# On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm

@article{Pham2020OnUO,
title={On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm},
author={Khiem Pham and Khang D Le and Nhat Ho and Tung Pham and Hung Hai Bui},
journal={ArXiv},
year={2020},
volume={abs/2002.03293}
}
• Khiem Pham, +2 authors Hung Hai Bui
• Published 2020
• Mathematics, Computer Science
• ArXiv
• We provide a computational complexity analysis for the Sinkhorn algorithm that solves the entropic regularized Unbalanced Optimal Transport (UOT) problem between two measures of possibly different masses with at most $n$ components. We show that the complexity of the Sinkhorn algorithm for finding an $\varepsilon$-approximate solution to the UOT problem is of order $\widetilde{\mathcal{O}}(n^2/ \varepsilon)$, which is near-linear time. To the best of our knowledge, this complexity is better… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

## On the Acceleration of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport

• Tianyi Lin
• Computer Science, Mathematics
• ArXiv
• 2019
VIEW 3 EXCERPTS

## On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms

• Tianyi Lin
• Mathematics, Computer Science
• ICML
• 2019
VIEW 3 EXCERPTS

## Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm

• Computer Science, Mathematics
• ICML
• 2018
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

## Towards Optimal Running Times for Optimal Transport

• Mathematics, Computer Science
• ArXiv
• 2018
VIEW 1 EXCERPT

## A Direct Õ(1/ε) Iteration Parallel Algorithm for Optimal Transport

• Computer Science
• ArXiv
• 2019
VIEW 1 EXCERPT

## Accelerated Primal-Dual Coordinate Descent for Computational Optimal Transport

• Mathematics, Computer Science
• ArXiv
• 2019
VIEW 2 EXCERPTS

## Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration

• Computer Science, Mathematics
• NIPS
• 2017
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

## Scaling Algorithms for Unbalanced Transport Problems

• Mathematics
• 2017
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

## Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow

• Mathematics, Computer Science
• 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
• 2014
VIEW 1 EXCERPT

## Sinkhorn Distances: Lightspeed Computation of Optimal Transport

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL