Timeline for Efficient algorithm for Wasserstein-1 distance in graph setting
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21, 2017 at 10:40 | comment | added | JustSomeGuy | @IgorRivin I'll make sure to look over the second part, thanks for the tip! | |
| Sep 9, 2017 at 16:48 | comment | added | Igor Rivin | @RW The second part of the paper deals with the regularization of the Wasserstein distance to make it more computationally tractable. | |
| Sep 9, 2017 at 15:59 | comment | added | R W | You are. First, that paper deals with finding barycenters (i.e., minimization of weighted sums of distances to a given collection of measures) rather than with finding the distance per se. Second, it deals with 2-distance rather than 1-distance the OP is asking about. | |
| Sep 9, 2017 at 15:36 | history | answered | Igor Rivin | CC BY-SA 3.0 |