Fetching the paper…
Reading the bibliography…
Computing the quadratic transportation metric (also called the $2$-Wasserstein distance or root mean square distance) between two point clouds, or, more generally, two discrete distributions, is a fundamental problem in machine learning, statistics, computer graphics, and theoretical computer science.
Estimating nonnegative matrices from marginal data
Michael Bacharach · 1965
Earlier work this paper cites.
Diagonal equivalence to matrices with prescribed row and column sums
Richard Sinkhorn · 1967
Earlier work this paper cites.
The use of entropy maximising models, in the theory of trip distribution, mode split and route split
Alan Geoffrey Wilson · 1969
Earlier work this paper cites.
Scalings of matrices which have prespecified row sums and column sums via optimization
Uriel G. Rothblum and Hans Schneider · 1989
Earlier work this paper cites.
A faster strongly polynomial minimum cost flow algorithm
James B Orlin · 1993
Earlier work this paper cites.
An optimal algorithm for approximate nearest neighbor searching in fixed dimensions
Sunil Arya, David M. Mount, Nathan Netanyahu, Ruth Silverman, and Angela Y. Wu · 1994
Earlier work this paper cites.
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Nathan Linial, Alex Samorodnitsky, and Avi Wigderson · 2000
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.
Efficient SVM training using low-rank kernel representations
Shai Fine and Katya Scheinberg · 2001
Earlier work this paper cites.
Learning with kernels: support vector machines, regularization, optimization, and beyond
Bernhard Scholkopf and Alexander J Smola · 2001
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms
Moses S. Charikar · 2002
Earlier work this paper cites.
Kernel independent component analysis
Francis R. Bach and Michael I. Jordan · 2003
Earlier work this paper cites.
Classical deterministic complexity of edmonds’ problem and quantum entanglement
Leonid Gurvits · 2003
Earlier work this paper cites.
Fast Image Retrieval via Embeddings
Piotr Indyk and Nitin Thaper · 2003
Earlier work this paper cites.
Combinatorial optimization. Polyhedra and efficiency. Vol. A , volume 24 of
Alexander Schrijver · 2003
Earlier work this paper cites.
Topics in optimal transportation
Cédric Villani · 2003
Earlier work this paper cites.
Algorithms for dynamic geometric problems over data streams
Piotr Indyk · 2004
Earlier work this paper cites.
On bipartite matching under the RMS distance
Pankaj K. Agarwal and Jeff M. Phillips · 2006
Earlier work this paper cites.
Beyond bags of features: spatial pyramid matching for recognizing natural scene categories
Svetlana Lazebnik, Cordelia Schmid, and Jean Ponce · 2006
Earlier work this paper cites.
A near linear time constant factor approximation for euclidean bichromatic matching (cost)
Piotr Indyk · 2007
Cited alongside, same era.
A linear time histogram metric for improved SIFT matching
Ofir Pele and Michael Werman · 2008
Cited alongside, same era.
Random features for large-scale kernel machines
Ali Rahimi and Benjamin Recht · 2008
Cited alongside, same era.
Support Vector Machines
Ingo Steinwart and Andreas Christmann · 2008
Cited alongside, same era.
Optimal transport: old and new , volume 338
Cédric Villani · 2008
Cited alongside, same era.
Displacement interpolation using lagrangian mass transport
Nicolas Bonneel, Michiel Van De Panne, Sylvain Paris, and Wolfgang Heidrich · 2011
Cited alongside, same era.
Optimal transport for domain adaptation
Nicolas Courty, Rémi Flamary, Devis Tuia, and Alain Rakotomamonjy · 2015
Later among the works it cites.
Optimal transport for applied mathematicians
Filippo Santambrogio · 2015
Later among the works it cites.
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
Later among the works it cites.
Impossibility of sketching of the 3D transportation metric with quadratic cost
Alexandr Andoni, Assaf Naor, and Ofer Neiman · 2016
Later among the works it cites.
Stochastic optimization for large-scale optimal transport
Aude Genevay, Marco Cuturi, Gabriel Peyré, and Francis Bach · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Andrew Cotter, Joseph Keshet, and Nathan Srebro · 2011
Cited alongside, same era.
An optimal transport approach to robust reconstruction and simplification of 2D shapes
Fernando De Goes, David Cohen-Steiner, Pierre Alliez, and Mathieu Desbrun · 2011
Cited alongside, same era.
HOT: Hodge-optimized triangulations
Patrick Mullen, Pooran Memari, Fernando de Goes, and Mathieu Desbrun · 2011
Cited alongside, same era.
Elements of Information Theory
Thomas M Cover and Joy A Thomas · 2012
Cited alongside, same era.
Blue noise through optimal transport
Fernando De Goes, Katherine Breeden, Victor Ostromoukhov, and Mathieu Desbrun · 2012
Cited alongside, same era.
A near-linear time
R. Sharathkumar and Pankaj K. Agarwal · 2012
Cited alongside, same era.
Wittawat Jitkrittum, Zoltán Szabó, Kacper P Chwialkowski, and Arthur Gretton · 2016
Later among the works it cites.
Much faster algorithms for matrix scaling
Zeyuan Allen-Zhu, Yuanzhi Li, Rafael Oliveira, and Avi Wigderson · 2017
Later among the works it cites.
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
Jason Altschuler, Jonathan Weed, and Philippe Rigollet · 2017
Later among the works it cites.
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Later among the works it cites.
From optimal transport to generative modeling: the VEGAN cookbook
Olivier Bousquet, Sylvain Gelly, Ilya Tolstikhin, Carl-Johann Simon-Gabriel, and Bernhard Schoelkopf · 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.
Computational optimal transport
Gabriel Peyré and Marco Cuturi · 2017
Later among the works it cites.
Inference via low-dimensional couplings
Alessio Spantini, Daniele Bigoni, and Youssef Marzouk · 2017
Later among the works it cites.
Approximate nearest neighbor search in high dimensions
Alexandr Andoni, Piotr Indyk, and Ilya Razenshteyn · 2018
Closest in time.
Towards optimal running times for optimal transport
Jose Blanchet, Arun Jambulapati, Carson Kent, and Aaron Sidford · 2018
Closest in time.
Pavel Dvurechensky, Alexander Gasnikov, and Alexey Kroshnin · 2018
Closest in time.
Statistical optimal transport via factored couplings
Aden Forrow, Jan-Christian Hütter, Mor Nitzan, Philippe Rigollet, Geoffrey Schiebinger, and Jonathan Weed · 2018
Closest in time.
Approximating optimal transport with linear programs
Kent Quanrud · 2019
Closest in time.