Fetching the paper…
Reading the bibliography…
We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph.
The hungarian method for the assignment problem
H. W. Kuhn · 1955
Earlier work this paper cites.
Variants of the hungarian method for assignment problems
H. W. Kuhn · 1956
Earlier work this paper cites.
Algorithms for the assignment and transportation problems
J. Munkres · 1957
Earlier work this paper cites.
Scaling algorithms for network problems
Harold Gabow · 1985
Earlier work this paper cites.
The auction algorithm for the transportation problem
Dimitri Bertsekas and David Castanon · 1989
Earlier work this paper cites.
Faster scaling algorithms for general graph matching problems
Harold N. Gabow and Robert E. Tarjan · 1991
Earlier work this paper cites.
Network flows - theory, algorithms and applications
Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin · 1993
Earlier work this paper cites.
The earth mover’s distance as a metric for image retrieval
Yossi Rubner, Carlo Tomasi, and Leonidas J. Guibas · 2000
Earlier work this paper cites.
On algorithms for permuting large entries to the diagonal of a sparse matrix
Iain Duff and Jacko Koster · 2001
Earlier work this paper cites.
Benchmarking optimization software with performance profiles
Elizabeth D. Dolan, and Jorge J. Moré · 2002
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Alex Krizhevsky · 2009
Earlier work this paper cites.
MNIST handwritten digit database
Yann LeCun and Corinna Cortes · 2010
Cited alongside, same era.
Lemon - an open source c++ graph template library
Balázs Dezs, Alpár Jüttner, and Péter Kovács · 2011
Cited alongside, same era.
Nonnegative matrix factorization with earth mover’s distance metric for image analysis
Roman Sandler and Michael Lindenbaum · 2011
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Cited alongside, same era.
Path finding methods for linear programming: Solving linear programs in õ(vrank) iterations and faster algorithms for maximum flow
Yin Tat Lee and Aaron Sidford · 2014
Cited alongside, same era.
Glove: Global vectors for word representation
Jeffrey Pennington, Richard Socher, and Christopher D. Manning · 2014
Wasserstein generative adversarial networks
Martín Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Later among the works it cites.
Geodesic PCA in the Wasserstein space by convex PCA
J. Bigot, R. Gouet, T. Klein, and A. López · 2017
Later among the works it cites.
Multilevel clustering via wasserstein means
Nhat Ho, XuanLong Nguyen, Mikhail Yurochkin, Hung Hai Bui, Viet Huynh, and Dinh Q. Phung · 2017
Later among the works it cites.
Optimal mass transport: Signal processing and machine-learning applications
Soheil Kolouri, Se Rim Park, Matthew Thorpe, Dejan Slepcev, and Gustavo K. Rohde · 2017
Later among the works it cites.
Towards optimal running times for optimal transport
Jose H. Blanchet, Arun Jambulapati, Carson Kent, and Aaron Sidford · 2018
Later among the works it cites.
Computational optimal transport: Complexity by accelerated gradient descent is better than by sinkhorn’s algorithm
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Wasserstein propagation for semi-supervised learning
Justin Solomon, Raif M. Rustamov, Leonidas J. Guibas, and Adrian Butscher · 2014
Cited alongside, same era.
Iterative bregman projections for regularized transportation problems
Jean-David Benamou, Guillaume Carlier, Marco Cuturi, Luca Nenna, and Gabriel Peyré · 2015
Cited alongside, same era.
From word embeddings to document distances
Matt J. Kusner, Yu Sun, Nicholas I. Kolkin, and Kilian Q. Weinberger · 2015
Cited alongside, same era.
Stochastic optimization for large-scale optimal transport
Aude Genevay, Marco Cuturi, Gabriel Peyré, and Francis R. Bach · 2016
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.
HSL, A Collection of Fortran Codes for Large Scale Scientific Computation
HSL (formerly the Harwell Subroutine Library)
Cited in the paper.
Pavel E. Dvurechensky, Alexander Gasnikov, and Alexey Kroshnin · 2018
Later among the works it cites.
Allennlp: A deep semantic natural language processing platform
Matt Gardner, Joel Grus, Mark Neumann, Oyvind Tafjord, Pradeep Dasigi, Nelson F. Liu, Matthew E. Peters, Michael Schmitz, and Luke Zettlemoyer · 2018
Later among the works it cites.
A graph theoretic additive approximation of optimal transport
Nathaniel Lahn, Deepika Mulchandani, and Sharath Raghvendra · 2019
Later among the works it cites.
On efficient optimal transport: An analysis of greedy and accelerated mirror descent algorithms
Tianyi Lin, Nhat Ho, and Michael I. Jordan · 2019
Later among the works it cites.
Approximating optimal transport with linear programs
Kent Quanrud · 2019
Later among the works it cites.
Openblas: An optimized blas library
Zhang Xianyi, Martin Kroeker, Werner Saar, Wang Qian, Zaheer Chothia, Chen Shaohu, and Luo Wen · 2019
Later among the works it cites.