REVIEW 1 cited by
String Diagram of Optimal Transports
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We present a novel hierarchical framework for optimal transport (OT) using string diagrams, namely string diagrams of optimal transports. This framework reduces complex hierarchical OT problems to standard OT problems, allowing efficient synthesis of optimal hierarchical transportation plans. Our approach uses algebraic compositions of cost matrices to effectively model hierarchical structures. We also study an adversarial situation with multiple choices in the cost matrices, where we present a polynomial-time algorithm for a relaxation of the problem. Experimental results confirm the efficiency and performance advantages of our proposed algorithm over the naive method.
Forward citations
Cited by 1 Pith paper
-
Sinkhorn Algorithm for Sequentially Composed Optimal Transports
A Sinkhorn-type algorithm for sequentially composed optimal transport is shown to converge exponentially in the Hilbert metric and, for two stages, to have near-linear worst-case time in the plan size.
Discussion (0). Continue with ORCID to comment.