0.25
0.5
0.75
1.25
1.5
1.75
2
Sinkhorn Distances: Lightspeed Computation of Optimal Transport
Published on Nov 07, 20142804 Views
Optimal transportation distances are a fundamental family of parameterized distances for histograms in the probability simplex. Despite their appealing theoretical properties, excellent performance an
Related categories
Chapter list
Sinkhorn Distances: Lightspeed Computation of Optimal Transport00:00
Optimal Transport, Wasserstein, EMD ...00:46
Regularize OT, Use Sinkhorn's Algorithm01:51
Significance of this work02:54