Fetching the paper…
Reading the bibliography…
Computing optimal transport distances such as the earth mover's distance is a fundamental problem in machine learning, statistics, and computer vision.
Über die Umkehrung der Naturgesetze
E. Schrödinger · 1931
Earlier work this paper cites.
Diagonal equivalence to matrices with prescribed row and column sums
R. Sinkhorn · 1967
Earlier work this paper cites.
Methods for scaling to doubly stochastic form
B. Parlett and T. Landis · 1982
Earlier work this paper cites.
A distance metric for multidimensional histograms
M. Werman, S. Peleg, and A. Rosenfeld · 1985
Earlier work this paper cites.
A polynomial-time algorithm, based on Newton’s method, for linear programming
J. Renegar · 1988
Earlier work this paper cites.
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
B. Kalantari and L. Khachiyan · 1993
Earlier work this paper cites.
On the complexity of nonnegative-matrix scaling
B. Kalantari and L. Khachiyan · 1996
Earlier work this paper cites.
The deflation-inflation method for certain semidefinite programming and maximum determinant completion problems
L. Gurvits and P. Yianilos · 1998
Earlier work this paper cites.
The earth mover’s distance as a metric for image retrieval
Y. Rubner, C. Tomasi, and L. J. Guibas · 2000
Earlier work this paper cites.
Fast image retrieval via embeddings
P. Indyk and N. Thaper · 2003
Earlier work this paper cites.
Fast contour matching using approximate earth mover’s distance
K. Grauman and T. Darrell · 2004
Earlier work this paper cites.
Testing for equal distributions in high dimension
G. J. Székely and M. L. Rizzo · 2004
Earlier work this paper cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
D. A. Spielman and S.-H. Teng · 2004
Earlier work this paper cites.
Prediction, learning, and games
N. Cesa-Bianchi and G. Lugosi · 2006
Earlier work this paper cites.
Learning by mirror averaging
A. Juditsky, P. Rigollet, and A. Tsybakov · 2008
Earlier work this paper cites.
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
B. Kalantari, I. Lari, F. Ricca, and B. Simeone · 2008
Cited alongside, same era.
Approximate earth mover’s distance in linear time
S. Shirdhonkar and D. W. Jacobs · 2008
Cited alongside, same era.
Fast and robust earth mover’s distances
O. Pele and M. Werman · 2009
Cited alongside, same era.
Optimal transport
C. Villani · 2009
Cited alongside, same era.
Displacement interpolation using Lagrangian mass transport
N. Bonneel, M. van de Panne, S. Paris, and W. Heidrich · 2011
Cited alongside, same era.
Exponential screening and optimal rates of sparse estimation
P. Rigollet and A. Tsybakov · 2011
Cited alongside, same era.
Convex optimization: Algorithms and complexity
S. Bubeck · 2015
Later among the works it cites.
Fast Optimal Transport Averaging of Neuroimaging Data
A. Gramfort, G. Peyré, and M. Cuturi · 2015
Later among the works it cites.
Statistical model criticism using kernel two sample tests
J. R. Lloyd and Z. Ghahramani · 2015
Later among the works it cites.
Principal differences analysis: Interpretable characterization of differences between distributions
J. Mueller and T. Jaakkola · 2015
Later among the works it cites.
Convolutional wasserstein distances: Efficient optimal transportation on geometric domains
J. Solomon, F. de Goes, G. Peyré, M. Cuturi, A. Butscher, A. Nguyen, T. Du, and L. Guibas · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Nonnegative matrix factorization with earth mover’s distance metric for image analysis
R. Sandler and M. Lindenbaum · 2011
Cited alongside, same era.
Sparse estimation by exponential weighting
P. Rigollet and A. Tsybakov · 2012
Cited alongside, same era.
A near-linear time
R. Sharathkumar and P. K. Agarwal · 2012
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
M. Cuturi · 2013
Cited alongside, same era.
Parallel algorithms for geometric graph problems
A. Andoni, A. Nikolov, K. Onak, and G. Yaroslavtsev · 2014
Cited alongside, same era.
Approximation algorithms for bipartite matching with metric and geometric costs
P. K. Agarwal and R. Sharathkumar · 2014
Cited alongside, same era.
R. Flamary, M. Cuturi, N. Courty, and A. Rakotomamonjy · 2016
Later among the works it cites.
Stochastic optimization for large-scale optimal transport
A. Genevay, M. Cuturi, G. Peyré, and F. Bach · 2016
Later among the works it cites.
Interpretable distribution features with maximum testing power
W. Jitkrittum, Z. Szabó, K. P. Chwialkowski, and A. Gretton · 2016
Later among the works it cites.
Amplitude and phase variation of point processes
V. M. Panaretos and Y. Zemel · 2016
Later among the works it cites.
M. Arjovsky, S. Chintala, and L. Bottou · 2017
Closest in time.
Much faster algorithms for matrix scaling
Z. Allen-Zhu, Y. Li, R. Oliveira, and A. Wigderson · 2017
Closest in time.
Geodesic PCA in the Wasserstein space by convex PCA
J. Bigot, R. Gouet, T. Klein, and A. López · 2017
Closest in time.
Matrix scaling and balancing via box constrained Newton’s method and interior point methods
M. B. Cohen, A. Madry, D. Tsipras, and A. Vladu · 2017
Closest in time.
Minimizing finite sums with the stochastic average gradient
M. Schmidt, N. Le Roux, and F. Bach · 2017
Closest in time.