A Study of Performance of Optimal Transport

Cited by: 1|Bibtex|Views32|Links

Abstract:

We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph. We compare runtimes in computing OT distances on data from several domains, such as synthetic data of geometric shapes, embeddings of tokens in document...More

Code:

Data:

Your rating :
0

 

Tags
Comments