Timeline for Efficient algorithm for Wasserstein-1 distance in graph setting
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21, 2017 at 10:41 | comment | added | JustSomeGuy | I agree, but I want to avoid inventing the wheel twice, so I was more interested in existing algorithms, thanks for the tip though! | |
| Sep 11, 2017 at 15:52 | comment | added | R W | My point is that order 1 metric has properties absent in other orders, and therefore it might be sensible to use these properties rather than ignoring them. | |
| Sep 11, 2017 at 15:34 | comment | added | JustSomeGuy | Yeah, I kind of agree with @FedericoPoloni. In my field the focus is on Wasserstein metrics (of any order), and in order 1 calculating the metric is equivalent to solving a transportation problem. I'm aware of the duality, but I don't see how this can be utilized to derive an efficient algorithm? | |
| Sep 10, 2017 at 6:08 | comment | added | Federico Poloni | It seems like there is a lot of distance between this suggestion and a practical algorithm... | |
| Sep 9, 2017 at 21:35 | comment | added | R W | Why? Isn't it clear enough that I suggest to look at the dual problem? | |
| Sep 9, 2017 at 17:50 | comment | added | Federico Poloni | This should be a comment I guess? | |
| Sep 9, 2017 at 15:56 | history | answered | R W | CC BY-SA 3.0 |