Search Results for author:
Found 6 papers, 0 papers with code
Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison
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.
Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization
This work elaborates on the important problem of (1) designing optimal randomized routing policies for reaching a target node t from a source note s on a weighted directed graph G and (2) defining distance measures between nodes interpolating between the least cost (based on optimal movements) and the commute-cost (based on a random walk on G), depending on a temperature parameter T. To this end, the randomized shortest path formalism (RSP, [2, 99, 124]) is rephrased in terms of Tsallis divergence regularization, instead of Kullback-Leibler divergence.
Randomized Shortest Paths with Net Flows and Capacity Constraints
The framework assumes a unit flow injected into a source node and collected from a target node with flows minimizing the expected transportation cost, together with a relative entropy regularization term.
Covariance and Correlation Kernels on a Graph in the Generalized Bag-of-Paths Formalism
This work derives closed-form expressions computing the expectation of co-presence and of number of co-occurrences of nodes on paths sampled from a network according to general path weights (a bag of paths).
A Constrained Randomized Shortest-Paths Framework for Optimal Exploration
The present work extends the randomized shortest-paths framework (RSP), interpolating between shortest-path and random-walk routing in a network, in three directions.
Randomized Optimal Transport on a Graph: framework and new distance measures
When the temperature is low, this formalism is shown to be equivalent to a relaxation of the optimal transport problem on a network where paths carry a flow between two discrete distributions on nodes.
