Order Constraints in Optimal Transport
share
Optimal transport is a framework for comparing measures whereby a cost is incurred for transporting one measure to another. Recent works have aimed to improve optimal transport plans through the introduction of various forms of structure. We introduce novel order constraints into the optimal transport formulation to allow for the incorporation of structure. While there will are now quadratically many constraints as before, we prove a δ-approximate solution to the order-constrained optimal transport problem can be obtained in 𝒪(L^2δ^-2κ(δ(2cL_∞ (1+(mn)^1/2))^-1) · mnlog mn) time. We derive computationally efficient lower bounds that allow for an explainable approach to adding structure to the optimal transport plan through order constraints. We demonstrate experimentally that order constraints improve explainability using the e-SNLI (Stanford Natural Language Inference) dataset that includes human-annotated rationales for each assignment.
READ FULL TEXT
