A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison
[article]
2021
arXiv
pre-print
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into a set of input nodes and collected from a set of output nodes while minimizing the expected transportation cost together with a paths relative entropy regularization term, providing a randomized routing policy. The main advantage of this new formulation is
arXiv:2108.10004v2
fatcat:aan3ffcbonhuxg67v3xrtjhgl4