Fetching the paper…
Reading the bibliography…
In this work, we provide faster algorithms for approximating the optimal transport distance, e.g.
On the translocation of masses
L. Kantorovitch · 1958
Earlier work this paper cites.
An out-of-kilter method for minimal-cost flow problems
D. Fulkerson · 1961
Earlier work this paper cites.
Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication
Oscar H. Ibarra and Shlomo Moran · 1981
Earlier work this paper cites.
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Nathan Linial, Alex Samorodnitsky, and Avi Wigderson · 1998
Earlier work this paper cites.
Testing for equal distributions in high dimensions
Gábor J. Székely and Maria L. Rizzo · 2004
Earlier work this paper cites.
Displacement interpolation using lagrangian mass transport
Nicolas Bonneel, Michiel van de Panne, Sylvain Paris, and Wolfgang Heidrich · 2011
Earlier work this paper cites.
A near-linear time epsilon-approximation algorithm for geometric bipartite matching
R. Sharathkumar and Pankaj K. Agarwal · 2012
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Earlier work this paper cites.
Parallel algorithms for geometric graph problems
Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, and Grigory Yaroslavtsev · 2014
Earlier work this paper cites.
Approximation algorithms for bipartite matching with metric and geometric costs
Pankaj K. Agarwal and R. Sharathkumar · 2014
Earlier work this paper cites.
Path finding methods for linear programming: Solving linear programs in square root rank iterations and faster algorithms for maximum flow
Y. T. Lee and A. Sidford · 2014
Cited alongside, same era.
Donggu Kang and James Payor · 2015
Cited alongside, same era.
Sparsified cholesky solvers for sdd linear systems, 2015
Yin Tat Lee, Richard Peng, and Daniel A. Spielman · 2015
Cited alongside, same era.
Efficient inverse maintenance and faster algorithms for linear programming
Yin Tat Lee and Aaron Sidford · 2015
Cited alongside, same era.
Convolutional wasserstein distances: Efficient optimal transportation on geometric domains
Justin Solomon, Fernando de Goes, Gabriel Peyré, Marco Cuturi, Adrian Butscher, Andy Nguyen, Tao Du, and Leonidas Guibas · 2015
Cited alongside, same era.
Much faster algorithms for matrix scaling
Z. Allen-Zhu, Y. Li, R. Oliveira, and A. Wigderson · 2017
Later among the works it cites.
Distributionally robust groupwise regularization estimator
Jose Blanchet and Yang Kang · 2017
Later among the works it cites.
Data-driven optimal transport cost selection for distributionally robust optimizatio
Jose Blanchet, Yang Kang, Fan Zhang, and Karthyek Murthy · 2017
Later among the works it cites.
Matrix scaling and balancing via box constrained newton’s method and interior point methods
Michael B. Cohen, Aleksander Madry, Dimitris Tsipras, and Adrian Vladu · 2017
Later among the works it cites.
Nearly linear-time packing and covering lp solvers
Zeyuan Allen-Zhu and Lorenzo Orecchia · 2018
Closest in time.
Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling
Deeparnab Chakrabarty and Sanjeev Khanna · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Stochastic optimization for large-scale optimal transport
Aude Genevay, Marco Cuturi, Gabriel Peyré, and Francis Bach · 2016
Cited alongside, same era.
Amplitude and phase variation of point processes
Victor M. Panaretos and Yoav Zemel · 2016
Cited alongside, same era.
Wasserstein generative adversarial networks
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Cited alongside, same era.
Near-linear time approximation algorithms for optimal transport via sinkhorn iteration
Jason Altschuler, Jonathan Weed, and Philippe Rigollet · 2017
Cited alongside, same era.
Closest in time.
Computational optimal transport: Complexity by accelerated gradient descent is better than by sinkhorn’s algorithm
Pavel Dvurechensky, Alexander Gasnikov, and Alexey Kroshnin · 2018
Closest in time.
Data-driven distributionally robust optimization using the wasserstein metric: performance guarantees and tractable reformulations
Peyman Mohajerin Esfahani and Daniel Kuhn · 2018
Closest in time.
Approximating Optimal Transport With Linear Programs
Kent Quanrud · 2018
Closest in time.