Structured Optimal Transport
arXiv:1712.06199
Abstract
Optimal Transport has recently gained interest in machine learning for applications ranging from domain adaptation, sentence similarities to deep learning. Yet, its ability to capture frequently occurring structure beyond the "ground metric" is limited. In this work, we develop a nonlinear generalization of (discrete) optimal transport that is able to reflect much additional structure. We demonstrate how to leverage the geometry of this new model for fast algorithms, and explore connections and properties. Illustrative experiments highlight the benefit of the induced structured couplings for tasks in domain adaptation and natural language processing.
References in corpus (5)
- Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
- Efficient Minimization of Decomposable Submodular Functions
- Submodular Functions: from Discrete to Continous Domains
- Decomposable Submodular Function Minimization: Discrete and Continuous
- On the Convergence Rate of Decomposable Submodular Function Minimization