Computing all Optimal Partial Transports

We consider the classical version of the optimal partial transport problem. Let µ (with a mass of U ) and ν (with a mass of S) be two discrete mass distributions with S ≤ U and let n be the total number of points in the supports of µ and ν. For a parameter α ∈ [0, S], consider the minimum-cost transport plan σ α that transports a mass of α from ν to µ. An OT-profile captures the behavior of the cost of σ α as α varies from 0 to S. There is only limited work on OT-profile and its mathematical properties (see Figalli ( 2010 )). In this paper, we present a novel framework to analyze the properties of the OT-profile and also present an algorithm to compute it. When µ and ν are discrete mass distributions, we show that the OT-profile is a piecewise-linear non-decreasing convex function. Let K be the combinatorial complexity of this function, i.e., the number of line segments required to represent the OT-profile. Our exact algorithm computes the OT-profile in Õ(n 2 K) time. Given δ > 0, we also show that the algorithm by Lahn et al. ( 2019 ) can be used to δ-approximate the OT-profile in O(n 2 /δ + n/δ 2 ) time. This approximation is a piecewise-linear function of a combinatorial complexity of O(1/δ). An OT-profile is arguably more valuable than the OT-cost itself and can be used within applications. Under a reasonable assumption of outliers, we also show that the first derivative of the OT-profile sees a noticeable rise before any of the mass from outliers is transported. By using this property, we get an improved prediction accuracy for an outlier detection experiment. We also use this property to predict labels and estimate the class priors within PU-Learning experiments. Both these experiments are conducted on real datasets.