Generative adversarial learning of Sinkhorn algorithm initializations
Authors
- Geuter, Jonathan
- Laschos, Vaios
ORCID: 0000-0001-8721-5335
2020 Mathematics Subject Classification
- 68T07
Keywords
- Machine learning, optimal transport
DOI
Abstract
The Sinkhorn algorithm [Cut13] is the state-of-the-art to compute approximations of optimal transport distances between discrete probability distributions, making use of an entropically regularized formulation of the problem. The algorithm is guaranteed to converge, no matter its initialization. This lead to little attention being paid to initializing it, and simple starting vectors like the n-dimensional one-vector are common choices. We train a neural network to compute initializations for the algorithm, which significantly outperform standard initializations. The network predicts a potential of the optimal transport dual problem, where training is conducted in an adversarial fashion using a second, generating network. The network is universal in the sense that it is able to generalize to any pair of distributions of fixed dimension. Furthermore, we show that for certain applications the network can be used independently.
Download Documents