Fetching the paper…
Reading the bibliography…
We provide a computational complexity analysis for the Sinkhorn algorithm that solves the entropic regularized Unbalanced Optimal Transport (UOT) problem between two measures of possibly different masses with at most $n$ components.
On efficient optimal transport: An analysis of greedy and accelerated mirror descent algorithms
Lin, T., Ho, N., and Jordan, M. I · 1901
Earlier work this paper cites.
On the acceleration of the Sinkhorn and Greenkhorn algorithms for optimal transport
Lin, T., Ho, N., and Jordan, M. I · 1906
Earlier work this paper cites.
Spatio-temporal alignments: Optimal transport through space and time
Janati, H., Cuturi, M., and Gramfort, A · 1910
Earlier work this paper cites.
Diagonal equivalence to matrices with prescribed row and column sums
Sinkhorn, R · 1974
Earlier work this paper cites.
Topics in Optimal Transportation
Villani, C · 2003
Earlier work this paper cites.
Fast and robust earth mover’s distance
Pele, O. and Werman, M · 2009
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
Cuturi, M · 2013
Earlier work this paper cites.
Path finding methods for linear programming: Solving linear programs in O ~ ( r a n k ) \widetilde{O}(\sqrt{rank}) iterations and faster algorithms for maximum flow
Lee, Y. T. and Sidford, A · 2014
Earlier work this paper cites.
Learning with a wasserstein loss
Frogner, C., Zhang, C., Mobahi, H., Araya, M., and Poggio, T. A · 2015
Earlier work this paper cites.
Scaling algorithms for unbalanced transport problems
Chizat, L., Peyré, G., Schmitzer, B., and Vialard, F · 2016
Cited alongside, same era.
Near-linear time approximation algorithms for optimal transport via sinkhorn iteration
Altschuler, J., Weed, J., and Rigollet, P · 2017
Cited alongside, same era.
Wasserstein generative adversarial networks
Arjovsky, M., Chintala, S., and Bottou, L · 2017
Cited alongside, same era.
Optimal transport for domain adaptation
Courty, N., Flamary, R., Tuia, D., and Rakotomamonjy, A · 2017
Cited alongside, same era.
Multilevel clustering via Wasserstein means
Ho, N., Nguyen, X., Yurochkin, M., Bui, H., Huynh, V., and Phung, D · 2017
Cited alongside, same era.
A rewriting system for convex optimization problems
Agrawal, A., Verschueren, R., Diamond, S., and Boyd, S · 2018
Cited alongside, same era.
Scalable Bayes via barycenter in Wasserstein space
Srivastava, S., Li, C., and Dunson, D · 2018
Later among the works it cites.
Accelerated primal-dual coordinate descent for computational optimal transport
Guo, W., Ho, N., and Jordan, M. I · 2019
Later among the works it cites.
A direct O ~ ( 1 / ε ) \widetilde{O}(1/\varepsilon) iteration parallel algorithm for optimal transport
Jambulapati, A., Sidford, A., and Tian, K · 2019
Later among the works it cites.
Parallel unbalanced optimal transport regularization for large scale imaging problems
Lee, J., Bertrand, N. P., and Rozell, C. J · 2019
Later among the works it cites.
Computational optimal transport
Peyré, G. and Cuturi, M · 2019
Later among the works it cites.
Optimal-transport analysis of single-cell gene expression identifies developmental trajectories in reprogramming
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Towards optimal running times for optimal transport
Blanchet, J., Jambulapati, A., Kent, C., and Sidford, A · 2018
Cited alongside, same era.
Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn’s algorithm
Dvurechensky, P., Gasnikov, A., and Kroshnin, A · 2018
Cited alongside, same era.
Optimal entropy-transport problemsand a new Hellinger–Kantorovich distance between positive measures
Liero, M., Mielke, A., and Savaré, M. I · 2018
Cited alongside, same era.
Wasserstein regularization for sparse multi-task regression
Janati, H., Cuturi, M., and Gramfort, A
Cited in the paper.
Schiebinger, G. et al · 2019
Later among the works it cites.
Sinkhorn divergences for unbalanced optimal transport
Séjourné, T., Feydy, J., Vialard, F.-X., Trouvé, A., and Peyré, G · 2019
Later among the works it cites.
Scalable unbalanced optimal transport using generative adversarial networks
Yang, K. D. and Uhler, C · 2019
Later among the works it cites.