Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
Computing optimal transport distances such as the earth mover's distance is a fundamental problem in machine learning, statistics, and computer vision. Despite the recent introduction of several algorithms with good empirical performance, it is unknown whether general optimal transport distance...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
Neural Information Processing Systems Foundation
2018
|
| Online Access: | http://hdl.handle.net/1721.1/116389 https://orcid.org/0000-0002-4933-1455 https://orcid.org/0000-0002-0135-7162 |