arXiv Analytics

Sign in

arXiv:1903.03850 [cs.LG]AbstractReferencesReviewsResources

Stochastic Incremental Algorithms for Optimal Transport with SON Regularizer

Ashkan Panahi, Erik Thiel, Morteza H. Cheraghani, Devdatt Dubhashi

Published 2019-03-09Version 1

We introduce a new regularizer for optimal transport (OT) which is tailored to better preserve the class structure. We give the first theoretical guarantees for an OT scheme that respects class structure. We give an accelerated proximal--projection scheme for this formulation with the proximal operator in closed form to give a highly scalable algorithm for computing optimal transport plans. We give a novel argument for the uniqueness of the optimum even in the absence of strong convexity. Our experiments show that the new regularizer preserves class structure better and is more robust compared to previous regularizers.

Related articles: Most relevant | Search more
arXiv:1905.11885 [cs.LG] (Published 2019-05-28)
Differentiable Sorting using Optimal Transport:The Sinkhorn CDF and Quantile Operator
arXiv:1906.09218 [cs.LG] (Published 2019-06-21)
FlipTest: Fairness Auditing via Optimal Transport
arXiv:1911.02053 [cs.LG] (Published 2019-11-05)
Alleviating Label Switching with Optimal Transport