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. More precisely, a unit flow is injected into a set of input nodes and collected from a set of output nod...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2021-09
Hauptverfasser:	Courtain, Sylvain, Guex, Guillaume, Kivimaki, Ilkka, Saerens, Marco
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Entropy Nodes Regularization Shortest-path problems
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!